Isomorphic triangulations with small number of Steiner points

International Journal of Computational Geometry and Applications

Volumn 9, Issue 2, 1999, Pages 171-180

  Kranakis, Evangelos ^a   Urrutia, Jorge ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Isomorphic triangulations; Simple polygons; Steiner points

Indexed keywords

EID: 0033469968     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000121     Document Type: Article

References (7)

1. B. Aronov, R. Seidel and D. Souvaine, "On Compatible Triangulations of Simple Polygons," Computational Geometry: Theory and Applications, 3(1993), 27-35.
2. M. Babikov, D. Souvaine and R. Wenger, "Constructing Piecewise Linear Homeomorphisms of Polygons with Holes," Proceedings of 9th Canadian Conference on Computational Geometry, (CCCG97), 6-10.
3. B. Chazelle, "Triangulating a Simple Polygon in Linear Time," Discrete and Computational Geometry, 6(1991), 485-524.
4. L. Guibas, J. Hershberger, D. Levem, M. Sharir and R. Tarjan, "Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons," Algorithmica, 2 (1987), 200-237.
5. L. Guibas and R. Seidel, "Computing Convolutions by Reciprocal Search," Proceedings of 2nd ACM Conference in Computational Geometry, (1986), 90-99.
6. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.
7. M. Shapira and A. Rappoport, "Shape Blending using the Star-Skeleton Representation," IEEE Computer Graphics and Applications, to appear.