Triangulating and guarding realistic polygons

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, CCCG 2008

Volumn , Issue , 2008, Pages 107-110

  Aloupis, G ^a,b   Bose, P ^a   Dujmovic, V ^c   Gray, C ^d   Langerman, S ^b   Speckmann, B ^d  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c MCGILL UNIVERSITY   (Canada)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TIME; SIMPLE ALGORITHM;

ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 84893382309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. B. Aronov, M. de Berg, and C. Gray. Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. In Proc. 22nd Symposium on Computational Geometry, pages 88-94, 2006.
2. B. Chazelle. Triangulating a simple polygon in linear time. Discrete and Computational Geometry, 6(5):485-524, 1991.
3. B. Chazelle and J. Incerpi. Triangulation and shape-complexity. ACM Transactions on Graphics, 3(2):135-152, 1984.
4. M. de Berg. Vertical ray shooting for fat objects. In Proc. 21st Symposium on Computational Geometry, pages 288-295, 2005.
5. M. de Berg, A. F. van der Stappen, J. Vleugels, and M. J. Katz. Realistic input models for geometric algorithms. Algorithmica, 34(1):81-97, 2002.
6. H. A. El Gindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. Journal of Algorithms, 2:186-197, 1981.
7. J. Erickson. Local polyhedra and geometric graphs. Computational Geometry: Theory and Applications, 31:101-125, 2005.
8. P. J. Heffernan and J. S. B. Mitchell. Structured visibility profiles with applications to problems in simple polygons. In Proc. 6th Symposium on Computational Geometry, pages 53-62, 1990.
9. S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proc. FCT-Conference on Fundamentals of Computation Theory, pages 207-218, LNCS 158, Springer Verlag, 1983.
10. M. J. Katz. 3-d vertical ray shooting and 2-d point enclosure, range searching, and arc shooting amidst convex fat objects. Computational Geometry: Theory and Applications, 8:299-316, 1997.
11. David G. Kirkpatrick, Maria M. Klawe, and Robert Endre Tarjan. Polygon triangulation in O(nloglogn) time with simple data structures. Discrete & Computational Geometry, 7:329-346, 1992.
12. A. A. Melkman. On-line construction of the convex hull of a simple polyline. Information Processing Letters, 25(1):11-12, Apr. 1987.
13. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987.
14. A. Schoone and J. van Leeuwen. Triangulating a star-shaped polygon. Technical Report RUU-CS-80-03, Institute of Information and Computing Sciences, Utrecht University, 1980.
15. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry: Theory and Applications, 1:51-64, 1991.
16. G. T. Toussaint and D. Avis. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition, 15(1):23-29, 1982.
17. G. T. Toussaint. A new linear algorithm for triangulating monotone polygons. Pattern Recognition Letters, 2:155-158, 1984.