Daniel Leven
Papers
2
Total Citations
96
H-Index
2
About
Daniel Leven is a pioneering researcher in computational geometry and motion planning, best known for his foundational work on the "ladder" problem—a classic challenge in robotics and algorithmic geometry. His major contributions center on developing efficient, practical algorithms for moving a rigid, elongated object (a ladder) through two-dimensional environments cluttered with polygonal obstacles. Leven’s 1985 extended abstract and its 1987 full paper introduced a remarkably simple yet powerful algorithm that runs in O(n² log n) time, optimizing the configuration space decomposition technique originally proposed by Schwartz and Sharir. These works, garnering 50 and 46 citations respectively, have become essential references in motion planning literature, influencing subsequent research on non-holonomic and path-planning problems. Leven’s approach stands out for its clarity and efficiency, making complex geometric reasoning accessible for real-world applications like robot navigation and computer-aided design. His legacy lies in bridging theoretical geometry with practical algorithmic design, inspiring generations of researchers to tackle spatial reasoning challenges with elegance and rigor.
Research Focus
Key Achievements
Top Papers
- 1
- 2