FIST: Fast Industrial-Strength Triangulation of polygons

Algorithmica (New York)

Volumn 30, Issue 4, 2001, Pages 563-596

  Held, M ^a  

^a UNIVERSITY OF SALZBURG   (Austria)

Author keywords

Ear clipping; Experimental analysis; Geometric hashing; Polygon; Reliability; Robustness; Triangulation

Indexed keywords

ALGORITHMS; JAVA PROGRAMMING LANGUAGE; SILVER; STATISTICS; TRIANGULATION;

POLYGONS;

COMPUTER GRAPHICS;

EID: 0013460131     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0028-4     Document Type: Article

References (51)

1. T. Auer and M. Held. Heuristics for the Generation of Random Polygons. In Proc. 8th Canad. Conf. Comput. Geom., pages 38-44, Ottawa. Carleton University Press, Ottawa, 1996.
2. F. Avnaim, J.-D. Boissonnat, O. Devillers, F. Preparata, and M. Yvinec. Evaluating Signs of Determinants Using Single-Precision Arithmetic. Algorithmica, 17:111-132, 1997.
3. R. Balbes and J. Siegel. A Robust Method for Calculating the Simplicity and Orientation of Planar Polygons. Comput. Aided Geom. Design, 8(4):327-335, Oct. 1991.
4. R. Bar-Yehuda and B. Chazelle. Triangulating Disjoint Jordan Chains. Internat. J. Comput. Geom. Appl., 4(4):1475-481, 1994.
5. G. Barequet, M. Dickerson, and D. Eppstein. On Triangulating Three-Dimensional Polygons. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 38-47, Philadelphia, PA, June 1996.
6. G. Barequet and Y. Kaplan. A Data Front-End for Layered Manufacturing. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 231-239, Nice, June 1997.
7. G. Barequet and M. Sharir. Piecewise-Linear Interpolation between Polygonal Slices. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 93-102, Stony Brook, NY, 1994.
8. G. Barequet and M. Sharir. Filling Gaps in the Boundary of a Polyhedron. Comput. Aided Geom. Design, 12(1):207-229, 1995.
9. G. Barquet and B. Wolfers. Optimizing a Corridor between Two Polygons with an Application to Polyhedral Interpolation. In Proc. 8th Canad. Conf. Comput. Geom., pages 32-37, Ottawa. Carleton University Press, Ottawa, 1996.
10. 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, Singapore, 1992. ISBN 981-02-0966-5.
11. H. Brönnimann, I. Emiris, V. Pan, and S. Pion. Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 174-182, Nice, June 1997.
12. H. Brönnimann and M. Yvinec. Efficient Exact Evaluation of Signs of Determinants. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 166-173, Nice, June 1997.
13. C. Burnikel, J. Könnemann, K. Mehlhorn, S. Näher, S. Schirra, and C. Uhrig. Exact Geometric Computation in LEDA. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C18-C19, Vancouver, 1995.
14. B. Chazelle. A Theorem on Polygon Cutting with Applications. In Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci, pages 339-349, 1982.
15. B. Chazelle. Triangulating a Simple Polygon in Linear Time. Discrete Comput. Geom., 6:485-524, 1991.
16. B. Chazelle and J. Incerpi. Triangulation and Shape-Complexity. ACM Trans. Graph., 3(2):135-152, Apr. 1984.
17. Y.-K. Choi and K. H. Park. A Heuristic Triangulation Algorithm for Multiple Planar Contours Using an Extended Double Branching Procedure. Visual Comput., 10(7):372-387, 1994.
18. K. L. Clarkson, R. Cole, and R. E. Tarjan. Randomized Parallel Algorithms for Trapezoidal Diagrams. Internat. J. Comput. Geom. Appl, 2(2): 117-133, 1992.
19. K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk. A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Discrete Comput. Geom., 4:423-423, 1989.
20. O. Devillers. Randomization Yields Simple O(n log* n) Algorithms for Difficult Ω(n) Problems. Internat. J. Comput. Geom. Appl., 2(1):97-111, Mar. 1992.
21. H. Edelsbrunner and E. P. Mücke. Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. ACM Trans. Graph., 9(1):66-104, Jan. 1990.
22. H. ElGindy, H. Everett, and G. Toussaint. Slicing an Ear Using Prune-and-Search. Pattern Recognition Lett., 14:719-722, 1993.
23. A. Fabri et al. The CGAL Kernel: A Basis for Geometric Computation. In Proc. 1st ACM Workshop Appl. Comput. Geom., pages 97-103, Philadelphia, PA, May 1996.
24. A. Fournier and D. Y. Montuno. Triangulating Simple Polygons and Equivalent Problems. ACM Trans. Graph., 3(2): 153-174, 1984.
25. M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a Simple Polygon. Inform. Process. Lett., 7:175-179, 1978.
26. M. Held. Efficient and Reliable Triangulation of Polygons. In Proc. Comput. Graphics Internat. '98, pages 633-643, Hannover, June 1998.
27. M. Held, J. T. Klosowski, and J. S. B. Mitchell. QuickCD; An Efficient Collision Detection System Using BV-Trees. Manuscript, Dept. of Appl. Math. Stat., SUNY at Stony Brook, NY, Mar. 1998.
28. http://www.cosy.sbg.ac.at/∼held/projects/triang/triang.html.
29. S. Hertel and K. Mehlhorn. Fast Triangulation of Simple Polygons. In Proc. 4th Internal. Conf. Found. Comput. Theory, volume 158 of Lecture Notes in Computer Science, pages 207-218. Springer-Verlag, Berlin, 1983.
30. D. G. Kirkpatrick, M. M. Klawe, and R. E. Tarjan. Polygon Triangulation in O(n log log n) Time with Simple Data Structures. In Proc. 6th Annu. ACM Sympos. Comput. Geom., pages 34-43, Berkeley, CA, 1990.
31. J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs. IEEE Trans. Visual. Comput. Graph., 4(1):21-36, Jan. 1998.
32. X. Kong, H. Everett, and G. Toussaint. The Graham Scan Triangulates Simple Polygons. Pattern Recognition Lett., 11:713-716, Nov. 1991.
33. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Comm. ACM, 38(1):96-102, Jan. 1995.
34. G. H. Meisters. Polygons Have Ears. Amer. Math. Monthly, 82:648-651, 1975.
35. A. Narkhede and D. Manocha. Fast Polygon Triangulation Based on Seidel's Algorithm. In A.W. Paeth, editor, Graphics Gems V, pages 394-397. Academic Press, New York, 1995. ISBN 0-12-543455-3.
36. http://www.cs.unc.edu/∼dm/CODE/GEM/chapter.html.
37. J. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1994. ISBN 0-521-44592-2.
38. M. H. Overmars. Designing the Computational Geometry Algorithms Library CGAL. In Proc. 1st ACM Workshop Appl. Comput. Geom., pages 113-119, Philadelphia, PA, May 1996.
39. R. P. Ronfard and J. R. Rossignac. Triangulating Multiply-Connected Polygons: A Simple, yet Efficient Algorithm. Comput. Graph. Forum, 13(3):281-292, 1994. (Proc. Eurographics '94.)
40. R. P. Ronfard and J. R. Rossignac. Triangulating Multiply-Connected Polygons: A Simple, yet Efficient Algorithm. Comput. Graph. Forum, 13(3):281-292, 1994. (Proc. Eurographics '94.)
41. E. Saade. Personal communication, 1997.
42. R. Seidel. A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Comput. Geom. Theory Appl., 1(1):51-64, July 1991.
43. http://www.cs.cmu.edu/∼quake/triangle.html.
44. J. R. Shewchuk. Robust Adaptive Floating-Point Geometric Predicates. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 141-150, Philadelphia, PA, June 1996.
45. J. R. Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Proc. 1st ACM Workshop Appl. Comput. Geom., pages 124-133, Philadelphia, PA, May 1996.
46. C. Silva, J. S. B. Mitchell, and A. E. Kaufman. Automatic Generation of Triangular Irregular Networks Using Greedy Cuts. In Visualization '95, pages 201-208, San Jose, CA. IEEE Computer Society Press, Los Alamitos, CA, 1995.
47. ftp://ftp.cis.uab.edu/pub/sloan/Software/triangulation/src/.
48. R. E. Tarjan and C. J. Van Wyk. An O (n log log n)-Time Algorithm for Triangulating a Simple Polygon. SIAM J. Comput., 17:143-178, 1988.
49. G. T. Toussaint. Efficient Triangulation of Simple Polygons. Visual Comput., 7(5-6):280-295, Sept. 1991.
50. C. K. Yap. Robust Geometric Computation. In J. E. Goodman and J. O'Rourke, editors, CRC Handbook of Discrete and Computational Geometry; pages 653-668. CRC Press, Boca Raton, FL, 1997. ISBN 0-8493-8524-5.
51. C. K. Yap and T. Dubé. The Exact Computation Paradigm. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, pages 452-492. World Scientific, Singapore, 1995. ISBN 981-02-1876-1.