Fast approximation of geodesic based on heuristic estimate

Author

Yaqi, Ma ; Zhongke, Li

Author_Institution

Xi´´an Res. Inst. of High-tech, Hongqing Town, China

Volume

3

fYear

2010

fDate

25-27 June 2010

Abstract

Geodesic computation is very important in various mesh processing techniques such as segmenting, re-meshing, parameterizing, navigating and editing. In this paper, we present a new method to quickly extract geodesic paths on 3D triangle meshes. Based on heuristic estimate and Dimas Martinez and Luiz Velho´s evolving method, we generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and non-convex surfaces. Experiment results show that our method works very well both in efficiency and precision.

Keywords

approximation theory; computational geometry; differential geometry; heuristic programming; iterative methods; mesh generation; 3D triangle meshes; Dimas Martinez evolving method; Luiz Velho evolving method; convex surface; discrete geodesic approximation; geodesic fast approximation; geodesic path extraction; heuristic estimate; iterative process; mesh processing technique; nonconvex surfaces; Cities and towns; Design methodology; Error correction; Geophysics computing; Iterative algorithms; Iterative methods; Mesh generation; Navigation; Runtime; Visualization; geodesic; heuristic estimate; triangle mesh;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design and Applications (ICCDA), 2010 International Conference on

Conference_Location

Qinhuangdao

Print_ISBN

978-1-4244-7164-5

Electronic_ISBN

978-1-4244-7164-5

Type

conf

DOI

10.1109/ICCDA.2010.5540779

Filename

5540779