Discrete shortest paths on smooth surface representations

Author

Kanai, Takashi ; Ohtake, Yutaka

Author_Institution

Grad. Sch. of Arts & Sci., Univ. of Tokyo, Tokyo

fYear

2008

fDate

4-6 June 2008

Firstpage

283

Lastpage

284

Abstract

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.

Keywords

image representation; Dijkstra algorithm; discrete shortest paths; locally-refined discrete paths; smooth surface representations; Application software; Art; Clustering algorithms; Computational geometry; Computer graphics; Numerical analysis; Piecewise linear approximation; Piecewise linear techniques; Precision engineering; Solid modeling; G.1.2 [Numerical Analysis]: Approximation—Approximation of Surfaces and Contours; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Curve, Surface, Solid and Object Representations;

fLanguage

English

Publisher

ieee

Conference_Titel

Shape Modeling and Applications, 2008. SMI 2008. IEEE International Conference on

Conference_Location

Stony Brook, NY

Print_ISBN

978-1-4244-2260-9

Electronic_ISBN

978-1-4244-2261-6

Type

conf

DOI

10.1109/SMI.2008.4548008

Filename

4548008