Abstract
We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni’s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novotni had missed and we also gave the method to find out the geodesic path which Novotni had not. It can handle both convex and non-convex surfaces or even with boundaries. Experiment results show that our method works very well both in efficiency and precision.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Katz, A. Tal. Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts. ACM Transactions on Graphics. vol. 22, no. 3, pp. 954–961, 2003.
P. Sander, Z. Wood, S. Gortler, J. Snyder, H. Hoppe. Multichart Geometry Images. In Proceedings of Eurographics Symposium on Geometry Processing, Aachen, Germany, pp. 146–155, 2003.
G. Peyre, L. D. Cohen. Geodesic Remeshing Using Front Propagation. International Journal of Computer Vision, vol. 69, no. 1, pp. 145–156, 2006.
M. Hilaga, Y. Shinagawa, T. Kohmura, T. L. Kunii. Topology Matching for Fully Automatic Similarity Estimation of 3d Shapes. In Proceedings of ACM SIGGRAPH 2001, Los Angeles, USA, pp. 203–212, 2001.
K. Polthier, M. Schmies. Geodesic Flow on Polyhedral Surfaces. Data Visualization, Springer, Vienna, pp. 179–188, 1999.
J. Mitchell, D. M. Mount, C. H. Papadimitriou. The Discrete Geodesic Problem. SIAM Journal of Computing, vol. 16, no. 4, pp. 647–668, 1987.
V. Surazhsky, T. Surazhsky, D. Kirsanov, S. Gortler, H. Hoppe. Fast Exact and Approximate Geodesics on Meshes. In Proceedings of ACM SIGGRAPH 2005, Los Angeles, USA, pp. 553–560, 2005.
J. Chen, Y. Han. Shortest Paths on a Polyhedron, Part I: Computing Shortest Paths. International Journal of Computational Geometry & Applications, vol. 6, no. 2, pp. 127–144, 1996.
B. Kaneva, J. O’Rourke. An Implementation of Chen & Han’s Shortest Paths Algorithm. In Proceedings of the 12th Canadian Conference on Computational Geometry, New Brunswick, Germany, pp. 139–146, 2000.
S. Kapoor. Efficient Computation of Geodesic Shortest Paths. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, pp. 770–779, 1999.
T. Kanai, H. Suzuki. Approximate Shortest Path on a Polyhedral Surface and Its Applications. Computer-Aided Design, vol. 33, no. 11, pp. 801–811, 2001.
Dimas Martinez, Luiz Velho, Paulo C. Carvalho. Computing Geodesics on Triangular Meshes. Computers & Graphics, vol. 29, no. 5, pp. 667–675, 2005.
M. Novotni, R. Klein. Computing Geodesic Distances on Triangular Meshes. In Proceedings of the 10th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, Bonn, Germany, pp. 341–347, 2002.
R. Kimmel, J. Sethian. Computing Geodesic Paths on Manifolds. Proceedings of the National Academy of Sciences of USA, vol. 95, no. 15, pp. 8431–8435, 1998.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by National Natural Science Foundation of PRC (No. 60503058, No. 60533080) and the Science and Technology Fund of Huawei Technologies Co., Ltd.
Jie Tang received his B.Sc. and M.Sc. degrees in mechanical engineering from the Southeast University, China, in 1994 and 1997, respectively, and the Ph.D. degree in computer application from Nanjing University of Aeronautics and Astronautics, China, in 2000. He was a senior system analyst at E1 Media Co. Ltd, HongKong before he became a postdoctoral researcher at Nanjing University, China in 2003. Currently, he is a associate professor in the Department of Computer Science and Technology at Nanjing University, China.
He has published about 20 referenced journal and conference papers. His current research interests include virtual reality, computer graphics and multimedia technologies.
Gang-Shan Wu received his B.Sc., M.Sc. and Ph.D. degrees in Computer Science from Nanjing University, China, in 1988, 1991 and 2000, respectively. He is now a professor of Department of Computer Science of Nanjing University, the director of multimedia computing teaching and researching group, director of Multimedia Computing Lab. He was the principal investigator or co-principal investigator of more than twenty projects sponsored by National 863 Hi-Tech Research and Development Program, National Natural Science Foundation of China and Key Project of Chinese Ministry of Education.
His research interests include multimedia information retrieval, Web information processing and Chinese information processing. He published more than thirty papers in these areas.
Prof. Wu has won second-class and third-class awards of Science and Technology Progress of Jiangsu Province respectively, a third-class award of Science and Technology Progress of the Chinese Ministry of Education.
Fu-Yan Zhang is a professor at the Department of Computer Science and Technology of Nanjing University, China. He is currently the chair of the Multimedia Computing Institute of Nanjing University.
His research interests include information processing and multimedia. He has published over 100 technical papers in these areas.
Ming-Min Zhang received her B.Sc. degree from Computer Science Dept, Nanjing University in 1990, and the M.Sc. degree from Computer Science and Engineering Department, Zhejiang University in 1995. She is now an associate professor of Computer and Engineering Department, Zhejiang University.
She has published more than 20 papers in recent years. She is the co-author of two books related to computer graphics and multimedia. Her research interests include virtual reality/virtual environment, multi-resolution modeling, real-time rendering, distributed VR, visualization, multimedia and image processing.
Rights and permissions
About this article
Cite this article
Tang, J., Wu, GS., Zhang, FY. et al. Fast approximate geodesic paths on triangle mesh. Int J Automat Comput 4, 8–13 (2007). https://doi.org/10.1007/s11633-007-0008-5
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11633-007-0008-5