Fast geodesic distance approximation using mesh decimation and front propagation

Joachim Giard; Benoît Macq

doi:10.1117/12.805599

10 February 2009 Fast geodesic distance approximation using mesh decimation and front propagation

Joachim Giard, Benoît Macq

Proceedings Volume 7245, Image Processing: Algorithms and Systems VII; 72450B (2009) https://doi.org/10.1117/12.805599
Event: IS&T/SPIE Electronic Imaging, 2009, San Jose, California, United States

Abstract

Polygon meshes are collections of vertices, edges and faces defining surfaces in a 3D environment. Computing geometric features on a polygon mesh is of major interest for various applications. Among these features, the geodesic distance is the distance between two vertices following the surface defined by the mesh. In this paper, we propose an algorithm for fast geodesic distance approximation using mesh decimation and front propagation. This algorithm is appropriated when a fast geodesic distances computation is needed and when no fine precision is required.

Citation Download Citation

Joachim Giard and Benoît Macq "Fast geodesic distance approximation using mesh decimation and front propagation", Proc. SPIE 7245, Image Processing: Algorithms and Systems VII, 72450B (10 February 2009); https://doi.org/10.1117/12.805599

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available