Abstract
A novel parallel processing algorithm for image synthesis using ray tracing is presented. The scene is first organized in a hierarchical data structure which is then cut at some level. The object descriptions along with their bounding volumes are distributed accordingly among the processors of an MIMD system. There are two independent processes in, each processor: one is demand driven and used for bounding volumes calculations while the second is data driven and used for intersection calculations. This scheme, where the first process can be executed by any, processor, suggested an algorithm with an embedded load balancing mechanism. It has almost a linear speedup and its storage requirements are small. Simulation results are presented to illustrate these features.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cleary JG, Wyvill B, Birtwistle GM, Vatti R (1983) Multiprocessor ray tracing. Res Rep No 83/128/17, Univ Calgary (October 1983)
Dew PM, de Pennington A, Morris DT (1987) Programmable VLSI array architecture for solid modelling. Communicated by Rae Earnshaw at CGI '87, Karuizawa, Japan (May 1987)
Dippe M, Swansen J (1984) An adaptive subdivision algorithm and parallel architecture for realistic image synthesis. Comput Graph 18(3):149–158
Fujimoto A, Takayuki T, Iwata K (1986) ARTS: accelerated ray-tracing system. IEEE Comput Graph Appl 6(4):16–26
Glassner AS (1984) Space subdivision for fast ray tracing. IEEE Comput Graph Appl 4(10):15–22
Goldsmith J, Salmon J (1987) Automatic creation of object hierarchies for ray tracing. IEEE Comput Graph Appl 7(5):14–20
Kay TL, Kajiya JT (1986) Ray tracing complex scenes. Comput Graph 20(4):269–278
Kobayashi, H, Nakamura T, Shigei Y (1987) Parallel processing of an object space for image synthesis using ray tracing. The Visual Computer 3(1):13–22
Nemoto K, Omachi T (1986) An adaptive subdivision by sliding boundary surfaces for fast ray tracing. Proc Conf Graph Interface 1986, pp 43–48
Plunkett DJ, Bailey MJ (1985) The vectorization, of ray-tracing algorithm for, improved execution speed. IEEE Comput Graph Appl 5(8):52–60
Pulleyblank R, Kapenga J (1987) The feasibility of a VLSI chip for ray tracing bicubic patches. IEEE Comput Graph Appl 7(3):33–44
Rubin S, Whitted T (1980) A 3-dimensional representation for fast rendering of complex scenes. Comput Graph (July 1980), pp 110–116
Scherson ID, Caspary E (1987) Data structures and the time complexity of ray tracing The Visual Computer 3(4):201–213
Seits C (1985) The cosmic cube. Commun ACM 28(1):22–39
Ullner MK (1983) Parallel machines for computer graphics. PhD Thesis, California Inst Technol (January 1983)
Weghost H, Hooper G, Greenberg D (1984) Improved computational methods for ray tracing. ACM Trans Graph 3(1):52–69
Whitted T (1980) An improved illumination model for shaded display. Commun ACM 23(6):343–349
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Scherson, I.D., Caspary, E. Multiprocessing for ray tracing: a hierarchical self-balancing approach. The Visual Computer 4, 188–196 (1988). https://doi.org/10.1007/BF01887591
Issue Date:
DOI: https://doi.org/10.1007/BF01887591