David Kirkpatrick
Papers
1
Total Citations
14
H-Index
1
About
David Kirkpatrick is a distinguished computer scientist whose research has centered on computational geometry, algorithms, and data structures, with a particular focus on geometric optimization and collision detection. His most-cited work, "Implicitly searching convolutions and computing depth of collision" (1990), introduced innovative techniques for efficiently computing the depth of intersection between convex objects—a fundamental problem in robotics, computer graphics, and physical simulation. With 14 citations, this paper laid early groundwork for implicit geometric search methods that avoid explicit construction of complex configurations, enabling faster and more memory-efficient algorithms. Kirkpatrick’s broader contributions include pioneering work on hierarchical representations for geometric data, such as the "Kirkpatrick hierarchy" for planar point location, which remains a cornerstone of computational geometry. His research has profoundly influenced the design of algorithms for collision detection, motion planning, and geometric optimization, earning him recognition as a leading figure in the field. For students and researchers, Kirkpatrick’s work exemplifies how elegant theoretical insights can drive practical advances in computing.
Research Focus
Key Achievements
Top Papers
- 1Implicitly searching convolutions and computing depth of collision14 citations · 1990