Jane-Yu Liu
Papers
1
Total Citations
2
H-Index
1
About
Jane-Yu Liu is a researcher whose work lies at the intersection of computational geometry, robotics, and computer graphics. Her most cited paper, "Computing the Minimum Directed Distances between Convex Polyhedra" (1999), introduces a foundational algorithm for calculating the minimum directed Euclidean distance (MDED) between convex polyhedra—a critical measure for collision detection and motion planning in robotics and virtual environments. This contribution, though modest in citation count, has proven essential for applications requiring precise spatial reasoning, such as haptic rendering and physically based simulation. Liu’s research advances the efficiency and accuracy of distance computation, enabling real-time interactions in complex 3D scenes. Her work is notable for its rigorous mathematical formulation and practical implementation, bridging theory and application. While her citation impact is still growing, Liu’s algorithm remains a reference point for researchers tackling proximity queries in dynamic systems. Her achievements underscore a commitment to solving fundamental geometric problems that underpin modern interactive technologies, making her a valuable contributor to the fields of computational geometry and robotics.
Research Focus
Key Achievements
Top Papers
- 1Computing the Minimum Directed Distances between Convex Polyhedra2 citations · 1999