Skip to main content

Optimized Maximum Intensity Projection (MIP)

  • Conference paper
  • First Online:
Rendering Techniques ’95 (EGSR 1995)

Part of the book series: Eurographics ((EUROGRAPH))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Cleary, J., Wyvill, G.: Analysis of an Algorithm for Fast Ray-Tracing Using Uniform Space Subdivision, “The Visual Computer”, Vol. 4, pp. 65–83, 1988

    Article  Google Scholar 

  2. 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 1994

    Article  Google Scholar 

  3. Roufchaie, V. (Edt.): Power Series Perormance Guide, Technical Report Power Series, Silicon Graphics, 1991

    Google Scholar 

  4. 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, 1992

    Google Scholar 

  5. Sakas, G.: Interactive Volume Rendering of Large Fields, “The Visual Computer”, Vol. 9, No. 8, pp. 425–438, August 1993

    Article  Google Scholar 

  6. Slater, M.: Tracing a Ray Through Uniformly Subdivided n-Dimensional Space, “The Visual Computer”, Vol. 9, pp. 39–46, 1992

    Article  Google Scholar 

  7. 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 1991

    Google Scholar 

  8. Yagel, R., Cohen, D., Kaufman, A.: Discrete Ray Tracing, IEEE Computer Graphics & Applications, September 1992

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Sakas, G., Grimm, M., Savopoulos, A. (1995). Optimized Maximum Intensity Projection (MIP). In: Hanrahan, P.M., Purgathofer, W. (eds) Rendering Techniques ’95. EGSR 1995. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9430-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-9430-0_6

  • Published:

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82733-8

  • Online ISBN: 978-3-7091-9430-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics