Abstract
Breadth-first ray tracing for realistic image synthesis differs from usual pixel-by-pixel rendering in tracing whole generations of rays together. This means that first all rays of view are treated, next the set of reflection and refraction rays, then the reflection and refraction rays caused by them, and so on. The calculation of intersections for a generation of rays uses the ray-z-buffer algorithm. Like the original z-buffer algorithm, the ray-z-buffer algorithm allows to render scenes with an unlimited number of primitives within a working space dependent only on the resolution of the picture. A distributed implementation of breadth-first raytracing in a network of workstations is presented and analyzed.
supported by Deutsche Forschungsgemeinschaft (DFG), Mu 744/1
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apollo Computer, Inc., 1987, Network Computing System (NCS) Reference, Order No. 010200 Rev. 00, 330 Billerica Road, Chelmsford, MA 01824
Birrell, A.D., B. J. Nelson, 1984, Implementing Remote Procedure Calls, ACM TOCS, 2, 39–59
Borodin, A., J. E. Hopcroft, 1985, Routing, Merging and Sorting on Parallel Models of Computation, J. of Computer and System Science 30, 130–145
Chazelle, B., 1985, Fast Searching in a Real Algebraic Manifold with Application to Geometric Complexity, Proceedings CAAP'85, 145–156
Dobkin, P.D., H. Edelsbrunner, 1984, Space Searching for Intersecting Objects, Proceedings 25th IEEE FOCS, 387–391
Eager, D.L., E. D. Lazowska, J. Zahorjan, 1988, The Limited Performance Benefits of Migrating Active Processes for Load Sharing, Proc. of the 1988 ACM SIGMETRICS Conference, Measurement and Modeling of Computer Systems, 63–72
Edelsbrunner, H., E. Welzl, 1986, Halfplanar Range Search in linear Space and O(n .695) Query Time, Information Processing Letters 23, 289–293
Glassner, A., 1989, An Introduction to Ray Tracing, Academic Press, San Diego, CA
Haussler, D., E. Welzl, 1986, Epsilon-Nets and Simplex Range Queries, Proceedings 2nd ACM Symposium on Computational Geometry, 61–71
Kleinrock, L., 1975, Queueing Systems, Vol. I: Theory, John Wiley, New York
Lamparter, B., H. Müller, J. Winckler, 1990, The Ray-z-Buffer — An Approach for Ray Tracing Arbitrarily Large Scenes, Research Report, Institut für Informatik, Universität Freiburg
Leister, W., H. Müller, A. Stößer, B. Neidecker, 1988, ”Occursus cum novo” — Computer Animation by Raytracing in a Network, New Trends in Computer Graphics, Springer-Verlag, Berlin, 83–92
Müller, H., 1988, Realistische Computergraphik — Algorithmen, Datenstukturen und Maschinen, Informatik-Fachberichte, 163, Springer-Verlag, Berlin
Müller, H., 1989, Paralleles Ray-Tracing mit günstigem Prozessor/Speicher/Zeit-Trade-Off, CAD und Computergraphik 12(5), 161–170
Overmars, M.H., 1983, The Design of Dynamic Data Structures, Springer-Verlag, Berlin
Peterson, J.W., 1987, Distributed Computation for Computer Animation, Proceedings USENIX87, 24–36
Samet, H., 1990, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, Mass.
Schmitt, A., H. Müller, W. Leister, 1988, Ray Tracing Algorithms — Theory and Practice, in: Theoretical Foundations of Computer Graphics and CAD, NATO ASI Series, Vol. 40, Springer-Verlag, Berlin, 997–1030
Stroustrup, B., 1986, The C++ Programming Language, Addison-Wesley Reading, Mass.
SUN Microsystems, Inc., Mountain View, CA., 1990, Network Programming Guide
Wang, Y.-T., R. J. T. Morris, 1985, Load Sharing in Distributed Systems, IEEE Transactions on Computers C-34, 204–217.
Welzl, E., 1988, Partition Trees for Triangle Counting and Other Range Search Problems, Proceedings 4th ACM Symposium on Computational Geometry, 23–33
Willard, D.E., 1982, Polygon Retrieval, SIAM J. on Comput. 11, 149–165
Yao, A.C., 1982, Space-Time-Tradeoff for Answering Range Queries, Proceedings 14th ACM STOC, 128–135
Yao, A.C., F.F. Yao, 1985, A General Approach to d-dimensional Geometric Queries, Proceedings 17th ACM STOC, 163–168
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Müller, H., Winckler, J. (1992). Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer. In: Monien, B., Ottmann, T. (eds) Data structures and efficient algorithms. Lecture Notes in Computer Science, vol 594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_25
Download citation
DOI: https://doi.org/10.1007/3-540-55488-2_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55488-2
Online ISBN: 978-3-540-47103-5
eBook Packages: Springer Book Archive