Efficient and reliable triangulation of polygons

Proceedings - Computer Graphics International, CGI 1998

Volumn 1998-January, Issue , 1998, Pages 633-643

  Held, Martin ^a  

^a UNIVERSITY OF SALZBURG   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER GRAPHICS; GEOMETRY; TRIANGULATION;

BACK UP; CLIPPING PROCESS; GEOMETRIC HASHING; INDUSTRIAL GRAPHICS; INPUT DATAS; TRIANGULATION ALGORITHMS;

SURVEYING;

EID: 0346495599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGI.1998.694322     Document Type: Conference Paper

References (18)

1. T. Auer and M. Held. Heuristics for the Generation of Random Polygons. In Proc. 8th Canad. Conf. Comput. Geom., pages 38-44, Ottawa, Canada, Aug. 1996. Carleton University Press.
2. M. Bern and D. Eppstein. Mesh Generation and Optimal Triangulation. In D.-Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, pages 23-90. World Scientific, 1992. ISBN 981-02-0966-5.
3. B. Chazelle. Triangulating a Simple Polygon in Linear Time. Discrete Comput. Geom., 6:485-524, 1991.
4. H. Edelsbrunner and E. Mücke. Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. ACM Trans. Graph., 9(1): 66-104, Jan 1990.
5. M. Held, J. Klosowski, and J. Mitchell. QuickCD: An Efficient Collision Detection System Using BV-Trees. Manuscript, Dept. of Appl. Math. Stat., SUNY at Stony Brook, NY, USA, Mar. 1997.
6. http://www.cosy.sbg.ac.at/~held/projects/triang/triang.html.
7. J. Klosowski, M. Held, J. Mitchell, H. Sowizral, and K. Zikan. Efficient Collision Detection Using Bounding Volume Hierarchies of κ-DOPs. IEEE Trans. Visualizat. Comput. Graph., To appear 1998.
8. X. Kong, H. Everett, and G. Toussaint. The Graham Scan Triangulates Simple Polygons. Pattern Recogn. Lett, 11:713-716, Nov. 1991.
9. G. Meisters. Polygons have Ears. Amer Math. Monthly, 82:648-651, 1975.
10. A. Narkhede and D. Manocha. Fast Polygon Triangulation Based on Seidel's Algorithm. In A. Paeth, editor, Graphics Gems V, pages 394-397. Academic Press, 1995. ISBN 0-12-543455-3.
11. http://www.cs.unc.edu/~dm/CODE/GEM/chapter.html.
12. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1994. ISBN 0-521-44592-2.
13. E. Saade. Personal Communication, 1997.
14. R. Seidel. A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Comput. Geom. Theory and Appl, 1(1): 51-64, July 1991.
15. http://www.cs.cmu.edu/~quake/triangle.html.
16. J. Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In 1st ACM Workshop Appl. Comput. Geom., pages 124-133, Philadelphia, PA, USA, May 1996.
17. ftp://ftp. cis.uab.edu/pub/sloan/Software/triangulation/src/.
18. G. Toussaint. Efficient Triangulation of Simple Polygons. Visual Comput, 7(5-6):280-295, Sep. 1991.