1 citations · 1 across the 2 of their papers we have counts for
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.CG2024
Algorithms for Halfplane Coverage and Related Problems
Haitao Wang, Jie Xue
Given in the plane a set of points and a set of halfplanes, we consider the problem of computing a smallest subset of halfplanes whose union covers all points. In this paper, we pr…
cs.CG2020★ 1 cited
Optimal Algorithm for the Planar Two-Center Problem
Kyungjin Cho, Eunjin Oh, Haitao Wang +1
We study a fundamental problem in Computational Geometry, the planar two-center problem. In this problem, the input is a set of points in the plane and the goal is to find…