Level set (data structures)

From Wikipedia, the free encyclopedia

The usefulness of level sets, and in particular the level set method, have motivated researchers in the field of computer science to craft a number of data structures designed to represent, with various benefits, discretely sampled dynamic level sets functions.

Contents 1 Chronological developments 1.1 Narrow band 1.2 Sparse field 1.3 Sparse block grid 1.4 Octree 1.5 Run-length encoded 1.6 Point-based 2 References

[edit] Chronological developments

The powerful level set method is due to Osher and Sethian 1988 ^[1]. However, the straightforward implementation via a dense d-dimensional array of values, results in both time and storage complexity of O(n^d), where n is the cross sectional resolution of the spatial extents of the domain and d is the spatial dimensions of the domain.

[edit] Narrow band

The narrow band level set method, introduced in 1995 by Adalsteinsson and Sethian ^[2], restricted most computations to a thin band of active voxels immediately surrounding the interface, thus reducing the time complexity to O(n²) for most operations. Periodic updates of the narrowband structure, to rebuild the list of active voxels, were required which entailed an O(n³) operation in which voxels over the entire volume were accessed. The storage complexity for this narrowband scheme was still O(n³).

[edit] Sparse field

This O(n³) time complexity was eliminated in the approximate "sparse field" level set method introduced by Whitaker in 1998 ^[3]. The sparse field level set method employs a set of linked lists to track the active voxels around the interface. This allows incremental extension of the active region as needed without incurring any significant overhead. While consistently O(n²) efficient in time, O(n³) storage space is still required by the sparse field level set method.

[edit] Sparse block grid

The sparse block grid method, introduced by Bridson in 2003 ^[4], divides the entire bounding volume of size n³ into small cubic blocks of m³ voxels each. A coarse grid of size (n / m)³ then stores pointers only to those blocks that intersect the narrow band of the level set. Block allocation and deallocation occur as the surface propagates to accommodate to the deformations. This method has a suboptimal storage complexity of , but retains the constant time access inherent to dense grids.

[edit] Octree

The octree level set method, introduced by Strain in 1999 ^[5] and refined by Losasso ^[6], uses a tree of nested cubes of which the leaf nodes contain signed distance values. Octree level sets currently require uniform refinement along the interface (i.e. the narrow band) in order to obtain sufficient precision. This representation is efficient in terms of storage, O(n²), and relatively efficient in terms of access queries,

[edit] Run-length encoded

The run-length encoding (RLE) level set method, introduced in 2004 ^[7], applies the RLE scheme to compress regions away from the narrow band to just their sign representation while storing with full precision the narrow band. The sequential traversal of the narrow band is optimal and storage efficiency is further improved over the octree level set. The addition of an acceleration lookup table allows for fast O(logr) random access, where r is the number of runs per crosssection. Additional efficiency is gained by applying the RLE scheme in a dimensional recursive fashion, a technique introduced by Nielsen's similar DT-Grid ^[8].

[edit] Point-based

Please improve this section

Corbett in 2005 ^[9] introduced the point-based level set method. Instead of using a uniform sampling of the level set, the continuous level set function is reconstructed from a set of unorganized point samples via moving least squares.

[edit] References

1. ^ Osher, S. & Sethian, J. A. 1988. "Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations". Journal of Computation Physics 79:12–49.
2. ^ Adalsteinsson, D. & Sethian, J. A. 1995. "A fast level set method for propagating interfaces." Journal of Computational Physics. 118(2)269–277.
3. ^ Whitaker, R. T. 1998. "A level-set approach to 3d reconstruction from range data." International Journal of Computer Vision. 29(3)203–231.
4. ^ Bridson, R. 2003. "Computational aspects of dynamic surfaces (dissertation)." Stanford University, Stanford, California.
5. ^ Strain, J. 1999. "Tree methods for moving interfaces." Journal of Computational Physics. 151(2)616–648.
6. ^ Losasso, F., Gibou, F., & Fedkiw, R. 2004. Simulating water and smoke with an octree data structure. ACM Transactions on Graphics. 23(3)457–462.
7. ^ Houston, B., Nielsen, M., Batty, C., Nilsson, O. & K. Museth. 2006. "Hierarchical RLE Level Set: A Compact and Versatile Deformable Surface Representation." ACM Transactions on Graphics. 25(1).
8. ^ Nielsen, M. B. & Museth K. 2006. "Dynamic Tubular Grid: An efficient data structure and algorithms for high resolution level sets." Journal of Scientific Computing. 26(1) 1–39.
9. ^ Corbett, R. 2005. "Point–Based Level Sets and Progress Towards Unorganised Particle Level Sets (thesis)." University of British Columbia, Canada.