11 citations · 49 across the 23 of their papers we have counts for
5 papers · 1 filter
Space Exploration via Proximity Search
Sariel Har-Peled, Nirman Kumar, David M. Mount +1
We investigate what computational tasks can be performed on a point set in , if we are only given black-box access to it via nearest-neighbor search. This is a reasonable as…
Avoiding the Global Sort: A Faster Contour Tree Algorithm
Benjamin Raichel, C. Seshadhri
We revisit the classical problem of computing the \emph{contour tree} of a scalar field , where is a triangulated simplicial mesh in $\mat…
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
Sariel Har-Peled, Banjamin Raichel
We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTASs) to several well-known problems in Computational Geometry,…
From Proximity to Utility: A Voronoi Partition of Pareto Optima
Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered…
On the Complexity of Randomly Weighted Voronoi Diagrams
Sariel Har-Peled, Benjamin Raichel
In this paper, we provide an bound on the expected complexity of the randomly weighted Voronoi diagram of a set of sites in the plane, where the sites…