The Visual Computer

, Volume 23, Issue 9–11, pp 661–668 | Cite as

Handling degenerate cases in exact geodesic computation on triangle meshes

  • Yong-Jin LiuEmail author
  • Qian-Yi Zhou
  • Shi-Min Hu
Original Article


The computation of exact geodesics on triangle meshes is a widely used operation in computer-aided design and computer graphics. Practical algorithms for computing such exact geodesics have been recently proposed by Surazhsky et al. [5]. By applying these geometric algorithms to real-world data, degenerate cases frequently appear. In this paper we classify and enumerate all the degenerate cases in a systematic way. Based on the classification, we present solutions to handle all the degenerate cases consistently and correctly. The common users may find the present techniques useful when they implement a robust code of computing exact geodesic paths on meshes.


Exact geodesic computation Degenerate cases Robustness 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Edelsbrunner, H., Mucke, E.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1), 66–104 (1990)zbMATHCrossRefGoogle Scholar
  2. 2.
    Hoffmann, C.: Robustness in geometric computations. J. Comput. Info. Sci. Eng. 1(2), 143–155 (2001)CrossRefGoogle Scholar
  3. 3.
    Mitchell, J., Mount, D., Papadimitriou, C.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647–668 (1987)zbMATHCrossRefGoogle Scholar
  4. 4.
    Sugihara, K., Iri, M., Inagaki, H., Imai, T.: Topology-oriented implementation: an approach to robust geometric algorithms. Algorithmica 27(11), 5–20 (2000)zbMATHCrossRefGoogle Scholar
  5. 5.
    Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S., Hoppe, H.: Fast exact and approximate geodesics on meshes. In: ACM SIGGRAPH 2005, pp. 553–560 (2005)Google Scholar
  6. 6.
    Zachary, J.: Introduction to Scientific Programming. TELOS, Santa Clara, CA (1998)Google Scholar

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations