1 citations · 1 across the 3 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
Dynamic Convex Hulls for Simple Paths
Bruce Brewer, Gerth Stølting Brodal, Haitao Wang
We consider the planar dynamic convex hull problem. In the literature, solutions exist supporting the insertion and deletion of points in poly-logarithmic time and various queries…
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…
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…