ACM Home Page
Please provide us with feedback. Feedback
Out-of-core and compressed level set methods
Full text PdfPdf (11.88 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 26 ,  Issue 4  (October 2007) table of contents
Article No. 16  
Year of Publication: 2007
ISSN:0730-0301
Authors
Michael B. Nielsen  University of Århus
Ola Nilsson  University of Linköping
Andreas Söderström  University of Linköping
Ken Museth  University of Linköping and University of Århus
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 169,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1289603.1289607
What is a DOI?

ABSTRACT

This article presents a generic framework for the representation and deformation of level set surfaces at extreme resolutions. The framework is composed of two modules that each utilize optimized and application specific algorithms: 1) A fast out-of-core data management scheme that allows for resolutions of the deforming geometry limited only by the available disk space as opposed to memory, and 2) compact and fast compression strategies that reduce both offline storage requirements and online memory footprints during simulation. Out-of-core and compression techniques have been applied to a wide range of computer graphics problems in recent years, but this article is the first to apply it in the context of level set and fluid simulations. Our framework is generic and flexible in the sense that the two modules can transparently be integrated, separately or in any combination, into existing level set and fluid simulation software based on recently proposed narrow band data structures like the DT-Grid of Nielsen and Museth [2006] and the H-RLE of Houston et al [2006]. The framework can be applied to narrow band signed distances, fluid velocities, scalar fields, particle properties as well as standard graphics attributes like colors, texture coordinates, normals, displacements etc. In fact, our framework is applicable to a large body of computer graphics problems that involve sequential or random access to very large co-dimension one (level set) and zero (e.g. fluid) data sets. We demonstrate this with several applications, including fluid simulations interacting with large boundaries (≈ 15003), surface deformations (≈ 20483), the solution of partial differential equations on large surfaces (≈ 40963) and mesh-to-level set scan conversions of resolutions up to ≈ 350003 (7 billion voxels in the narrow band). Our out-of-core framework is shown to be several times faster than current state-of-the-art level set data structures relying on OS paging. In particular we show sustained throughput (grid points/sec) for gigabyte sized level sets as high as 65% of state-of-the-art throughput for in-core simulations. We also demonstrate that our compression techniques out-perform state-of-the-art compression algorithms for narrow bands.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
 
5
 
6
 
7
 
8
9
 
10
 
11
 
12
 
13
 
14
Dongarra, J., Lumsdaine, A., Niu, X., Pozo, R., and Remington, K. 1994. A sparse matrix library in C++ for high performance architectures. 214--218. http://citeseer.1st.psu.edu/dongarra94sparse.html.
 
15
 
16
17
18
19
20
21
 
22
Hestenes, M. R. and Stiefel, E. L. 1952. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards Sect. 5, 49, 409--436.
 
23
24
25
 
26
Hy Trac, U.-L. P. 2006. Out-of-core hydrodynamic simulations for cosmological applications. New Astronomy.
 
27
Ibarria, L., Lindstrom, P., Rossignac, J., and Szymczak, A. 2003. Out-of-core compression and decompression of large n-dimensional scalar fields. Comput. Graph. For. 22, 3, 343--348.
28
 
29
 
30
Isenburg, M. and Alliez, P. 2002. Compressing hexahedral volume meshes.
31
 
32
Isenburg, M., Lindstrom, P., and Snoeyink, J. 2004. Lossless compression of floating-point geometry. CAD'3D.
 
33
34
 
35
 
36
Jones, M. W. 2004. Distance field compression. In Proceedings of International Conference on Computer Graphics Visulization and Computer Vision. (WSCG) 199--204.
37
 
38
Kälberer, F., Polthier, K., Reitebuch, U., and Wardetzky, M. 2005. Free lence---coding with free valences. In Proceedings of Eurographics.
 
39
 
40
41
 
42
Krishnamoorthy, S., Baumgartner, G., Lam, C.-C., Nieplocha, J., and Sadayappan, P. 2004. Efficient layout transformation for disk-based multidimensional arrays. In Proceedings of International Conference in Performance Computing (HiPC). 386--398.
 
43
Laney, D. E., Bertram, M., Duchaineau, M. A., and Max, N. 2002. Multiresolution distance volumes for progressive surface compression. In Proceedings of International Conference on 3D Data Processing Visualization and Transmission (3DPVT). 470--479.
44
45
 
46
 
47
 
48
 
49
 
50
 
51
52
 
53
Losasso, F., Fedkiw, R., and Osher, S. 2005. Spatially adaptive techniques for level set methods and incompressible flow. Comput. Fluids. To appear.
54
 
55
 
56
57
 
58
 
59
Milne, R. B. 1995. An adaptive level-set method. Ph.D. thesis, University of California, Berkeley.
 
60
61
62
 
63
Museth, K., Breen, D., Whitaker, R., Mauch, S., and Johnson, D. 2005. Algorithms for interactive editing of level set models. Comput. Grap. For. 24, 4, 821--841.
64
 
65
Nguyen, K. G. and Saupe, D. 2001. Rapid high quality compression of volume data for visualization. Comput. Graph. For. 20, 3.
 
66
Nielsen, M. B. and Museth, K. 2004a. Dynamic Tubular Grid: An efficient data structure and algorithms for high resolution level sets. Linköping Electronic Articles in Computer and Information Science 9, 001.
 
67
Nielsen, M. B. and Museth, K. 2004b. An optimized, grid independent, narrow band data structure for high resolution level sets. In Proceedings of SIGRAD'04.
 
68
69
 
70
Osher, S. and Fedkiw, R. 2002. Level Set Methods and Dynamic Implicit Surfaces. Springer-Verlag, Berlin, Germany.
 
71
 
72
Pajarola, R. 2005. Stream-processing points. in IEEE Visualiz. 31.
73
74
 
75
76
 
77
Salmon, J. K. and Warren, M. S. 1997. Parallel, out-of-core methods for n-body simulation. In Proceedings of Conference on Parallel Processing for Scientific Computing (PPSC).
 
78
 
79
 
80
 
81
Sethian, J. A. 1999. Level Set Methods and Fast Marching Methods 2nd Ed. Cambridge University Press, Cambridge, UK.
 
82
Silva, C., Chiang, Y., El-Sana, J., and Lindstrom, P. 2002. Out-of-core algorithms for scientific visualization and computer graphics.
83
 
84
 
85
 
86
 
87
Takahashi, T., Fujii, H., Kunimatsu, A., Kazuhiro Hiwada, T. S., Tanaka, K., and Ueki, H. 2003. Realistic animation of fluid with splashes and foam. Comput. Graph. For. 22, 3, 391--401.
 
88
 
89
 
90
 
91
 
92
 
93
Touma, C. and Gotsman, C. 1998. Triangle mesh compression. In Proceedings of Conference (Graphics Interface). 26--34.
 
94
Trac, H. and Pen, U.-L. 2006. Out of core hydrodynamic Simulations for Cosmological applications. New Astronomy 11, 4, 273--286.
 
95
96
 
97
Vitter, J. S. and Shriver, E. A. M. 1994. Algorithms for parallel memory i: Two-level memories. Algorithmica 12, 2/3, 110--147.
 
98
 
99
 
100
 
101
 
102

Collaborative Colleagues:
Michael B. Nielsen: colleagues
Ola Nilsson: colleagues
Andreas Söderström: colleagues
Ken Museth: colleagues