Optimal algorithms for two-guard walkability of simple polygons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 438-449

  Bhattacharya, Binay ^a   Mukhopadhyay, Asish ^b   Narasimhan, Giri ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF WINDSOR   (Canada)

^c UNIVERSITY OF MEMPHIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; SURVEYING; TRIANGULATION;

BOUNDARY POINTS; OPTIMAL ALGORITHM; SIMPLE POLYGON; TIME ALGORITHMS;

ALGORITHMS;

EID: 84958051874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_40     Document Type: Conference Paper

References (11)

1. E. M. Arkin, M. Held, J. S. B. Mitchell, S. S. Skiena. Hamiltonian Triangulations for Fast Rendering. Visual Computer, 12:429-444, 1996.
2. B. K. Bhattacharya and S. K. Ghosh. Characterizing LR-visible polygons and related problems. Proc. of CCCG 1998; (accepted to CGTA, 2000).
3. B. Chazelle. Triangulating a simple polygon in linear time. Proc. of the 31-st Annual IEEE FOCS 220-229, 1990.
4. G. Das, P. J. Heffernan and G. Narasimhan. Finding all weakly-visible chords of a polygon in linear time. Nordic J. of Comput. 1:433-457, 1994.
5. G. Das, P. J. Heffernan and G. Narasimhan. LR-visibility in polygons. Computational Geometry: Theory and Applications 7:37-57, 1997.
6. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear time algorithms for visibility and shortest path problems inside a triangulated simple polygon. Algorithmica, 2:209–233, 1987.
7. P. Heffernan. An optimal algorithm for the two-guard problem. Intl. Journal on Comp. Geometry and Applications 6:15-44, 1996.
8. C. Icking and R. Klein. The two guards problem. Intl. Journal on Comp. Geometry and Applications 2:257-285, 1992.
9. G. Narasimhan. On Hamiltonian Triangulations of Simple Polygons. Intl. Journal on Comp. Geometry and Applications 9(3):261-275, 1999.
10. J. O’Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987.
11. L.H. Tseng, P. Heffernan and D.T. Lee. Two-guard walkability of simple polygons. Intl. Journal on Comp. Geometry and Applications 8(1):85-116, 1998.