Handling degenerate cases in exact geodesic computation on triangle meshes

Visual Computer

Volumn 23, Issue 9-11, 2007, Pages 661-668

  Liu, Yong Jin ^a   Zhou, Qian Yi ^a   Hu, Shi Min ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Degenerate cases; Exact geodesic computation; Robustness

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER GRAPHICS; GEODESY; ROBUSTNESS (CONTROL SYSTEMS); USER INTERFACES;

GEODESIC COMPUTATION; GEOMETRIC ALGORITHMS; PRACTICAL ALGORITHMS; REAL-WORLD DATA;

MESH GENERATION;

EID: 36049035900     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-007-0136-5     Document Type: Conference Paper

References (6)

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)
2. Hoffmann, C.: Robustness in geometric computations. J. Comput. Info. Sci. Eng. 1(2), 143-155 (2001)
3. Mitchell, J., Mount, D., Papadimitriou, C.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647-668 (1987)
4. Sugihara, K., Iri, M., Inagaki, H., Imai, T.: Topology-oriented implementation: an approach to robust geometric algorithms. Algorithmica 27(11), 5-20 (2000)
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)
6. Zachary, J.: Introduction to Scientific Programming. TELOS, Santa Clara, CA (1998)