Level set (data structures): Difference between revisions

Revision as of 13:01, 8 February 2007

Revision as of 21:50, 12 March 2008

Line 1:

The usefulness ofIn [[levelcomputer setscience]]s, and in particular thea [[level set method]], have motivated researchers in the field of [[computer science]] to craft a number of [[data structure]]s is designed to represent, withdiscretely various benefits, discretely[[Sampling (statistics)|sampled]] dynamic level sets functions.

A common use of this form of data structure is in efficient image [[Rendering (computer graphics)|rendering]].

==Chronological developments==

The powerful [[level set method]] is due to [[Stanley Osher|Osher]] and [[James Sethian|Sethian]] 1988 <ref name=Osher>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.</ref>. However, the straightforward implementation via a dense d-dimensional [[array]] of values, results in both time and storage complexity of <math>O(n^d)</math>, where <math>n</math> is the cross sectional resolution of the spatial extents of the ___domain and <math>d</math> is the number of spatial dimensions of the ___domain.

===Narrow band===