“Gigantic Deformable Surfaces”

  • ©Ben Houston, Michael B. Nielsen, Christopher Batty, Ola Nilsson, and Ken Museth




    Gigantic Deformable Surfaces



    In this sketch, we introduce the Compact RLE Level Set. This representation is new structure that combines the benefits of the two previously presented sparse regular level set representations: the versatile RLE Sparse Level set of [Houston et al. 2004] and the near-optimally efficient DT-Grid of [Nielsen and Museth 2005]. We then present many important applications for computer graphics.


    Houston, B., Wiebe, M., and Batty, C. 2004. RLE sparse level sets. In Proc. SIGGRAPH 2004 on Sketches & Applications, ACM Press, ACM.
    Mauch, S. 2000. A fast algorithm for computing the closest point and distance transform, http://www.acm.caltech.edu/seanm/software/cpt/cpt.pdf.
    Nielsen, M. B., and Museth, K. 2005. Dynamic Tubular Grid: An efficient data structure and algorithms for high resolution level sets. Journal of Scientific Computing.

ACM Digital Library Publication:

Overview Page: