Level set (data structures): Difference between revisions

Revision as of 15:43, 23 March 2008

Revision as of 19:46, 29 May 2008

Line 24:

===Run-length encoded===

The [[run-length encoding]] (RLE) level set method, introduced in 2004 <ref name=Houston2004>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).</ref>, 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 <math>O(log r)</math> random access, where r is the number of runs per crosssectioncross section. Additional efficiency is gained by applying the RLE scheme in a dimensional recursive fashion, a technique introduced by Nielsen's similar DT-Grid <ref name=Nielsen>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.</ref>.

===Point-based===