Tzu-Hsiang Hung

Papers

Total Citations

H-Index

About

Tzu-Hsiang Hung is a researcher whose work centers on computational geometry and robotics, with a particular focus on optimizing path planning for autonomous systems. His most notable contribution is the development of a novel algorithm for solving painting problems on polygonal surfaces, published in 2017. By leveraging triangulation meshes and a spanning-tree-based approach, Hung proposed a method that computes a complete area coverage path with minimum length in O(n log n) time complexity, where n represents the number of triangles. This work, which has garnered 2 citations, addresses a fundamental challenge in mobile robotics—efficiently covering complex surfaces without redundancy. Hung’s approach stands out for its theoretical elegance and practical applicability, offering a scalable solution for tasks like automated painting, inspection, or cleaning on irregular terrains. His research bridges the gap between geometric theory and real-world robotics, providing a foundation for future advancements in autonomous navigation and surface treatment. Hung’s contributions are particularly valuable for students and researchers exploring optimal coverage strategies, as his method combines algorithmic efficiency with geometric insight, making it a compelling reference in the field of computational robotics.