Finding a shortest diagonal of a simple polygon in linear time

Computational Geometry: Theory and Applications

Volumn 7, Issue 3, 1997, Pages 149-160

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

Closest pair; Matrix searching; Shortest diagonal; Simple polygon; Visibility; Window partition

Indexed keywords

EID: 0039496424     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00032-1     Document Type: Article

References (10)

1. A. Aggarwal, H. Edelsbrunner, P. Raghavan and P. Tiwari, Optimal time bounds for some proximity problems in the plane, Information Processing Letters 42 (1992) 55-60.
2. B. Chazelle, Triangulating a simple polygon in linear time, Discrete and Computational Geometry 6 (1991) 485-524.
3. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
4. J. Hershberger and S. Suri, Matrix searching with the shortest path metric, in: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (1993) 485-494.
5. A. Lingas, Voronoi diagrams with barriers and the shortest diagonal problem, Information Processing Letters 32 (1989) 191-198.
6. J. O'Rourke, Computational geometry column 8, SIGACT News 20 (1989) 30.
7. F.P. Preparata and M.I. Shamos, Computational Geometry (Springer, New York, 1985).
8. S. Suri, Minimum link paths in polygons and related problems, PhD Thesis, The Johns Hopkins University (1987).
9. S. Suri, On some link distance problems in a simple polygon, IEEE Transactions on Robotics and Automation 6 (1990) 108-113.
10. B. Zhu, Computing the shortest diagonal of a monotone polygon in linear time, Information Processing Letters 42 (1992) 303-307.