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
The design and analysis of spatial data structures
The design and analysis of spatial data structures
A fast level set method for propagating interfaces
Journal of Computational Physics
Tree methods for moving interfaces
Journal of Computational Physics
A remark on computing distance functions
Journal of Computational Physics
A semi-Lagrangian high-order method for Navier-Stokes equations
Journal of Computational Physics
Introduction to Algorithms
Gerris: a tree-based adaptive solver for the incompressible Euler equations in complex geometries
Journal of Computational Physics
Simulating water and smoke with an octree data structure
ACM SIGGRAPH 2004 Papers
Modeling and rendering viscous liquids: Research Articles
Computer Animation and Virtual Worlds - Special Issue: The Very Best Papers from CASA 2004
A conservative level set method for two phase flow
Journal of Computational Physics
Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets
Journal of Scientific Computing
A second order accurate level set method on non-graded adaptive cartesian grids
Journal of Computational Physics
Geometric integration over irregular domains with application to level-set methods
Journal of Computational Physics
A hybrid level set-volume constraint method for incompressible two-phase flow
Journal of Computational Physics
Journal of Scientific Computing
VDB: High-resolution sparse volumes with dynamic topology
ACM Transactions on Graphics (TOG)
SMI 2013: Adequate inner bound for geometric modeling with compact field functions
Computers and Graphics
Hi-index | 31.45 |
We present a local level-set method based on the hash table data structure, which allows the storage of only a band of grid points adjacent to the interface while providing an O(1) access to the data. We discuss the details of the construction of the hash table data structure as well as the advection and reinitialization schemes used for our implementation of the level-set method. We propose two dimensional numerical examples and compare the results to those obtained with a quadtree data structure. Our study indicates that the method is straightforward to implement but suffers from limitations that make it less efficient than the quadtree data structure.