Papers
7
Total Citations
304
H-Index
6
About
Jack Snoeyink is a leading figure in computational geometry and robotics, whose work has fundamentally advanced the theory and practice of motion planning. His research spans multi-robot coordination, geometric data structures, and compliant motion under uncertainty. Snoeyink’s most influential contribution is his work on centralized path planning for multiple robots, where he developed an optimal algorithm to decouple complex multi-robot problems into sequential subproblems. This 2009 paper, with 180 citations, provides a rigorous framework for minimizing the dimensionality of the search space, enabling efficient coordination without sacrificing completeness. In geometric computing, he is known for a compact piecewise-linear Voronoi diagram for convex sites (66 citations), a data structure that elegantly solves both nearest-neighbor queries and retraction motion planning. His earlier work on the complexity of a single face of a Minkowski sum (1995) provided key insights into configuration space obstacles, while his investigations into compliant motion—where robots slide along obstacles—established foundational results for planning under imprecision. Snoeyink’s contributions remain essential reading for researchers in algorithmic robotics and computational geometry, blending theoretical depth with practical impact.
Research Focus
Key Achievements
Top Papers
- 1
- 2A compact piecewise-linear voronoi diagram for convex sites in the plane66 citations · 1996
- 3The complexity of a single face of a minkowski sum.18 citations · 1995
- 4
- 5Compliant motion in a simple polygon12 citations · 1989
- 6Efficiently Planning Compliant Motion in the Plane11 citations · 1996
- 7A compact piecewise-linear Voronoi diagram for convex sites in the plane4 citations · 2002