Papers
7
Total Citations
4,562
H-Index
5
About
Otfried Cheong is a leading figure in computational geometry, best known as a co-author of the seminal textbook *Computational Geometry: Algorithms and Applications* (1997), which has amassed over 4,500 citations and remains a definitive resource in the field. His research centers on algorithmic motion planning, geometric optimization, and the complexities of robot navigation under real-world constraints. Cheong has made foundational contributions to understanding path planning for non-holonomic robots, particularly the Dubins car model, where he analyzed the cost and reachability of bounded-curvature paths within convex polygons. His work on directional uncertainty—studying how a robot can reliably reach a goal despite imprecise movement—has advanced the theory of safe navigation amidst obstacles. Notable achievements include characterizing reachable regions for curvature-constrained robots and developing algorithms for casting polyhedra under uncertainty. With a career spanning decades, Cheong’s research bridges theoretical elegance and practical robotics, influencing both geometric algorithms and autonomous systems. His textbook alone has shaped generations of computer scientists, while his specialized papers continue to inform motion-planning in constrained environments.
Research Focus
Key Achievements
Top Papers
- 1Computational Geometry: Algorithms and Applications4,506 citations · 1997
- 2Reachability by paths of bounded curvature in a convex polygon15 citations · 2011
- 3Casting a polyhedron with directional uncertainty14 citations · 2003
- 4Reachability by paths of bounded curvature in convex polygons11 citations · 2000
- 5The cost of bounded curvature9 citations · 2012
- 6REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY5 citations · 2001
- 7The Cost of Bounded Curvature2 citations · 2011