Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Ray-driven dynamic working set rendering

For complex volume scene graphs involving large point clouds

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

Abstract

Ray tracing a volume scene graph composed of multiple point-based volume objects (PBVO) can produce high quality images with effects such as shadows and constructive operations. A naive approach, however, would demand an overwhelming amount of memory to accommodate all point datasets and their associated control structures such as octrees. This paper describes an out-of-core approach for rendering such a scene graph in a scalable manner. In order to address the difficulty in pre-determining the order of data caching, we introduce a technique based on a dynamic, in-core working set. We present a ray-driven algorithm for predicting the working set automatically. This allows both the data and the control structures required for ray tracing to be dynamically pre-fetched according to access patterns determined based on captured knowledge of ray-data intersection. We have conducted a series of experiments on the scalability of the technique using working sets and datasets of different sizes. With the aid of both qualitative and quantitative analysis, we demonstrate that this approach allows the rendering of multiple large PBVOs in a volume scene graph to be performed on desktop computers.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Silva, C.: Point set surfaces. In: Proceedings of IEEE Visualization, pp. 29–36 (2001)

  2. Bentley, J.: Multidimensional binary trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)

    Article  MathSciNet  Google Scholar 

  3. Blinn, J.: A generalized algebraic surface drawing. ACM Trans. Graph. 1(3), 235–256 (1982)

    Article  Google Scholar 

  4. Bloomenthal, J.: Polygonization of implicit surfaces. Comput. Aided Geom. Des. 5(4), 341–355 (1988)

    Article  MathSciNet  Google Scholar 

  5. Chen, M.: Combining point clouds and volume objects in volume scene graphs. In: Proceedings of Volume Graphics, New York, pp. 127–135 (2005)

  6. Chen, M., Tucker, J.: Constructive volume geometry. Comput. Graph. Forum 19(4), 281–293 (2000)

    Article  Google Scholar 

  7. Chiang, Y.J., Farias, R., Silva, C.T., Wei, B.: A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids. In: Proceedings of IEEE Symposium on Parallel and Visualization and Graphics, pp. 59–66 (2003)

  8. Chiang, Y.J., Silva, C.T.: I/O optimal isosurface extraction. In: Proceedings of IEEE Visualization ’97, pp. 293–300 (1997)

  9. Chiang, Y.J., Silva, C.T.: Interactive isosurface extraction. In: Proceedings of IEEE Visualization ’98, pp. 167–174 (1998)

  10. Cignoni, P., Montani, C., Puppo, E., Scopigno, R.: Optimal isosurface extraction from irregular volume data. In: Proceedings of IEEE Symposium on Volume Visualization, pp. 31–38 (1996)

  11. Crawfis, R., Max, N.: Texture splats for 3D scalar and vector field visualization. In: Proceedings of IEEE Visualization, pp. 261–266 (1993)

  12. Denning, P.J.: The working set model for program behavior. Commun. ACM 11(5), 323–333 (1968)

    Article  MathSciNet  Google Scholar 

  13. Farias, R., Silva, C.T.: Out-of-core rendering of large, unstructured grids. IEEE Comput. Graph. Appl. 21(4), 42–50 (2001)

    Article  Google Scholar 

  14. Gross, M.: The utility of points as primitives for visualization. In: Keynote Speech in IEEE Visualization (2005)

  15. Grossman, J.P., Dally, W.J.: Point sample rendering. In: Proceedings of Eurographics Workshop on Rendering, pp. 181–192 (1998)

  16. Hua, J., Qin, H.: Haptics-based dynamic implicit solid modeling. IEEE Trans. Visual. Comput. Graph. 10(5), 574–586 (2004)

    Article  Google Scholar 

  17. Kalra, D., Barr, A.: Guaranteed ray intersections with implicit surfaces. Comput. Graph. (Proc. SIGGRAPH ’89) 23(3), 297–306 (1989)

    Article  Google Scholar 

  18. Kure, T., Çatalyürek, Ü., Chang, C., Sussman, A., Saltz, J.: Visualization of large data sets with the active data repository. IEEE Comput. Graph. Appl. 21(4), 24–33 (2001)

    Article  Google Scholar 

  19. Leutenegger, P., Ma, K.L.: R-tree retrieval of unstructured volume data for visualization. In: J.M. Abello, J.S. Vitter (eds.) External Memory Algorithms, vol. 50, DIMACS Book Series. American Mathematical Society, Providence, RI (1999)

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

    Article  Google Scholar 

  21. Lindstrom, P.: Out-of-core simplification of large polygonal models. In: Proceedings of ACM SIGGRAPH 2000, pp. 259–262 (2000)

  22. Lindstrom, P., Pascucci, V.: Terrain simplification simplified: A general framework for view-dependent out-of-core visualization. IEEE Trans. Visual. Comput. Graph. 8(3), 239–254 (2002)

    Article  Google Scholar 

  23. Livnat, Y., Tricoche, X.: Interactive point-based isosurface extraction. In: Proceedings of IEEE Visualization, pp. 457–464 (2004)

  24. Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3D surface con-struction algorithm. Comput. Graph. (Proc. SIGGRAPH ’87) 21(4), 163–169 (1987)

    Article  Google Scholar 

  25. Mueller, K., Yagel, R.: Fast perspective volume rendering with splatting by using a ray-driven approach. In: Proceedings of Visualization ’96, pp. 65–72 (1996)

  26. Nielson, G.M.: Scattered data modeling. IEEE Comput. Graph. Appl. 13(1), 60–70 (1993)

    Article  MathSciNet  Google Scholar 

  27. Nishimura, H., Hirai, A., Kawai, T., Shirakawa, I., Omura, K.: Object modeling by distribution function and a method of image generation. Comput. Graph. (Journal of Papers given at the Electronics Communication Conference ’85, in Japanese) J68-D(4) (1985)

  28. Pfister, H., Zwicker, M., van Baar, J., Gross, M.: Surfels: surface elements as rendering primitives. In: Computer Graphics (Proc. SIGGRAPH 2000), pp. 335–342 (2000)

  29. Pharr, M., Kolb, C., Gershbein, R., Hanrahan, P.: Rendering complex scenes with memory-coherent ray tracing. In: Computer Graphics (Proc. SIGGRAPH ’97), pp. 101–108 (1997)

  30. Rusinkiewicz, S., Levoy, M.: QSplat: a multiresolution point rendering system for large meshes. In: Computer Graphics (Proc. SIGGRAPH 2000), pp. 343–252 (2000)

  31. Schaufler, G., Jensen, H.W.: Ray tracing point sampled geometry. In: Proceedings of Eurographics Workshop on Rendering Techniques, pp. 319–328 (2000)

  32. Shen, H.W., Chiang, L.J., Ma, K.L.: A fast volume rendering algorithm for time-varying fields using a time-space partitioning (tsp) tree. In: Proceedings of IEEE Visualization ’99, pp. 371–378 (1999)

  33. Stamminger, M., Drettakis, G.: Interactive sampling and rendering for complex and procedural geometry. In: Proceedings of Eurographics Workshop on Rendering Techniques, pp. 151–162 (2001)

  34. Sutton, P.M., Hansen, C.D.: Accelerated isosurface extraction in time-varying fields. IEEE Trans. Visual. Comput. Graph. 6(2), 98–107 (2000)

    Article  Google Scholar 

  35. Teller, S., Fowler, C., Funkhouse, T., Hanrahan, P.: Partitioning and ordering large radiosity computations. In: Computer Graphics (Proc. SIGGRAPH ’94), pp. 443–450 (1994)

  36. Ueng, S.K., Sikorski, C., Ma, K.L.: Out-of-core streamline visualization on large unstructured meshes. IEEE Trans. Visual. Comput. Graph. 3(4), 370–380 (1997)

    Article  Google Scholar 

  37. Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Comput. Survey 33(2), 209–271 (2001)

    Article  Google Scholar 

  38. von Rymon-Lipinski, B., Hanssen, N., Jansen, T., Ritter, L., Keeve, E.: Efficient point-based isosurface exploration using the span-triangle. In: Proceedings of IEEE Visualization, pp. 441–448 (2004)

  39. Wald, I., Friedrich, H., Marmitt, G., Slusallek, P., Seidel, H.P.: Faster isosurface ray tracing using implicit kd-trees. IEEE Trans. Visual. Comput. Graph. 11(5), 562–572 (2005)

    Article  Google Scholar 

  40. Wald, I., Seidel, H.P.: Interactive ray tracing of point based models. In: Proceedings of Symposium on Point-based Graphics, pp. 9–16 (2005)

  41. Westover, L.: Footprint evaluation for volume rendering. Comput. Graph. (Proc. SIGGRAPH ’90) 24(4), 367–376 (1990)

    Article  Google Scholar 

  42. Wyvill, G., McPheeters, C., Wyvill, B.: Data structures for soft objects. Vis. Comput. 2(4), 227–234 (1986)

    Article  Google Scholar 

  43. Zwicker, M., Pfister, H., Baar, J., Gross, M.: EWA volume splatting. In: Proceedings of IEEE Visualization, pp. 29–36 (2001)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wales Swansea, Swansea, SA2 8PP, UK

    David Chisnall & Min Chen

  2. School of Computing, University of Utah, Salt Lake City, UT, 84112, USA

    Charles Hansen

Authors
  1. David Chisnall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Charles Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Chisnall.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chisnall, D., Chen, M. & Hansen, C. Ray-driven dynamic working set rendering. Visual Comput 23, 167–179 (2007). https://doi.org/10.1007/s00371-006-0091-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-006-0091-6

Keywords

Search

Navigation