Constraint Shortest Path Computation on Polyhedral Surfaces

Authors:
Synave Rémi;Gueorguieva Stefka;Desbarats Pascal
Affiliations:
-;-;-
Venue:
ICVGIP '08 Proceedings of the 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing
Year:
2008

Citing 0
Cited 1

Teaching geometric modeling algorithms and data structures through laser scanner acquisition pipeline

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.