Skip to main content
Log in

Fast generation of spherical slicing surfaces for irregular volume rendering

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

An efficient algorithm for generating a set of concentric spherical slicing surfaces for volume rendering of irregular volume datasets is presented. Our original algorithm, which approximates volume rendering by accumulating concentric spherical slicing surfaces from back to front, generates these surfaces by means of a conventional isosurface generation algorithm. However, this causes a performance bottleneck. To solve the problem, we propose a proliferous generation of slicing surfaces from seed cells, which are automatically determined according to the extremum points of the values of distances from a viewing point. A benchmark test shows that this approach can improve the performance significantly. In addition, we compare this algorithm with a raycasting algorithm that we proposed previously, and discuss a criterion for selecting which one to use for maximizing the performance

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.

Similar content being viewed by others

References

  1. Giersten C (1992) Volume visualization of sparse irregular meshes. Comput Graph Appl 12:40–48

    Google Scholar 

  2. Koyamada K (1992) Fast traverse of irregular volumes Computer Graphics International '92 Proceedings, pp 295–312

  3. Koyamada K, Uno S, Doi A, Miyazawa T (1992) Fast volume rendering by polygonal approximation. J Information Processng 15:535–544

    Google Scholar 

  4. Lucas B (1992) A scientific visualization renderer. IEEE Visualization '92, pp 227–233

  5. Sabelia P (1988) rendering algorithm for visualizing 3D scalar fields. Comput Graph 22:51–58

    Google Scholar 

  6. Shirley P, Tuchman A (1990) polygonal approximation to direct scalar volume rendering. Comput Graph 24:63–70

    Google Scholar 

  7. Speray D, Kennon S (1990) Volume probes: interactive data exploration on arbitrary grids. Comput Graph 24:5–12

    Google Scholar 

  8. Strid T, Rizzi A (1989) Development and use of some flow visualization algorithm. VKI Lecture Series of Computer Graphics and Flow Visualization on CFD

  9. Williams P (1992) Visibility ordering meshed polyhedra. ACM Trans Graph 1:103–126

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koyamada, K., Ito, T. Fast generation of spherical slicing surfaces for irregular volume rendering. The Visual Computer 11, 167–175 (1995). https://doi.org/10.1007/BF01898602

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01898602

Key words

Navigation