DocumentCode
2426431
Title
Constraint Shortest Path Computation on Polyhedral Surfaces
Author
Remi, S. ; Stefka, Gueorguieva ; Pascal, Desbarats
Author_Institution
LaBRI, Univ. Bordeaux 1, Bordeaux
fYear
2008
fDate
16-19 Dec. 2008
Firstpage
366
Lastpage
373
Abstract
A new method to compute the shortest path over polyhedral surfaces is presented. Based on the consensus plane constrained subdivision of the initial surface, a discrete geodesic approximation is generated with respect to both metric and shape criterion optimization.
Keywords
computational geometry; differential geometry; optimisation; consensus plane constrained subdivision; constraint shortest path computation; discrete geodesic approximation; polyhedral surfaces; shape criterion optimization; Computer graphics; Computer vision; Constraint optimization; Convergence; Geophysics computing; Image processing; Robot motion; Shape; Strips; Surface reconstruction; continuous Dijkstra; digital morphometry; discrete geodesic distance and curvature; laser scanner acquisition and reconstruction; shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision, Graphics & Image Processing, 2008. ICVGIP '08. Sixth Indian Conference on
Conference_Location
Bhubaneswar
Print_ISBN
978-0-7695-3476-3
Electronic_ISBN
978-0-7695-3476-3
Type
conf
DOI
10.1109/ICVGIP.2008.80
Filename
4756094
Link To Document