Constraint Shortest Path Computation on Polyhedral Surfaces
Synave Rémi, Gueorguieva Stefka, Pascal Desbarats · 2008
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.