On flips in polyhedral surfaces

International Journal of Foundations of Computer Science

Volumn 13, Issue 2, 2002, Pages 303-311

  Aichholzer, Oswin ^a   Alboul, Lyuba S ^b   Hurtado, Ferran ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

flip; Sch nhardt's polyhedron; Triangulated polyhedral surface; triangulation

Indexed keywords

EID: 31344463158     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102001102     Document Type: Article

References (10)

1. L. Alboul, G. Kloosterman, C. Traas and R. van Damme, "Best data-dependent triangulations", J. of Computational and Applied Mathematics 119 (2000) 1-12.
2. L. Alboul and R. van Damme, "Triangulations of discrete data sets. Tight triangulations", in The Mathematics of Surfaces VII, ed. G. Mullineux (Clarendon Press, 1997) 309-336.
3. L. Alboul and R. van Damme, "Revised Lawson's procedure for triangulated closed surfaces", Abstracts from the Japan Conference on Discrete and Computational Geometry (2000) 21-22.
4. D. Avis and K. Fukuda, "Reverse search for enumeration", Discrete Applied Mathematics 65 (1996) 21-46.
5. B. K. Choi, H. Y. Shin, Y. I. Yoon and J. W. Lee, "Triangulation of scattered data in 3D space", Comput. Aided Design 20 (1988) 239-248.
6. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science 10, (Springer 1987).
7. S. Fortune, "Voronoi diagrams and Delaunay triangulations", in Computing in Euclidean Geometry, eds. D. Z. Du and F. K. Hwang (World Scientific, 1992) 193-234.
8. C. L. Lawson, "Transforming triangulations", Discrete mathematics 3 (1972) 365-372.
9. O'Rourke, "Polyhedra of minimal area as 3-D object models", Proc. 1th Internat. Joint Conf. Artif, IntelL, Vancouver, BC, (1981) 664-666.
10. Interactive animation and additional information, h t t p : //www. i g i .TUGraz. a t / o a i c h / t r i a n g u l a t ions/polyhedra. html