An overview of triangulation algorithms for simple polygons

Proceedings of the International Conference on Information Visualisation

Volumn 1999-January, Issue , 1999, Pages 153-158

  Lamot, Marko ^a   Zalik, Borut ^b  

^a Hermes Softlab   (Slovenia)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOMETRY; INFORMATION ANALYSIS; INFORMATION SCIENCE; INFORMATION SYSTEMS; SURVEYING; TRIANGULATION; VISUALIZATION;

COMPUTATIONAL GEOMETRY AND ITS APPLICATIONS; DELAU-NAY TRIANGULATIONS; ITS EFFICIENCIES; SIMPLE POLYGON; TRIANGULATION ALGORITHMS;

ALGORITHMS;

EID: 84888559541     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.1999.781552     Document Type: Conference Paper

References (20)

1. Baker, B., Grosse, E., and Rafferty C. S., Nonobtuse triangulation of polygons. Disc. and Comp. Geom., Vol. 3, 1988, pp. 147-168.
2. Bern, M., Eppstein, D., and Gilbert, J. R., Provably good mesh generation. In Proceedings of the 31st Annual Symposium on Foundation of Computer Science, 1990, pp. 231-241 IEEE. To apear in J. Comp. System Science.
3. Boissonnat, J.D., Shape reconstruction from planar cross sections, Comp. Vision Graphics Image Process., Vol. 44, 1988, pp. 1-29.
4. Chazelle, B., Incerpi, J., Triangulation and shape complexity, ACM Transactions on Graphics, Vol. 3, 1984, pp. 135-152.
5. Chazelle, B., Triangulating a simple polygon in linear time, Disc. Comp. Geom. 6, 1991, pp. 485-524.
6. Chew, L. P., Constrained Delaunay triangulation, in Proceedings, Third ACM Symposium on Computational Geometry, Waterloo, June, 1987, pp. 216-222.
7. Chew, L. P., Guaranteed-quality triangular meshes, Technical report, Cornell University, No. TR-89-983, 1989.
8. De Floriani, L., Falcidieno, B. and Pienovi, C., A Delaunay-based representation of surfaces defined over arbitrarily-shaped domains, Comput. Vision Graphics Image Process. 32, 1985, pp. 127-140.
9. De Floriani, L. and Puppo, E., An On-Line Algorithm for Constrained Delaunay Triangulation, Graphical Models and Image Processing, Vol. 54, No. 3, 1992, pp. 290-300.
10. Garey, M.R., Johnson, D.S., Preparata, F.P. and Tarjan, R.E., Triangulating a simple polygon, Inform. Process., Lett. 7, 1978, pp. 175-180.
11. ElGindy, H., Everett, H. and Toussaint, G. T., Slicing an ear in linear time, Pattern Recognition Letters, Vol. 14, 1993, pp. 719-722.
12. Hertel, S., Mehlhorn, K., Fast triangulation of simple polygons, Proc. FCT, LNCS 158, 1983, pp. 207-215.
13. Kong, X., Everett, H., Toussaint, G. T., The Graham scan triangulates simple polygons, Pattern Recognition Letters, Vol. 11, 1990, pp. 713-716, http: //cgm.cs.mcgill.ca/-godfried/research/triangulations.html.
14. Lennes, N. J., Theorems on the simple finite polygon and polyhedron, American Journal of Mathematics, Vol. 33, 1911, pp. 37-62.
15. Lewis, B.A., Robinson J. S., Triangulating of planar regions with applications, Comput. J., Vol. 4, No. 21, 1979, pp. 324-332.
16. Meisters, G. H., Polygons have ears, American Mathematical Monthly, Vol. 82, June/July, 1975, pp. 648-651.
17. O'Rourke, J., Computational Geometry in C, Cambridge University, Press, 1994, pp. 1-65.
18. Ruppert, J., A Delaunay Refinemt Algorithm for Quality 2-Dimensional Mesh Generation, NASA Arnes Research Center, Submission to Journal of Algorithms, 1994, http://jit.arc.nasa.gov/nas/abs.html.
19. Seidel, R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, Vol. 1, No. 1, 1991, pp. 51-64.
20. Toussaint, G. T., Efficient triangulation of simple polygons, The Visual Computer, Vol. 7, No. 3, 1991, pp. 280-295.