Flipping edges in triangulations

Discrete and Computational Geometry

Volumn 22, Issue 3, 1999, Pages 333-346

  Hurtado, F ^a   Noy, M ^a   Urrutia, J ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033411794     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009464     Document Type: Article

References (15)

1. D. Avis, Generating rooted triangulations without repetitions, Algorithmica 16 (1996), 618-632.
2. M. Bern and D. Eppstein, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, 2nd edition, D.Z. Du and F.K. Hwang, eds., World Scientific, Singapore (1995), pp. 47-123.
3. H. Edelsbrunner and N.R. Shah, Incremental topological flipping works for regular triangulations. Algorithmica 15 (1996), 223-241.
4. 2 log n) time algorithm for the minmax angle triangulation, SIAM J. Sci. Statist. Comput. 13 (1992), 994-1008.
5. S. Fortune, Voronoi diagrams and Delaunay triangulations, in Computing in Euclidean Geometry, 2nd edition, D.Z. Du and F.K. Hwang, eds., World Scientific, Singapore (1995), pp. 225-265.
6. S. Hanke, Ebene Triangulationen, Master's Thesis, Insitut für Informatik, University of Freiburg (1994).
7. S. Hanke, T. Ottmann, and S. Schuierer, The edge-flipping distance of triangulations, J. Universal Comput. Sci. 2 (1996), 570-579.
8. F. Hurtado and M. Noy, The graph of triangulations of a convex polygon, Report MA2-IR-94-13, Universitat Politècnica de Catalunya (1994) (an abstract has appeared in Proc. Symp. on Computational Geomextry (1996), pp. C7-C8). To appear in Comput. Geom. Theory Appl.
9. 1 surface interpolation, in Mathematical Software III, J. Rice, ed., Academic Press, New York (1977), pp. 161-194.
10. C.W. Lee, The associahedron and triangulations of the n-gon. European J. Combin. 10 (1989), 551-560.
11. C.W. Lee, Regular triangulations of convex polytopes, in Applied Geometry and Discrete Mathematics, P. Gritzmann and B. Sturmfels, eds., DIMACS Series 4 (1991), pp. 443-456.
12. J. Lucas, The rotation graph of binary trees is Hamiltonian, J. Algorithms 9 (1988), 503-535.
13. M. Pocchiola and G. Vegter, Topologically sweeping visibility complexes via pseudotriangulations, Discrete Comput. Geom. 16(4) (1996), 419-453.
14. R.O. Rogers, Finding paths in the rotation graph of binary trees, Ph.D. Dissertation, Department of Computer Science, University of Central Florida (1996).
15. D.D. Sleator, R.E. Tarjan, and W.P. Thurston, Rotations distance, triangulations and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988), 647-682.