3 papers
cs.CG2026
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
cs.CG2026
Counting Unit Circular Arc Intersections
Haitao Wang
Given a set of circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before an…
cs.CG2025
A Deterministic Partition Tree and Applications
Haitao Wang
In this paper, we present a deterministic variant of Chan's randomized partition tree [Discret. Comput. Geom., 2012]. This result leads to numerous applications. In particular, for…