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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE International Conference on Shape Modeling and Applications s. 283 - 284
Hlavní autoři: Kanai, T., Ohtake, Y.
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.06.2008
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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