Discrete shortest paths on smooth surface representations

We introduce an algorithm for computing discrete shortest paths on smooth surface representations. For given source and target points on a surface, an initial shortest path is computed by using the Dijkstra's algorithm. Based on such an initial curve, locally-refined discrete paths are repeated...

Full description

Saved in:
Bibliographic Details
Published in:2008 IEEE International Conference on Shape Modeling and Applications pp. 283 - 284
Main Authors: Kanai, T., Ohtake, Y.
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.06.2008
Subjects:
Application software
Clustering algorithms
Computational geometry
Computer graphics
G.1.2 [Numerical Analysis]: Approximation-Approximation of Surfaces and Contours
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Curve
Numerical analysis
Piecewise linear approximation
Piecewise linear techniques
Precision engineering
Solid and Object Representations
Solid modeling
Surface
ISBN:9781424422609, 1424422604
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce an algorithm for computing discrete shortest paths on smooth surface representations. For given source and target points on a surface, an initial shortest path is computed by using the Dijkstra's algorithm. Based on such an initial curve, locally-refined discrete paths are repeatedly calculated so as to get more accurate shortest path. Our algorithm is simple, easy to implement and much fast because it requires only the Dijkstra's algorithm to compute the path. Our algorithm is a versatile approach for a wide variety of smooth surface representations.
ISBN:9781424422609
1424422604
DOI:10.1109/SMI.2008.4548008