3 citations · 4 across the 2 of their papers we have counts for
6 papers
Dynamic Unit-Disk Range Reporting
Haitao Wang, Yiming Zhao
For a set of points in the plane and a value , the unit-disk range reporting problem is to construct a data structure so that given any query disk of radius , all…
Improved Algorithms for Distance Selection and Related Problems
Haitao Wang, Yiming Zhao
In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set of points in th…
Computing the Minimum Bottleneck Moving Spanning Tree
Haitao Wang, Yiming Zhao
Given a set of points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial stru…
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…
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…
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
Haitao Wang, Yiming Zhao
Let be a path graph of vertices embedded in a metric space. We consider the problem of adding a new edge to so that the radius of the resulting graph is minimized, wher…