15 citations · 74 across the 39 of their papers we have counts for
6 papers · 1 filter
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines
Haitao Wang
Let be a set of lines in the plane. The zone of a line in the arrangement of is the set of faces of whose closure int…
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…
Reverse Shortest Path Problem for Unit-Disk Graphs
Haitao Wang, Yiming Zhao
Given a set P of n points in the plane, the unit-disk graph G_{r}(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two point…
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…