Segment Visibility Counting Queries in Polygons
Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten L\"offler,, Aleksandr Popov, Marcel Roeloffzen, Frank Staals

TL;DR
This paper introduces efficient data structures for counting objects visible within polygons, optimizing query times to polylogarithmic levels while minimizing space, applicable to points and segments inside polygons.
Contribution
It presents novel data structures for visibility counting queries in polygons, achieving fast query times with reduced space complexity for points and segments.
Findings
Achieves $O( ext{polylog } nm)$ query time for point visibility counting.
Develops a space-efficient data structure for segment queries involving points.
Handles segment objects with the same bounds efficiently.
Abstract
Let be a simple polygon with vertices, and let be a set of points or line segments inside . We develop data structures that can efficiently count the number of objects from that are visible to a query point or a query segment. Our main aim is to obtain fast, ), query times, while using as little space as possible. In case the query is a single point, a simple visibility-polygon-based solution achieves query time using space. In case also contains only points, we present a smaller, -space, data structure based on a hierarchical decomposition of the polygon. Building on these results, we tackle the case where the query is a line segment and contains only points. The main complication here is that the segment may intersect multiple regions of the polygon decomposition,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
