Level set (data structures): Difference between revisions

Revision as of 10:17, 22 August 2008

Revision as of 02:06, 6 November 2008

Line 9:

===Narrow band===

The narrow band level set method, introduced in 1995 by Adalsteinsson and Sethian <ref name="Adalsteinsson">Adalsteinsson, D. & Sethian, J. A. 1995. "A fast level set method for propagating interfaces." ''[[Journal of Computational Physics]]''. 118(2)269–277.</ref>, restricted most computations to a thin band of active voxels[voxel]s immediately surrounding the interface, thus reducing the time complexity in three dimensions to <math>O(n^2)</math> for most operations. Periodic updates of the narrowband structure, to rebuild the list of active voxels, were required which entailed an <math>O(n^3)</math> operation in which voxels over the entire volume were accessed. The storage complexity for this narrowband scheme was still <math>O(n^3).</math>

===Sparse field===