liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Efficient computations of geodesic distance
Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
Department of Informatics, University of Oslo/Centre of Mathematics for Applications, University of Oslo.
Linköping University, Department of Science and Technology, Digital Media. Linköping University, The Institute of Technology.
Centre for Image Analysis, Swedish University of Agricultural Sciences.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

We present a novel way to efficiently compute anisotropic distances over a tessellated domain in two dimensions. The method is based on an integral formulation of distance and entails solving a dynamic programming problem. We also present an intuitive geometric construction that is used to characterize dierent types of boundary conditions and show how they aect the resulting distance function in our and competing work.

The included benchmark study shows that our method provides signicantly better results in anisotropic regions and is faster than a current stat-of-the-art solver. Additionally, our method is straightforward to code; the test implementation is less than 150 lines of C++ code.

Keyword [en]
Distance map, Geodesic distance, Riemannian manifolds
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-54828OAI: diva2:310615
Available from: 2010-04-15 Created: 2010-04-15 Last updated: 2010-10-20
In thesis
1. Level-set methods and geodesic distance functions
Open this publication in new window or tab >>Level-set methods and geodesic distance functions
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The work in this thesis focuses on efficient implementations of level-set methods and geodesic distance functions. The level-set method is a grid based design that inherits many favorable traits from implicit geometry. It is connected to distance functions through its special way of representing geometry: in ìo each point in space stores the closest distance to the surface. To differentiate between the inside and outside of a closed object a signed distance is used. In the discrete form the representation keeps a box around the surface that stores regularly positioned samples of the distance function – i.e. a grid. These samples implicitly encode the surface as the zeroth level-set of the signed distance function, hence the name level-set methods. With this representation of geometry follows a toolbox of operations based on partial differential equations (PDE). The solution to these PDES allows for arbitrary motion and deformation of the surface.

This thesis focuses on two topics: 1) grid storage for level-set methods, and 2) geodesic distance functions and parameterization. These topics are covered in a series of in-depth articles.

Today, level-set methods are becoming widespread in both academia and industry. Data structures and highly accurate methods and numerical schemes are available that allow for efficient handling of topological changes of dynamic curves and surfaces. For some applications, such as the capturing of the air/water interface in free surface fluid simulations, it’s is the only realistic choice. In other areas level-set methods are emerging as a competitive candidate to triangle meshes and other explicit representations.

In particular this work introduces efficient level-set data-structures that allow for extremely detailed simulations and representations. It also presents a parameterization method based on geodesic distance that produces a unique coordinate system, the Riemannian normal coordinates (RNC). Amongst other interesting applications this parameterization can be used for decal compositing, and the translation of vector space algorithms to surfaces. The approximation of the RNC involves one or more distance functions. In this thesis, a method originally presented for triangle meshes is adopted. It is then and extended to compute accurate geodesic distance in anisotropic domains in two and three dimensions. The extension to higher dimensions is also outlined.

To motivate this work several applications based on these novel methods and data structures are presented showing rapid ray-tracing, shape morphing, segmentation, geodesic interpolation, texture mapping, and more.

Place, publisher, year, edition, pages
Linköping: Linköping Universisty Electronic Press, 2009. 92 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1275
National Category
Engineering and Technology
urn:nbn:se:liu:diva-54830 (URN)978-91-7393-524-1 (ISBN)
Public defence
2009-11-19, K3. Kåkenhus, Campus Norrköping, Linköpings universitet, Norrköping, 13:00 (English)
Available from: 2010-04-15 Created: 2010-04-15 Last updated: 2010-06-21Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Nilsson, OlaMuseth, Ken
By organisation
Department of Science and TechnologyThe Institute of TechnologyDigital Media
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 127 hits
ReferencesLink to record
Permanent link

Direct link