93 citations · 292 across the 46 of their papers we have counts for
Showing 2011 · cs.CGShow all
2 papers · 2 filters
cs.CG2011★ 1 cited
Deconstructing Approximate Offsets
Eric Berberich, Dan Halperin, Michael Kerber +1
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of…
cs.CG2011★ 10 cited
Motion Planning via Manifold Samples
Oren Salzman, Michael Hemmer, Barak Raveh +1
We present a general and modular algorithmic framework for path planning of robots. Our framework combines geometric methods for exact and complete analysis of low-dimensional conf…