5 citations · 17 across the 15 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CG2019
Range closest-pair search in higher dimensions
Timothy M. Chan, Saladi Rahul, Jie Xue
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set of points into some space-efficient data struct…
cs.CG2019★ 2 cited
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points
Haitao Wang, Jie Xue
We consider a bichromatic two-center problem for pairs of points. Given a set of pairs of points in the plane, for every pair, we want to assign a red color to one point an…
cs.CG2019★ 1 cited
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
Haitao Wang, Jie Xue
We revisit a classical graph-theoretic problem, the \textit{single-source shortest-path} (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic)…