A Memory and Computation Efficient Sparse Level-Set Method

Authors:
Wladimir J. Laan;Andrei C. Jalba;Jos B. Roerdink
Affiliations:
Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen, Groningen, The Netherlands 9700 AK;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB;Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen, Groningen, The Netherlands 9700 AK
Venue:
Journal of Scientific Computing
Year:
2011

Citing 20
Cited 1

Efficient implementation of essentially non-oscillatory shock-capturing schemes

Journal of Computational Physics
Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations

Journal of Computational Physics
Computing minimal surfaces via level set curvature flow

Journal of Computational Physics
Weighted essentially non-oscillatory schemes

Journal of Computational Physics
A fast level set method for propagating interfaces

Journal of Computational Physics
A Level-Set Approach to 3D Reconstruction from Range Data

International Journal of Computer Vision
Tree methods for moving interfaces

Journal of Computational Physics
A PDE-based fast local level set method

Journal of Computational Physics
Level set methods: an overview and some recent results

Journal of Computational Physics
A hybrid particle level set method for improved interface capturing

Journal of Computational Physics
An Adaptive Level Set Method for Medical Image Segmentation

IPMI '01 Proceedings of the 17th International Conference on Information Processing in Medical Imaging
Computational aspects of dynamic surfaces

Computational aspects of dynamic surfaces
Simulating water and smoke with an octree data structure

ACM SIGGRAPH 2004 Papers
Local level set method in high dimension and codimension

Journal of Computational Physics
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology
Hierarchical RLE level set: A compact and versatile deformable surface representation

ACM Transactions on Graphics (TOG)
Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets

Journal of Scientific Computing
3D distance transform adaptive filtering for smoothing and denoising triangle meshes

Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
A fast and accurate semi-Lagrangian particle level set method

Computers and Structures
A streaming narrow-band algorithm: interactive computation and visualization of level sets

IEEE Transactions on Visualization and Computer Graphics

High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex Geometries

Journal of Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since its introduction, the level set method has become the favorite technique for capturing and tracking moving interfaces, and found applications in a wide variety of scientific fields. In this paper we present efficient data structures and algorithms for tracking dynamic interfaces through the level set method. Several approaches which address both computational and memory requirements have been very recently introduced. We show that our method is up to 8.5 times faster than these recent approaches. More importantly, our algorithm can greatly benefit from both fine- and coarse-grain parallelization by leveraging SIMD and/or multi-core parallel architectures.