Sequences of spanning trees and a fixed tree theorem

Computational Geometry: Theory and Applications

Volumn 21, Issue 1-2, 2002, Pages 3-20

  Aichholzer, Oswin ^a   Aurenhammer, Franz ^b   Hurtado, Ferran ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Canonical sequence of trees; Constrained delaunay triangulation; Crossing free geometric graph; Edge operations; Euclidean minimum spanning tree

Indexed keywords

EID: 31244436526     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00042-6     Document Type: Article

References (18)

1. O. Aichholzer, H. Alt, G. Rote, Matching shapes with a reference point, Internat. J. Comput. Geom. Appl. 7 (1997) 349-363.
2. M. Ajtai, V. Chvatal, M.M. Newborn, E. Szemerdi, Crossing-free subgraphs, Ann. Discrete Math. 12 (1982) 9-12.
3. H. Alt, U. Fuchs, G. Rote, G. Weber, Matching convex shapes with respect to the symmetric difference, Algorithmica21 (1998)89-103
4. H. Alt, M. Godau, Computing the Frechet distance between two polygonal curves, Internat. J. Comput. Geom. Appl. 5 (1995) 75-91.
5. F. Aurenhammer, R. Klein, Voronoi diagrams, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier Science, Amsterdam, 2000, pp. 201-290.
6. D. Avis, K. Fukuda, Reverse search for enumeration, Discrete Appl. Math. 65 (1996) 618-632.
7. P. Bose, J. Czyzowicz, F. Hurtado, Rotation flips and non-crossing trees, Manuscript.
8. L.P. Chew, Constrained Delaunay triangulations, Algorithmica 4 (1989) 97-108.
9. S. Fortune, Voronoi diagrams and Delaunay triangulations, in: D.Z. Du, F.K. Hwang (Eds.), Computing in Euclidean Geometry, 2nd Edition, World Scientific, Singapore, 1995, pp. 225-265.
10. n, Computational Geometry 16 (2000) 211-221.
11. W. Goddard, H.C. Swart, Distances between graphs under edge operations, Discrete Math. 161 (1996) 121-132.
12. M.C. Hemando, F. Hurtado, A. Marquez, M. Mora, M. Noy, Geometric tree graphs of points in convex position, Discrete Appl. Math. 93 (1999) 51-66.
13. M.C. Hernando, M.E. Houle, F. Hurtado, On local transformation of polygons with visibility properties, in: Proc. of 6th International Computing and Combinatorics Conference COCOON'00, Lecture Notes in Computer Science, Vol. 1858, Springer, Berlin, 2000, pp. 54-63.
14. C.A. Holzmann, F. Harary, On the tree graph of a matroid, SIAM J. Appl. Math. 22 (1972) 187-193.
15. G. Karolyi, J. Pach, G. Toth, Ramsey-type results for geometric graphs, J Discrete Comput. Geom. 18 (1997) 247-255.
16. J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956) 48-50.
17. D.T. Lee, A.K. Lin, Generalized Delaunay triangulation for planar graphs, Discrete Comput. Geom. 1 (1986) 201-217.
18. G. Liu, On connectivities of tree graphs, J. Graph Theory 12 (1988) 453-459.