Handling degenerate cases in exact geodesic computation on triangle meshes

Authors:
Yong-Jin Liu;Qian-Yi Zhou;Shi-Min Hu
Affiliations:
Tsinghua University, Department of Computer Science and Technology, East Main Building, 100084, Beijing, China;Tsinghua University, Department of Computer Science and Technology, East Main Building, 100084, Beijing, China;Tsinghua University, Department of Computer Science and Technology, East Main Building, 100084, Beijing, China
Venue:
The Visual Computer: International Journal of Computer Graphics
Year:
2007

Citing 0
Cited 4

Approximating generalized distance functions on weighted triangulated surfaces with applications

Journal of Computational and Applied Mathematics
Exact geodesic metric in 2-manifold triangle meshes using edge-based data structures

Computer-Aided Design
Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem

ACM Transactions on Graphics (TOG)
Parallel chen-han (PCH) algorithm for discrete geodesics

ACM Transactions on Graphics (TOG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.