Fast approximate geodesic paths on triangle mesh

  • Jie TangEmail author
  • Gang-Shan Wu
  • Fu-Yan Zhang
  • Ming-Min Zhang


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.


Triangle mesh geodesic path virtual reality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Katz, A. Tal. Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts. ACM Transactions on Graphics. vol. 22, no. 3, pp. 954–961, 2003.CrossRefGoogle Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    G. Peyre, L. D. Cohen. Geodesic Remeshing Using Front Propagation. International Journal of Computer Vision, vol. 69, no. 1, pp. 145–156, 2006.CrossRefGoogle Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    K. Polthier, M. Schmies. Geodesic Flow on Polyhedral Surfaces. Data Visualization, Springer, Vienna, pp. 179–188, 1999.Google Scholar
  6. [6]
    J. Mitchell, D. M. Mount, C. H. Papadimitriou. The Discrete Geodesic Problem. SIAM Journal of Computing, vol. 16, no. 4, pp. 647–668, 1987.CrossRefMathSciNetGoogle Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.CrossRefMathSciNetGoogle Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.CrossRefGoogle Scholar
  12. [12]
    Dimas Martinez, Luiz Velho, Paulo C. Carvalho. Computing Geodesics on Triangular Meshes. Computers & Graphics, vol. 29, no. 5, pp. 667–675, 2005.CrossRefGoogle Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    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.CrossRefMathSciNetGoogle Scholar

Copyright information

© Institute of Automation, Chinese Academy of Sciences 2007

Authors and Affiliations

  • Jie Tang
    • 1
    Email author
  • Gang-Shan Wu
    • 1
  • Fu-Yan Zhang
    • 1
  • Ming-Min Zhang
    • 2
  1. 1.State Key Laboratory for Novel Software TechnologyNanjing UniversityNanjingPRC
  2. 2.School of Computer ScienceZhejiang UniversityHangzhouPRC

Personalised recommendations