21 citations · 21 across the 3 of their papers we have counts for
3 papers
cs.RO2016★ 21 cited
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
Michal Kleinbort, Oren Salzman, Dan Halperin
The complexity of nearest-neighbor search dominates the asymptotic running time of many sampling-based motion-planning algorithms. However, collision detection is often considered…
cs.CG2014
Optimal randomized incremental construction for guaranteed logarithmic planar point location
Michael Hemmer, Michal Kleinbort, Dan Halperin
Given a planar map of segments in which we wish to efficiently locate points, we present the first randomized incremental construction of the well-known trapezoidal-map search-…
cs.RO2014
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors
Michal Kleinbort, Oren Salzman, Dan Halperin
Sampling-based motion-planning algorithms typically rely on nearest-neighbor (NN) queries when constructing a roadmap. Recent results suggest that in various settings NN queries ma…