Minimum Geometric Spanning Trees
Author:
Levcopoulos Christos
Reference15 articles.
1. Agarwal PK, Edelsbrunner H, Schwarzkopf O, Welzl E (1991) Euclidean minimum spanning trees and bichromatic closest pairs. Discret Comput Geom 6:407–422
2. Bespamyatnikh S (1997) On constructing minimum spanning trees in R
1
k
. Algorithmica 18(4):524–529
3. Bespamyatnikh S (1998) An optimal algorithm for closest-pair maintenance. Discret Comput Geom 19(2):175–195
4. Callahan PB, Kosaraju SR (1993) Faster algorithms for some geometric graph problems in higher dimensions. In: SODA, Austin, pp 291–300
5. Chatterjee S, Connor M, Kumar P (2010) Geometric minimum spanning trees with GeoFilterKruskal. In: Experimental Algorithms: proceedings of SEA, Ischia Island. LNCS, vol 6049, pp 486–500