C. Y. Liu
Papers
2
Total Citations
14
H-Index
2
About
C. Y. Liu is a pioneering researcher in computational geometry and motion planning, whose work has fundamentally shaped how machines navigate obstacle-filled environments. His primary research focuses on distance calculation algorithms for three-dimensional polyhedra, particularly in the context of interference detection and obstacle avoidance. Liu’s major contribution lies in developing rigorous mathematical frameworks that treat convex polyhedra as intersections of half-spaces, enabling efficient distance computations through linear inequality equations. This approach, detailed in his seminal 1990 paper “Distance Calculations in Motion Planning Problems With Interference Situations” (12 citations), provided a foundational method for determining the minimum separation between moving objects. He further advanced the field with his 1991 work “An Approach to Dynamic Distance Calculations for Obstacle Avoidance Problems” (2 citations), which innovatively combined quadratic programming with swept volume approximations to handle real-time motion planning scenarios. While his citation counts are modest, Liu’s contributions are notable for their technical rigor and practical applicability in robotics and automation. His work remains a valuable reference for researchers developing collision-avoidance systems and path-planning algorithms, demonstrating how elegant geometric solutions can solve complex real-world engineering challenges.
Research Focus
Key Achievements
Top Papers
- 1
- 2