Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 30 (3) , 847-871
- https://doi.org/10.1137/s0097539795253591
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the PlaneDiscrete & Computational Geometry, 1997
- TRIANGULATING DISJOINT JORDAN CHAINSInternational Journal of Computational Geometry & Applications, 1994
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- An optimal visibility graph algorithm for triangulated simple polygonsAlgorithmica, 1989
- Visibility of disjoint polygonsAlgorithmica, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985