Vectorization of visualization algorithms — A practical example

  • A. Spalt
  • S. Grabner
  • J. Volkert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1127)


In scientific visualization, interactive image generation times are needed. Yet typical algorithms are computationally expensive, e.g. image generation algorithms for volume rendering, which is an important and widely used technique. Since vector computers are still among the most powerful machines available, we propose a vectorized variant of a volume rendering algorithm. Vectorization has a long research tradition. Many of the obstacles encountered in transforming loops of sequential programs into vector operations can be handled automatically by state of the art compilers. However, experiences in the course of our work revealed that there are still some shortcomings. It turned out that even for relatively simple optimization transformations it can be necessary to resort to assembler level programming. This is exemplified by a detailed analysis of the proposed algorithm. Results of the final implementation on a mini supercomputer conclude the presentation.

Key Words

Vectorization Volume Rendering Parallel Algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Drebin R.A., L. Carpenter, P. Hanrahan: Volume Rendering, Computer Graphics, Vol. 22, No. 4, Aug. 1988, 65–74Google Scholar
  2. 2.
    Upson C., M. Keeler: V-BUFFER: Visible Volume Rendering, Computer Graphics, Vol. 22, No. 4, Aug. 1988, 59–64Google Scholar
  3. 3.
    Krueger W.: Volume Rendering and Data Feature Enhancement, ACM Computer Graphics, Vol. 24, No. 5, Nov. 1990, 21–26, 107–108Google Scholar
  4. 4.
    Porter T., T. Duff: Compositing Digital Images, Computer Graphics, Vol. 18, No. 3, July 1984, 253–259Google Scholar
  5. 5.
    Levoy M.: Display of Surfaces from Volume Data, IEEE CG&A, Vol. 8, No. 3, March 1988, 29–37Google Scholar
  6. 6.
    Westover L.: Interactive Volume Rendering, Proceedings of the Chapel Hill Workshop on Volume Visualization, Chapel Hill, NC, ACM, May 1989, 9–16Google Scholar
  7. 7.
    Vezina G., Fletcher P.A., Robertson R.K.: Volume Rendering on the MasPar MP-1, [18], 3–8Google Scholar
  8. 8.
    Schröder P., G. Stoll: Data Parallel Volume Rendering as Line Drawing, [18], 25–32Google Scholar
  9. 9.
    Wittenbrink C. M., Somani A. K.: 2D and 3D Optimal Parallel Image Warping, Journal of Parallel and Distributed Computing, 25, 197–208, 1995Google Scholar
  10. 10.
    Stredney D., R. Yagel, S.F. May, M. Torello: Supercomputer Assisted Brain Visualization with an Extended Ray Tracer, [18], 33–38Google Scholar
  11. 11.
    R.K. Machiraju, R. Yagel: Efficient Feed-Forward Volume Rendering Techniques for Vector and Parallel Processors, Proceedings Supercomputing '93, ACM, 1993, pp. 699–708Google Scholar
  12. 12.
    Spalt A.: A Vectorized Algorithm for Volume Rendering, Proceedings “COMPU-GRAPHICS '93”, ACM Portugal, 1993, 154–163Google Scholar
  13. 13.
    Patterson D.A., Hennessy, J.L.: Computer Architecture: A Quantitative Approach, Morgan Kaufman Publishers, 1990Google Scholar
  14. 14.
    CONVEX SCIlib User's Guide, CONVEX Computer Corp., 1993Google Scholar
  15. 15.
    CONVEX VECLIB User's Guide, CONVEX Computer Corp., 1993Google Scholar
  16. 16.
    Weiss Sh.: Optimizing a Superscalar Machine to Run Vector Code, IEEE Parallel & Distributed Technology, Vol. 1, No.2, May 1993, 73–83Google Scholar
  17. 17.
    CONVEX Theory of Operation (C3400 Series), CONVEX Computer Corp., 1993Google Scholar
  18. 18.
    Proc. 1992 Workshop on Volume Visualization, Boston, ACM, Oct. 1992Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • A. Spalt
    • 1
  • S. Grabner
    • 1
  • J. Volkert
    • 1
  1. 1.Computer Graphics and Parallel ProcessingUniversity of LinzAustria/Europe

Personalised recommendations