5 citations · 18 across the 13 of their papers we have counts for
19 papers
Unit-Disk Range Searching and Applications
Haitao Wang
Given a set of points in the plane, we consider the problem of computing the number of points of in a query unit disk (i.e., all query disks have the same radius). We s…
Constructing Many Faces in Arrangements of Lines and Segments
Haitao Wang
We present new algorithms for computing many faces in arrangements of lines and segments. Given a set of lines (resp., segments) and a set of points in the plane, t…
Algorithms for the Line-Constrained Disk Coverage and Related Problems
Logan Pedersen, Haitao Wang
Given a set of points and a set of weighted disks in the plane, the disk coverage problem asks for a subset of disks of minimum total weight that cover all points o…
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
Haitao Wang
Given a set of point sites in a simple polygon of vertices, we consider the problem of computing the geodesic farthest-point Voronoi diagram for in . It is k…
A New Algorithm for Euclidean Shortest Paths in the Plane
Haitao Wang
Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational g…
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees
Haitao Wang, Yiming Zhao
We consider the problem of computing the diameter of a unicycle graph (i.e., a graph with a unique cycle). We present an O(n) time algorithm for the problem, where n is the number…