Skip to main content
Log in

Topological Zone Organization of Scalar Volume Data

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

We present a new method for preprocessing and organizing discrete scalar volume data of any dimension on external storage. We describe our implementation of a visual navigation system using our method. The techniques have important applications for out-of-core visualization of volume data sets and image understanding. The applications include extracting isosurfaces in a manner that helps reduce both I/O and disk seek time, a priori topologically correct isosurface simplification (prior to extraction), and producing a visual atlas of all topologically distinct objects in the data set. The preprocessing algorithm computes regions of space that we call topological zone components, so that any isosurface component (contour) is completely contained in a zone component and all contours contained in a zone component are topologically equivalent. The algorithm also constructs a criticality tree that is related to the recently studied contour tree. However, unlike the contour tree, the zones and the criticality tree hierarchically organize the data set. We demonstrate that the techniques work on both irregularly and regularly gridded data, and can be extended to data sets with nonunique values, by the mathematical analysis we call Digital Morse Theory (DMT), so that perturbation of the data set is not required. We present the results of our initial experiments with three dimensional volume data (CT) and describe future extensions of our DMT organizing technology.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Avila, T. He, L. Hong, and A. Kaufman et al., “VolVis: A diversified volume visualization system,” in Proceeings of the IEEE Conference on Visualization 1994 (Visualization' 94), NJ, 1994.

  2. C.L. Bajaj, V. Pascucci, and D.R. Schikore, “Fast isocontouring for improved interactivity,” in Proc. 1996 IEEE Symposium on Volume Visualization, 1996, pp. 39–46.

  3. H. Carr, J. Snoeyink, and U. Axen, “Computing contour trees in all dimensions,” in Proc. 11th ACM-SIAM Symposium on Discrete Algorithms 2000, pp. 918–926.

  4. Y.-J. Chiang and C.T. Silva, “I/O optimal isosurface extraction,” in IEEE Visualization 1997, 1997, pp. 293–300.

  5. Y.-J. Chiang and C.T. Silva, “External memory techniques for isosurface extraction in scientific visualization,” External Memory Algorithms, AMS-DIMACS Book Series, Vol. 50, pp. 247–277, 1999.

  6. Y.-J. Chiang, C.T. Silva, and W.J. Schroeder, “Interactive out-of-core isosurface extraction,” in IEEE Visualization, 1998, pp. 167–174.

  7. P. Cignoni, P. Marino, C. Montani, E. Puppo, and R. Scopigno, “Speeding up isosurface extraction using interval tree,” IEEE Transcations on Visualization and Computer Graphics, Vol. 3, No. 2, 1997.

  8. H.E. Cline, W.E. Lorensen, S. Ludke, and B.C.T.C.R. Crawford, “Two algorithms for the reconstruction of surfaces from tomograms,” Medical Physics, Vol. 15, No. 3, pp. 320–327, 1988.

    Google Scholar 

  9. J.L. Cox, D.B. Karron, and B. Mishra, “The spiderWeb algorithm for surface construction from medical volume data: Geometric properties of its surface,” Innovations Et Technologie en Biologie et Medecine, Vol. 14, No. 6, pp. 634–656, 1993.

    Google Scholar 

  10. N. Ferdous, “Volume data set visualization using topological zone segmentation,” Ph.D. Thesis, City University of New York, 2001.

  11. R. Gallagher, “Span filter: An optimization scheme for volume visualization of large finite element models,” in Proceedings of Visualization' 91, 1991.

  12. A. Guezic and R. Hummel, “Exploiting triangulated isosurface extraction using tetrahedral decomposition,” IEEE Transactions on Visualization and Computer Graphics, Vol. 1, No. 4, 1995.

  13. P. Heckbert and M. Garland, “Multiresolution modeling for fast rendering,” in Proceedings Graphics Interface 94, 1994.

  14. P. Heckbert and M. Garland, “Survey of polygonal surface simplification algorithms,” in SIGGRAPH 97 Course Notes, 1997.

  15. G.T. Herman, “Oriented surfaces in digital spaces,” CVGIP: Graphical Models and Image Processing, Vol. 55, No. 5, pp. 381–396, 1993.

    Google Scholar 

  16. T. Itoh and K. Koyamada, “Automatic isosurface propagation using an extrema graph and sorted boundary cell lists,” IEEE Transactions on Visualization and Computer Graphics, Vol. 1, No. 4, 1995.

  17. D. Karron and J. Cox, “The spiderweb algorithm for extracting 3D objects from volume data,” in Computer Vision, Virtual Reality and Robotics in Medicine, N. Ayache (Ed.), 1995, pp. 481–486.

  18. D.B. Karron and J. Cox, “Extracting 3D objects from volume data using digital Morse theory,” in Computer Vision, Virtual Reality and Robotics in Medicine, N. Ayache (Ed.), 1995, pp. 481–486.

  19. D. Karron and J. Cox, “Digital Morse theory for anatomic modeling,” in Proceedings of IEEE BMES-EMBS First Joint Conference, 1999.

  20. D.B. Karron, J. Cox, and B. Mishra, “New findings from the SpiderWeb algorithm: Toward a digital Morse theory,” in Visualization in Biomedical Computing—'94, R.A. Robb (Ed.), 1994, pp. 643–657.

  21. D. Karron, J. Cox, and B. Mishra, “System and method for surface rendering of internal structures within the interior of a solid object,” United States Patent 5,898,793, 1999.

  22. A. Kaufman, R. Bakalash, D. Cohen, and R. Yagel, “Introduction to chapter 6: Architectures for volume rendering,” in Volume Visualization, A. Kaufman (Ed.), IEEE Computer Society Press Tutorial, IEEE Computer Society Press: Los Alamitor, CA, 1991, pp. 311–320.

    Google Scholar 

  23. M. Levoy, “A taxonomy of volume visualization algorithms,” in SIGGRAPH 91 Volume Visualization Course Notes, 1991.

  24. Y. Livnat, H. Shen, and C. Johnson, “A near optimal isosurface extraction algorithm using the span space,” IEEE Transactions on Visualization and Computer Graphics, Vol. 2, No. 1, 1996.

  25. W.E. Lorensen and H.E. Cline, “Marching cubes: A high resolution 3D surface construction algorithm,” ACM Computer Graphics, Vol. 21, No. 4, pp. 163–169, 1987.

    Google Scholar 

  26. N. Max, “Optical models for direct volume rendering,” IEEE Transcations on Visualization and Computer Graphics, Vol. 1, No. 2, 1995.

  27. G.M. Nielson and B. Hamann, “The asymptotic decider: Resolving the ambiguity in marching cubes,” in Proceedings of Visualization 91, G.M. Nielson and L. Rosenblum (Eds.), 1991, Vol. 2, pp. 83–91.

  28. W. Schroeder, K. Martin, and W. Lorensen, The Visualization Toolkit, Prentice-Hall: Englewood Cliffs, NJ, 1996.

    Google Scholar 

  29. W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of triangle meshes,” ACM Computer Graphics, Vol. 26, No. 2, pp. 65–70, 1992.

    Google Scholar 

  30. H. Shen and C. Johnson, “Sweeping simplices: A fast isosurface extraction algorithm for unstructured grid,” in Proceedings on Visualization' 95, 1995.

  31. C. Silva and A. Kaufman, “PVR: High performance volume rendering,” in IEEE Computational Science and Engineering 1996, 1996.

  32. S.P. Tarasov and M.N. Vyalyi, “Construction of contour trees in 3D in O(n log n) steps,” in Proceedings 14th Ann. ACM Symposium on Computational Geometry, 1998, pp. 68–75.

  33. M. vanKreveld, R. vanOostrum, C. Bajaj, V. Pascucci, and D. Schikore, “Contour trees and small seed sets for isosurface traversal,” in Proceedings 13th Ann. ACM Symposium on Computational Geometry, 1996, pp. 212–220.

  34. K. Whang, J. Song, J. Chang, J. Kim, W. Cho, C. Park, and I.Y. Song, “Octree-R: An adaptive octree for efficient ray tracing,” IEEE Transactions on Visualization and Computer Graphics, Vol. 1, No. 4, 1995.

  35. J. Wilhelms and A.V. Gelder, “Octrees for faster isosurface generation,” ACM Transactions on Graphics, Vol. 11, No. 3, pp. 201–227, 1992.

    Google Scholar 

  36. G. Wolberg, “2D and 3D image registration and warping,” SIGGRAPH 99 Conference Course Notes, 1999.

  37. Y. Zhou, B. Chen, and Z. Tang, “An elaborate ambiguity detection method for constructing isosurfaces within tetrahedral meshes,” Computers and Graphics, Vol. 19, No. 3, pp. 355–364, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cox, J., Karron, D. & Ferdous, N. Topological Zone Organization of Scalar Volume Data. Journal of Mathematical Imaging and Vision 18, 95–117 (2003). https://doi.org/10.1023/A:1022113114311

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022113114311

Navigation