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

Direct link
Hierarchical RLE level set: A compact and versatile deformable surface representation
Exocortex Technologies, Frantic Films.
University of Århus.
University of British Columbia, Frantic Films.
Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
Show others and affiliations
2006 (English)In: ACM Transactions on Graphics, ISSN 0730-0301, E-ISSN 1557-7368, Vol. 25, no 1, 151-175 p.Article in journal (Refereed) Published
Abstract [en]

This article introduces the Hierarchical Run-Length Encoded (H-RLE) Level Set data structure. This novel data structure combines the best features of the DT-Grid ( of Nielsen and Museth [ 2004]) and the RLE Sparse Level Set ( of Houston et al. [ 2004]) to provide both optimal efficiency and extreme versatility. In brief, the H- RLE level set employs an RLE in a dimensionally recursive fashion. The RLE scheme allows the compact storage of sequential nonnarrowband regions while the dimensionally recursive encoding along each axis efficiently compacts nonnarrowband planes and volumes. Consequently, this new structure can store and process level sets with effective voxel resolutions exceeding 5000 x 3000 x 3000 ( 45 billion voxels) on commodity PCs with only 1 GB of memory. This article, besides introducing the H- RLE level set data structure and its efficient core algorithms, also describes numerous applications that have benefited from our use of this structure: our unified implicit object representation, efficient and robust mesh to level set conversion, rapid ray tracing, level set metamorphosis, collision detection, and fully sparse fluid simulation ( including RLE vector and matrix representations.) Our comparisons of the popular octree level set and Peng level set structures to the H- RLE level set indicate that the latter is superior in both narrowband sequential access speed and overall memory usage.

Place, publisher, year, edition, pages
2006. Vol. 25, no 1, 151-175 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-48097DOI: 10.1145/1122501.1122508OAI: diva2:268993
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2010-10-19
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

Other links

Publisher's full text

Search in DiVA

By author/editor
Nilsson, OlaMuseth, Ken
By organisation
Department of Science and TechnologyThe Institute of TechnologyDigital Media
In the same journal
ACM Transactions on Graphics
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

Altmetric score

Total: 297 hits
ReferencesLink to record
Permanent link

Direct link