Optimized Maximum Intensity Projection (MIP)

  • Georgios Sakas
  • Marcus Grimm
  • Alexandros Savopoulos
Part of the Eurographics book series (EUROGRAPH)


We present an improved version of the MIP algorithm that requires roughly 2%–10% of the computational effort of the brute-force, straight-forward version. The algorithm conserves the image quality and requires no pre-processing. We propose four different quality levels: a fast line-traversing nearest neighbour algorithm for previewing, two efficient approximation algorithms that are sufficient for most applications, and an analytical method for images of highest quality. Additionally we present an improved cache memory access scheme. The employed ’sub-cube’ volume data representation provides an additional speed up of at least 50% compared to the classical linear memory access. This is of particular interest for (but not restricted to) parallel volume rendering on shared memory multiprocessor systems.


Maximum Intensity Projection Cache Coherency Trilinear Interpolation Voxel Boundary Phantom Volume 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ClWy88.
    Cleary, J., Wyvill, G.: Analysis of an Algorithm for Fast Ray-Tracing Using Uniform Space Subdivision, “The Visual Computer”, Vol. 4, pp. 65–83, 1988CrossRefGoogle Scholar
  2. EnSo94.
    Endl, R., Sommer, M.: Classification of Ray-Generators in Uniform Subdivisions and Octrees for Ray Tracing, Computer Graphics Forum, Vol. 13, No. 1, pp. 3–19, March 1994CrossRefGoogle Scholar
  3. Rouf91.
    Roufchaie, V. (Edt.): Power Series Perormance Guide, Technical Report Power Series, Silicon Graphics, 1991Google Scholar
  4. SaGe91b.
    Sakas, G., Gerth, M.: Sampling and Anti-Aliasing Discrete 3D Volume Density Textures, EUROGRAPHICS’91 Award Paper, Computer and Graphics, Vol. 16, No. 1, pp. 121–134, Pergamon Press, 1992Google Scholar
  5. Saka93d.
    Sakas, G.: Interactive Volume Rendering of Large Fields, “The Visual Computer”, Vol. 9, No. 8, pp. 425–438, August 1993CrossRefGoogle Scholar
  6. Slat92.
    Slater, M.: Tracing a Ray Through Uniformly Subdivided n-Dimensional Space, “The Visual Computer”, Vol. 9, pp. 39–46, 1992CrossRefGoogle Scholar
  7. Vand91.
    Vandermeulen, D.: Methods for Registration, Interpolation and Inter-pretation of 3D Medical Image Data for use in 3-D Display, 3-D Modeling and Therapy Planning, Ph. D. Thesis, Katholieke Universiteit Leuven, Faculteit Toegepaste Wetenschappen, ESAT/MI2, U.D.C. 681. 3 14: 616–089, April 1991Google Scholar
  8. YaCK92.
    Yagel, R., Cohen, D., Kaufman, A.: Discrete Ray Tracing, IEEE Computer Graphics & Applications, September 1992Google Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • Georgios Sakas
    • 1
  • Marcus Grimm
    • 1
  • Alexandros Savopoulos
    • 1
  1. 1.Fraunhofer Institute for Computer GraphicsDarmstadtGermany

Personalised recommendations