John Hershberger

Papers

Total Citations

184

H-Index

About

John Hershberger is a leading figure in computational geometry and robotic motion planning, best known for his foundational work on compliant motion and geometric intersection problems. His research addresses the fundamental challenge of enabling robots to navigate uncertain environments by sliding along obstacles—a model that mirrors real-world physical interactions. His most influential paper, "Computing the intersection-depth of polyhedra" (1993), has garnered 147 citations and provides critical algorithms for determining how deeply one polyhedron penetrates another, a key problem in collision detection and simulation. Hershberger’s early work, such as "Compliant motion in a simple polygon" (1989) and "Efficiently Planning Compliant Motion in the Plane" (1996), systematically explores motion planning for point robots within polygonal environments, accounting for the uncertainty and imprecision inherent in real robotic systems. These contributions have shaped how researchers approach path planning under physical constraints, blending rigorous geometric analysis with practical robotics. With a career spanning over three decades, Hershberger’s insights continue to influence both theoretical computer science and applied robotics, making him a pivotal figure for students and researchers interested in the intersection of geometry, algorithms, and autonomous systems.