Advertisement

Data structures for ray tracing

  • Frederik W. Jansen
Part of the EurographicSeminars book series (FOCUS COMPUTER)

Abstract

Methods to improve the efficiency of the ray tracing process are reviewed. Special attention is given to algorithms for tracing a ray through box and cell structures of hierarchical box and spatial subdivision methods.

Keywords

Tree Traversal IEEE Computer Graphic Composite Node Item Buffer Hide Surface 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Whitted, T., An improved illumination model for shaded display, Communications of the ACM 23(1980)6, 343–349.CrossRefGoogle Scholar
  2. [2]
    Appel, A.A., Some techniques for shading machine renderings of solids, SJCC 1968, AFIPS Conf. Proc. Vol. 32(1968), 37–45.Google Scholar
  3. [3]
    Cook, R.L., Porter, T., Carpenter, L., Distributed ray tracing, Computer Graphics 18(1984)3, 137–145. Siggraph84.CrossRefGoogle Scholar
  4. [4]
    Sutherland, I.E., Sproull, R.F., Schumacker, R.A., A characterization of ten hidden-surface algorithms, ACM Computing Surveys 6(1974)1, 1–55.zbMATHCrossRefGoogle Scholar
  5. [5]
    Potmesil, M. Generating three-dimensional surface models of solid objects from multiple projections. IPL-TR-033, Image Processing Lab. Rensselaer Polytechnic Institute, New York, Oct 1982.Google Scholar
  6. [6]
    Kajiya, J.T., Ray tracing parametric patches, Computer Graphics 16(1982)3, 245–254, Siggraph82.CrossRefGoogle Scholar
  7. [7]
    Kajiya, J.T., New techniques for ray tracing procedurally defined objects, Computer Graphics 17(1983)3, 91–102, Siggraph83.CrossRefGoogle Scholar
  8. [8]
    van Wijk, J.J., Ray tracing objects defined by sweeping cubic splines, to appear in ACM Transactions on Graphics.Google Scholar
  9. [9]
    van Wijk, J.J., Ray tracing objects defined by sweeping a sphere, in: K. Bo and H.A. Tucker (eds), proc. Eurographics 84, 73–82.Google Scholar
  10. [10]
    Goldstein, E., Nagel, JR., 3D visual simulation, Simulation 16(1971)1, 25–31.CrossRefGoogle Scholar
  11. [11]
    Roth, S.D., Ray casting for modeling solids, Computer Graphics and Image Processing 18(1982)2, 109–144.CrossRefGoogle Scholar
  12. [12]
    Atherton, P.R., A scanline hidden surface removal procedure for constructive solid geometry, Computer Graphics 17(1983)3, 73–82, Siggraph83.CrossRefGoogle Scholar
  13. [13]
    Okino, N., Kakazu, Y., Morimoto, M., Extended depth-buffer algorithms for hidden surface visualization, IEEE Computer Graphics and Applications 4(1984)5, 79–88.CrossRefGoogle Scholar
  14. [14]
    Jansen, F.W., A CSG list priority hidden surface algorithm, to appear in proc. Eurographics85.Google Scholar
  15. [15]
    Lee, Y.T., Requicha, A.A.G.,”Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and cellular approximation. Comm. of the ACM 25(1982) 9, 642–650.MathSciNetCrossRefGoogle Scholar
  16. [16]
    Whitted, T., Weimer, D.M., A software test-bed for the development of 3-D raster graphics systems, Computer Graphics 15(1981)3, 271–277, Siggraph81.CrossRefGoogle Scholar
  17. [17]
    Jansen, F.W., Wijk, J.J. van, Previewing techniques in raster graphics, Computers and Graphics 8(1984)2, 149–161.CrossRefGoogle Scholar
  18. [18]
    Bronsvoort, W.F., Wijk, J.J. van, Jansen, F.W., Two methods for improving the efficiency of ray casting in solid modelling, CAD 16(1984)1, 51–55.Google Scholar
  19. [19]
    Weghorst, H., Hooper, G., Greenberg, D.P., Improved computational methods for ray tracing, ACM Transactions on Graphics 3(1984)1, 52–69.CrossRefGoogle Scholar
  20. [20]
    Clark, J.H., Hierarchical geometric models for visible surface algorithms, Communications of the ACM 19(1976)10, 547–554.zbMATHCrossRefGoogle Scholar
  21. [21]
    Rubin, S.M., Whitted, T., A 3-dimensional representation for fast rendering of complex scenes, Computer Graphics 14(1980)3, 110–116. Siggraph80.CrossRefGoogle Scholar
  22. [22]
    Brooks, J. et al., An extension of the combinatorial geometry techniques for modeling vegetation and terrain features. MAGI Inc. NTIS AD-782–883. June 1974.Google Scholar
  23. [23]
    Sears, K.H., Middletich, A.E., Settheoretic volume model evaluation and picture-plane coherence. IEEE Computer graphics and Applications 4(1984)3, 41–46.CrossRefGoogle Scholar
  24. [24]
    Woodwark, J.R., Quinlan, K.M., Reducing the effect of complexity on volume model evaluation, CAD 14(1982)2, 89–95.Google Scholar
  25. [25]
    Tamminen, M., The EXCELL method for efficient geometric access to data, Thesis, Acta Polytechnica Scandinavica, Mathematics and Computer Science Series no.34, Helsinki, 1981.Google Scholar
  26. [26]
    Mantyla, M., Tamminen, M., Localized set operations for solid modeling, Computer Graphics 17(1983)3, 279–288, Siggraph83.CrossRefGoogle Scholar
  27. [27]
    Tamminen, M., Karonen, O., Mantyla, M., Ray-casting and block model conversion using a spatial index, CAD 16(1984)4, 203–208.Google Scholar
  28. [28]
    Glassner, A.S., Space subdivision for fast ray tracing, IEEE Computer Graphics and Applications 4(1984)10, 15–22.Google Scholar
  29. [29]
    Dippe, M., Swensen, J., An adaptive subdivision algorithm and parallel architecture for realistic image synthesis, Computer Graphics 18(1984)3, 149–158, Siggraph84.CrossRefGoogle Scholar

Copyright information

© EUROGRAPHICS The European Association for Computer Graphics 1986

Authors and Affiliations

  • Frederik W. Jansen
    • 1
  1. 1.Dept. of Industrial DesignDelft University of TechnologyDelftThe Netherlands

Personalised recommendations