Max Robotics — Global Service Robot Directory + US Certification

About

David Dobkin is a pioneering figure in computational geometry and graph visualization, whose work has fundamentally shaped how algorithms handle spatial data. His most celebrated contribution is the development of a linear-time algorithm for determining the separation of convex polyhedra (1985, 219 citations), a foundational result that enables efficient collision detection in robotics and computer graphics. Building on this, Dobkin advanced the field with methods for computing the intersection-depth of polyhedra (1993, 147 citations), providing critical tools for understanding object penetration in virtual environments. He also made significant strides in graph drawing with his work on implementing a general-purpose edge router (1997, 39 citations), addressing the aesthetic challenges of routing edges in complex network layouts—a problem distinct from physical constraints in VLSI and robotics. Additionally, his research on maintaining geometric extrema (1991, 34 citations) and implicitly searching convolutions for depth-of-collision computation (1990, 14 citations) further demonstrates his ability to solve core geometric problems with elegant algorithmic solutions. With over 450 total citations across his most cited works, Dobkin’s legacy lies in bridging theoretical rigor and practical application, making him an influential figure for students and researchers in computational geometry and information visualization.