5 citations · 12 across the 6 of their papers we have counts for
6 papers
Searching for the closest-pair in a query translate
Jie Xue, Yuan Li, Saladi Rahul +1
We consider a range-search variant of the closest-pair problem. Let be a fixed shape in the plane. We are interested in storing a given set of points in the plane i…
New bounds for range closest-pair problems
Jie Xue, Yuan Li, Saladi Rahul +1
Given a dataset of points in , the range closest-pair (RCP) problem aims to preprocess into a data structure such that when a query range is specified, th…
On the expected diameter, width, and complexity of a stochastic convex-hull
Jie Xue, Yuan Li, Ravi Janardan
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of points in each of which has a…
Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces
Jie Xue, Yuan Li
Let be a tree space (or tree network) represented by a weighted tree with vertices, and be a set of stochastic points in , each of which has a fixed location wit…
On Dominance-Free Samples of a (Colored) Stochastic Dataset
Jie Xue, Yuan Li
A point is said to dominate another point if the coordinate of is greater than or equal to the coordinate of in every dimension. A…
On the Separability of Stochastic Geometric Objects, with Applications
Jie Xue, Yuan Li, Ravi Janardan
In this paper, we study the linear separability problem for stochastic geometric objects under the well-known unipoint/multipoint uncertainty models. Let be a give…