Skip to main content

A Fast Pipelined Parallel Ray Casting Algorithm Using Advanced Space Leaping Method

  • Conference paper
Parallel Computing Technologies (PaCT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2763))

Included in the following conference series:

Abstract

In this paper we present a very fast pipelined parallel ray casting algorithm for volume rendering. Our algorithm is based on an extended space leaping method which minimizes the traversal of data and image space by using run-length encoding and line drawing algorithms. We propose a more advanced space leaping method which allows the efficient implementation of parallel forward projection by merging the run-lengths for the line drawing. We shall show that the whole algorithm is sharply speed up by reducing the time taken to project the run-lengths onto the image screen, and by exploiting the pipelined parallelism in our space leaping method. Also, we shall show the experimental result of the parallel ray casting algorithm implemented on our Computational Grid portal environment.

This work has been supported by KIPA-Information Technology Research Center, University research program by Ministry of Information & Communication, and Brain Korea 21 projects in 2003

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.

References

  1. Danskin, J., Hanrahan, P.: Fast algorithms for volume ray tracing, 1992 workshop on Volume Visualization, Boston, MA, pp. 91–98 (1992)

    Google Scholar 

  2. Yagel, R., Cohen, D., Kaufman, A., Zhang, Q.: Volumetric Ray Tracing, TR 91. 01. 09, Computer Science, SUNY at Stony Brook (January 1991)

    Google Scholar 

  3. Yagel, R., Shi, Z.: Accelerating Volume Animation by Space-Leaping, Visualization 1993, pp. 63–69 (1993)

    Google Scholar 

  4. Jo, S.-U., Jeong, C.-S.: A Parallel Volume Visualization Using Extended Space Leaping Method. In: Sørevik, T., Manne, F., Moe, R., Gebremedhin, A.H. (eds.) PARA 2000. LNCS, vol. 1947, p. 296. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Kim, H., Jo, S.-U., et al.: Fast Parallel Algorithm for Volume Rendering and its Experiment on Computational Grid. In: ICCS 2003 (June 2003)

    Google Scholar 

  6. Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International J. Supercomputer Applications 15(3) (2001)

    Google Scholar 

  7. Novotny, J.: The Grid Portal Development Kit. Concurrency: Pract. Exper. 00, 1–7 (2000)

    Google Scholar 

  8. von Laszewski, G.: A Java Commodity grid kit. Concurrency: Pract. Exper. 13, 645–662 (2001)

    Article  MATH  Google Scholar 

  9. Myproxy, http://dast.nlanr.net/Projects/MyProxy

  10. Steven, P., Michael, P., Yarden, L., Peter-Pike, S., Charles, H.: Interactive Ray Tracing for Volume Visualization. IEEE Trans. on Visualization and Computer Graphics 5(3), 238–250 (1999)

    Article  Google Scholar 

  11. MPICH-G2, http://www.hpclab.niu.edu/mpi/g2_body.html

  12. Danskin, J., Bender, R., Herman, G.T.: Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. J. Theoretical Biology 29, 471–482 (1970)

    Article  Google Scholar 

  13. Yagel, R., Cohen, D., Kaufman, A., Zhang, Q.: Volumetric Ray Tracing, TR 91. 01. 09, Computer Science, SUNY at Stony Brook (January 1991)

    Google Scholar 

  14. Goel, V., Mukherjee, A.: An Optimal Parallel Algorithm for Volume Ray Casting. Visual Comput 12, 26–39 (1996)

    Google Scholar 

  15. Kose, C., Chalmers, A.: Profiling for efficient parallel volume visualization. Parallel Computing 23, 943–952 (1997)

    Article  Google Scholar 

  16. Levoy, M.: A hybrid ray tracer for rendering polygon and volume data. IEEE Computer Graphics & Application 10(2), 33–40 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, HJ., Woo, YJ., Kwon, YW., Ryu, SH., Jeong, CS. (2003). A Fast Pipelined Parallel Ray Casting Algorithm Using Advanced Space Leaping Method. In: Malyshkin, V.E. (eds) Parallel Computing Technologies. PaCT 2003. Lecture Notes in Computer Science, vol 2763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45145-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45145-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40673-0

  • Online ISBN: 978-3-540-45145-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics