30 citations · 82 across the 38 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
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
Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
Yakov Nekrich, Saladi Rahul
Shallow cuttings are a fundamental tool in computational geometry and spatial databases for solving offline and online range searching problems. For a set of points in 3-D,…