Siu-Wing Cheng

Hong Kong University of Science and Technology

Papers

Total Citations

H-Index

About

Siu-Wing Cheng is a leading figure in computational geometry, best known for his pioneering work on algorithms for mesh generation, Delaunay triangulations, and approximate shortest paths. His research addresses fundamental challenges in geometric computing, with applications ranging from computer graphics to scientific simulation. Among his most influential contributions is the development of efficient methods for computing approximate shortest paths in anisotropic regions—a problem of critical importance in robotics and path planning. In his 2008 paper on this topic, which has garnered 31 citations, Cheng introduced novel techniques for navigating planar subdivisions where distances vary by region, using convex distance functions to achieve provably good approximations. This work exemplifies his broader impact: over his career, Cheng’s papers have accumulated thousands of citations, reflecting his role in shaping modern computational geometry. He is particularly recognized for advancing the theory and practice of Delaunay mesh generation, producing robust algorithms that are widely used in engineering and scientific computing. A professor at the Hong Kong University of Science and Technology, Cheng continues to inspire students and researchers with his rigorous yet accessible approach to solving complex geometric problems.