Skip to main content
SpringerLink
Log in

Data-parallel, volumerendering algorithms

  • Original Articles
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

In this presentation, we consider the image-composition scheme for parallel volume rendering in which each processor is assigned a portion of the volume. A processor renders its data by using any existing volume-rendering algorithm. We describe one such parallel algorithm that also takes advantage of vector-processing capabilities. The resulting images from all processors are then combined (composited) in visibility order to form the final image. The major advantage of this approach is that, as viewing and shading parameters change, only 2D partial images, and not 3D volume data, are communicated among processors. Through experimental results and performance analysis, we show that our parallel algorithm is amenable to extremely efficient implementations on distributed memory, multiple instruction-multiple data (MIMD), vector-processor architectures. This algorithm is also very suitable for hardware implementation based on image composition architectures. It supports various volume-rendering algorithms, and it can be extended to provide load-balanced execution.

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

Access this article

Log in via an institution

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. Barnett M, Littlefield R, Payne DG, van de Geijn R, Global combine on mesh architectures with wormhole routing. Proceedings of the International Parallel Processing Symposium, pp 156–162

  2. Cameron GG, Underill PE (1987) Rendering volumetric medical image data on a SIMD architecture computer. SPIE Visualization in Biomedical Computing 1808:137–142

    Google Scholar 

  3. Corrie B, Mackerras P (1993) Data coherence in volume rendering algorithm. Proceedings of the 1993 Parallel Rendering Symposium, IEEE CS Press, San Jose, Calif., pp 23–26

    Google Scholar 

  4. Elvins TT (1992) Volume rendering on a distributed memory parallel computer. Proceedings of Visualization 92, Boston MA, IEEE CS Press, New York, pp 93–98

    Google Scholar 

  5. Levoy, M (1988) Display of surfaces from volume data. IEEE Comput Graph Appl 8:29–37

    Google Scholar 

  6. Lo VM, Rajopadhye S, Gupta G (1991) Mapping divide and conquer algorithms to parallel architectures. Proceedings of the International Conference on Parallel Processing 3:128–135

  7. Maa KL, Painter JS, Hansen CD, Krogh MF (1993) A data distributed, parallel algorithm for ray-trace volume rendering. Proceedings of the 1993 Parallel Rendering Symposium, San Jose, Calif., IEEE CS Press, New York, pp 15–22

    Google Scholar 

  8. Machiraju R, Yagel R (1993) Efficient feed-forward volume rendering techniques for vector and parallel processors. Proceedings of SUPERCOMPUTING '93, Portland, Ore. IEEE CS Press, New York, pp 699–708

    Google Scholar 

  9. Molnar, S, Eyles J, Poulton J (1992) Pixel low: high-speed rendering using image composition. Comput Graph 26:231–240

    Google Scholar 

  10. Montani C, Perego R, Scopigno R (1992) Parallel volume visualization on a hypercube architecture. Proceedings of 1992 Workshop on Volume Visualization, Boston, Mass., IEEE CS Press, New York, pp 9–15

    Google Scholar 

  11. Neumann U (1983) Volume reconstruction and parallel rendering algorithms: a comparative analysis. Ph. D Thesis, University of North Carolina at Chapel Hill, Chapel Hill N.C

    Google Scholar 

  12. Nieh J, Levoy M (1992) Volume rendering on scalable shared-memory MIMD architecture. Proceedings of the 1992 Workshop on Volume Visualization, Boston Mass., IEEE CS Pess, New York, pp 17–22

    Google Scholar 

  13. Porter T, Duff T (1984) Compositing digital images. Compu Graph 18:253–259

    Google Scholar 

  14. Schroder P, Salem JB (1991) Fast rotation of volume data on data parallel architecture. proceedings of Visualization '91, San Diego, Calif., pp 50–57

  15. Schroder P, Krueger W (1993) Data parallel volume rendering algorithm for interactive visualization. Visal Comput 9:405–416

    Google Scholar 

  16. Westover L (1990) Footprint evaluation for volume rendering. Compu Graphics 4:367–376

    Google Scholar 

  17. Yagel R, Cohen D, Kaufman A (1992) Normal estimation in 3D discrete space. Visual Compu 8:278–291

    Google Scholar 

  18. Yagel R (1993) Volume viewing:state of the art survey. SIGGRAPH course notes, 41:109–129

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, The Ohio State University, 2036, Neil Av., 43210, Columbus, OH, USA

    Roni Yagel & Raghu Machiraju

Authors
  1. Roni Yagel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raghu Machiraju
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yagel, R., Machiraju, R. Data-parallel, volumerendering algorithms. The Visual Computer 11, 319–338 (1995). https://doi.org/10.1007/BF01898410

Download citation

  • Issue Date:

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

Key words

Search

Navigation