Emergent Mind
Weak Visibility Queries of Line Segments in Simple Polygons
(1212.6039)
Published Dec 25, 2012
in
cs.CG
and
cs.DS
Abstract
Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P. Alternatively, we build a data structure in O(n3) time and O(n3) space that can compute the visibility polygon for any query line segment in O(k + log n) time.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.