93 citations · 190 across the 37 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2016★ 1 cited
Sampling-based bottleneck pathfinding with applications to Frechet matching
Kiril Solovey, Dan Halperin
We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in…
cs.CG2015★ 23 cited
Motion Planning for Unlabeled Discs with Optimality Guarantees
Kiril Solovey, Jingjin Yu, Or Zamir +1
We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which…
cs.CG2013
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
Aviv Adler, Mark de Berg, Dan Halperin +1
We consider the following motion-planning problem: we are given unit discs in a simple polygon with vertices, each at their own start position, and we want to move the disc…