Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient computation of query point visibility in polygons with holes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Query point visibility computation in polygons with holes
Computational Geometry: Theory and Applications
Visibility queries in a polygonal region
Computational Geometry: Theory and Applications
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Exact solutions and bounds for general art gallery problems
Journal of Experimental Algorithmics (JEA)
Computing the visibility polygon of an island in a polygonal domain
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
The authors give an algorithm to compute the visibility polygon from a point among a set of $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices. Our algorithm uses $O(n)$ space and runs in optimal time $\Theta(n+h\log h)$, improving the previous upper bound of $O(n\log n)$. A direct consequence of the algorithm is an $O(n+h\log h)$ time algorithm for computing the convex hull of $h$ disjoint simple polygons.