CSDL Home IEEE Transactions on Visualization & Computer Graphics 2010 vol.16 Issue No.04 - July/August

Subscribe

Issue No.04 - July/August (2010 vol.16)

pp: 583-598

Kenneth Weiss , University of Maryland, College Park

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.29

ABSTRACT

Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continues to widen. Our multiresolution scalar field model is a hierarchy of tetrahedral clusters generated by longest edge bisection that we call a hierarchy of diamonds. We propose two multiresolution models for representing isosurfaces, or interval volumes, extracted from a hierarchy of diamonds which exploit its regular structure. These models are defined by subsets of diamonds in the hierarchy that we call isodiamonds, which are enhanced with geometric and topological information for encoding the relation between the isosurface, or interval volume, and the diamond itself. The first multiresolution model, called a relevant isodiamond hierarchy, encodes the isodiamonds intersected by the isosurface, or interval volume, as well as their nonintersected ancestors, while the second model, called a minimal isodiamond hierarchy, encodes only the intersected isodiamonds. Since both models operate directly on the extracted isosurface or interval volume, they require significantly less memory and support faster selective refinement queries than the original multiresolution scalar field, but do not support dynamic isovalue modifications. Moreover, since a minimal isodiamond hierarchy only encodes intersected isodiamonds, its extracted meshes require significantly less memory than those extracted from a relevant isodiamond hierarchy. We demonstrate the compactness of isodiamond hierarchies by comparing them to an indexed representation of the mesh at full resolution.

INDEX TERMS

Isosurfaces, interval volumes, multiresolution models, longest edge bisection, diamond hierarchies.

CITATION

Kenneth Weiss, "Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes",

*IEEE Transactions on Visualization & Computer Graphics*, vol.16, no. 4, pp. 583-598, July/August 2010, doi:10.1109/TVCG.2010.29REFERENCES

- [1] L. De Floriani and P. Magillo, "Multiresolution Mesh Representation: Models and Data Structures,"
Principles of Multi-Resolution Geometric Modeling, Springer-Verlag, pp. 364-418, 2002.- [2] K. Weiss and L. De Floriani, "Multiresolution Interval Volume Meshes,"
Proc. IEEE/EG Symp. Volume and Point-Based Graphics, pp. 65-72, 2008.- [3] J.M. Maubach, "Local Bisection Refinement for $n$ -Simplicial Grids Generated by Reflection,"
SIAM J. Scientific Computing, vol. 16, no. 1, pp. 210-227, Jan. 1995.- [4] L. De Floriani, E. Puppo, and P. Magillo, "A Formal Approach to Multi-Resolution Modeling,"
Geometric Modeling: Theory and Practice, Springer-Verlag, pp. 302-323, 1997.- [5] P. Cignoni, L. De Floriani, P. Magillo, E. Puppo, and R. Scopigno, "Selective Refinement Queries for Volume Visualization of Unstructured Tetrahedral Meshes,"
IEEE Trans. Visualization and Computer Graphics, vol. 10, no. 1, pp. 29-45, Jan. 2004.- [6] W. Lorensen and H. Cline, "Marching Cubes: A High Resolution 3D Surface Construction Algorithm,"
Proc. ACM SIGGRAPH '87, pp. 163-169, 1987.- [7] G. Nielson and B. Hamann, "The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes,"
Proc. IEEE Workshop Visualization, pp. 83-91, 1991.- [8] B. Payne and A. Toga, "Surface Mapping Brain Function on 3D Models,"
IEEE Computer Graphics and Applications, vol. 10, no. 5, pp. 33-41, Sept. 1990.- [9] S. Gibson, "Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data,"
Proc. Int'l Conf. Medical Image Computing and Computer-Assisted Intervention (MICCAI), pp. 888-898, 1998.- [10] T. Ju, F. Losasso, S. Schaefer, and J. Warren, "Dual Contouring of Hermite Data,"
ACM Trans. Graphics, vol. 21, no. 3, pp. 339-346, 2002.- [11] I. Fujishiro, Y. Maeda, and H. Sato, "Interval Volume: A Solid Fitting Technique for Volumetric Data Display and Analysis,"
Proc. IEEE Workshop Visualization, pp. 151-158, 1995.- [12] B. Guo, "Interval Set: A Volume Rendering Technique Generalizing Isosurface Extraction,"
Proc. IEEE Workshop Visualization, pp. 3-10, 1995.- [13] I. Fujishiro, Y. Maeda, H. Sato, and Y. Takeshima, "Volumetric Data Exploration Using Interval Volume,"
IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 2, pp. 144-155, June 1996.- [14] G.M. Nielson and J. Sung, "Interval Volume Tetrahedralization,"
Proc. IEEE Workshop Visualization, pp. 221-228, 1997.- [15] P. Bhaniramka, R. Wenger, and R. Crawfis, "Isosurfacing in Higher Dimensions,"
Proc. IEEE Workshop Visualization, pp. 267-273, Oct. 2000.- [16] P. Bhaniramka, C. Zhang, D. Xue, R. Crawfis, and R. Wenger, "Volume Interval Segmentation and Rendering,"
Proc. Volume Visualization Symp., 2004.- [17] Y. Zhang, C. Bajaj, and B. Sohn, "Adaptive and Quality 3D Meshing from Imaging Data,"
Proc. ACM Symp. Solid Modeling and Applications, pp. 286-291, 2003.- [18] J. Wilhelms and A.V. Gelder, "Octrees for Faster Isosurface Generation,"
ACM Trans. Graphics, vol. 11, no. 3, pp. 201-227, 1992.- [19] R. Shekhar, E. Fayyad, R. Yagel, and J. Cornhill, "Octree-Based Decimation of Marching Cubes Surfaces,"
Proc. IEEE Workshop Visualization, pp. 335-342, 1996.- [20] R. Westermann, L. Kobbelt, and T. Ertl, "Real-Time Exploration of Regular Volume Data by Adaptive Reconstruction of Isosurfaces,"
Visual Computer, vol. 15, no. 2, pp. 100-111, 1999.- [21] M. Kazhdan, A. Klein, K. Dalal, and H. Hoppe, "Unconstrained Isosurface Extraction on Arbitrary Octrees,"
Proc. Eurographics Symp. Geometry Processing, pp. 125-133, 2007.- [22] S.F. Frisken, R.N. Perry, A.P. Rockwood, and T.R. Jones, "Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics,"
Proc. ACM SIGGRAPH '00, pp. 249-254, July 2000.- [23] Y. Zhou, B. Chen, and A. Kaufman, "Multi-Resolution Tetrahedral Framework for Visualizing Regular Volume Data,"
Proc. IEEE Workshop Visualization, R. Yagel and H. Hagen, eds., pp. 135-142, Oct. 1997.- [24] T. Gerstner and M. Rumpf, "Multiresolutional Parallel Isosurface Extraction Based on Tetrahedral Bisection,"
Proc. Volume Visualization Symp., pp. 267-278, 1999.- [25] T. Gerstner and R. Pajarola, "Topology-Preserving and Controlled Topology Simplifying Multi-Resolution Isosurface Extraction,"
Proc. IEEE Workshop Visualization, pp. 259-266, 2000.- [26] M. Lee, L. De Floriani, and H. Samet, "Constant-Time Neighbor Finding in Hierarchical Tetrahedral Meshes,"
Proc. Int'l Conf. Shape Modeling, pp. 286-295, May 2001.- [27] B. Gregorski, M. Duchaineau, P. Lindstrom, V. Pascucci, and K. Joy, "Interactive View-Dependent Rendering of Large Isosurfaces,"
Proc. IEEE Workshop Visualization, pp. 475-484, Oct. 2002.- [28] M. Duchaineau, M. Wolinsky, D.E. Sigeti, M.C. Miller, C. Aldrich, and M.B. Mineev-Weinstein, "ROAMing Terrain: Real-Time Optimally Adapting Meshes,"
Proc. IEEE Workshop Visualization, pp. 81-88, Oct. 1997.- [29] K. Weiss and L. De Floriani, "Supercubes: A High-Level Primitive for Diamond Hierarchies,"
IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 6, pp. 1603-1610, Nov./Dec. 2009.- [30] V. Mello, L. Velho, and G. Taubin, "Estimating the in/out Function of a Surface Represented by Points,"
Proc. Symp. Solid Modeling and Applications, pp. 108-114, 2003.- [31] A. Gress and R. Klein, "Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-Trees,"
Graphical Models, special issue on pacific graphics, vol. 66, no. 6, pp. 370-397, 2004.- [32] S. Schaefer, T. Ju, and J. Warren, "Manifold Dual Contouring,"
IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 3, pp. 610-619, May/June 2007.- [33] T. Ju and T. Udeshi, "Intersection-Free Contouring on an Octree Grid,"
Proc. Pacific Conf. Computer Graphics and Applications (Pacific Graphics), 2006.- [34] V. Pascucci and C.L. Bajaj, "Time-Critical Isosurface Refinement and Smoothing,"
Proc. IEEE Volume Visualization Symp., pp. 33-42, Oct. 2000.- [35] T. Lewiner, L. Velho, H. Lopes, and V. Mello, "Simplicial Isosurface Compression,"
Proc. Vision, Modeling, and Visualization Conf., pp. 299-306, Nov. 2004.- [36] K. Weiss and L. De Floriani, "Diamond Hierarchies of Arbitrary Dimension,"
Computer Graphics Forum, vol. 28, no. 5, pp. 1289-1300, 2009.- [37] H. Hege, M. Seebaß, D. Stalling, and M. Zöckler, "A Generalized Marching Cubes Algorithm," Konrad-Zuse-Zentrum für Informationstechnik Berlin, technical report, citeseer.ist.psu.edu575196.html, 1997.
- [38] K. Bonnell, M. Duchaineau, D. Schikore, B. Hamann, and K. Joy, "Material Interface Reconstruction,"
IEEE Trans. Visualization and Computer Graphics, vol. 9, no. 4, pp. 500-511, Oct.-Dec. 2003.- [39] G.M. Nielson, "Dual Marching Tetrahedra: Contouring in the Tetrahedronal Environment,"
Advances in Visual Computing, Springer, pp. 183-194, 2008. |