Wei Chun Tsai
Papers
1
Total Citations
49
H-Index
1
About
Wei Chun Tsai is a leading researcher in computational geometry and path planning, best known for developing an O(n log n) shortest path algorithm based on Delaunay triangulation. His seminal 2013 work, which has garnered 49 citations, addresses the classic Euclidean shortest path problem in environments with obstacles—a challenge with applications in robotics, geographic information systems, and autonomous navigation. Tsai’s algorithm improves upon earlier roadmap, cell decomposition, and potential field approaches by leveraging Delaunay triangulation to achieve near-optimal computational efficiency while maintaining accuracy in both Euclidean and λ-geometry planes. This contribution has been influential in advancing real-time path planning for complex, obstacle-laden environments. Beyond this flagship work, Tsai’s research continues to explore algorithmic innovations in geometric data structures and motion planning, with his methods being adopted in both theoretical computer science and practical engineering systems. His work stands as a key reference for students and researchers seeking efficient solutions to spatial optimization problems.
Research Focus
Key Achievements
Top Papers
- 1An $\bm{O(n\log n)}$ Shortest Path Algorithm Based on Delaunay Triangulation49 citations · 2013