Abstract
One of the important potential applications of computational geometry is in the field of computer graphics. One challenging computational problem in computer graphics is that of rendering scenes with nearly photographic realism. A major distinction in lighting and shading models in computer graphics is between local illumination models and global illumination models. Local illumination models are available with most commercial graphics software. In such a model the color of a point on an object is modeled as a function of the local surface properties of the object and its relation to a typically small number of point light sources. The other objects of scene have no effect. In contrast, in global illumination models, the color of a point is determined by considering illumination both from direct light sources as well as indirect lighting from other surfaces in the environment. In some sense, there is no longer a distinction between objects and light sources, since every surface is a potential emitter of (indirect) light. Two physical-based methods dominate the field of global illumination. They are ray tracing [8] and radiosity [3].
The support of the National Science Foundation under grant CCR-9712379 is gratefully acknowledged.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, and Jeffrey Scott Vitter. Cylindrical static and kinetic binary space partitions. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 39–48, 1997.
Pankaj K. Agarwal, T. Murali, and J. Vitter. Practical techniques for constructing binary space partitions for orthogonal rectangles. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 382–384, 1997.
Michael F. Cohen and John R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press Professional, Cambridge, Mass., 1993.
M. de Berg, M. de Groot, and M. Overmars. New results on binary space partitions in the plane. Comput. Geom. Theory Appl., 8:317–333, 1997.
H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
H. Fuchs, M. Kedem, and B. F. Naylor. On visible surface generation by a priori tree structures. Computer Graphics, 14(3):124–133, July 1980. Proc. SIGGRAPH’ 80.
Komei Fukuda and Alain Prodon. Double description method revisited. Lecture Notes in Computer Science, 1120, 1996. The URL for cdd+ package is: http://www.ifor.math.ethz.ch/ifor/staff/fukuda/cdd_home/cdd.html.
Andrew S. Glassner, editor. An Introduction to Ray Tracing. Academic Press, San Diego, CA, 1989.
Václav Hlavatý. Differential Line Geometry. P. Noordhoff Ltd., Groningen, Holland, 1953. Translated by Harry Levy.
C. M. Jessop. A Treatise of Line Complex. Combridge, Combridge, England, 1903.
D. E. Knuth. The Art of Computer Programming. Addison Wesley, second edition, 1978.
M. McKenna and J. O’Rourke. Arrangements of lines in 3-space: a data structure with applications. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 371–380, 1988.
T. S. Motzkin, H. Raiffa, G. L. Tompson, and R. M. Thrall. The double description method. In H. W. Kuhn and A. W. Tuker, editors, Contributions to theory of games, volume 2. Princeton University Press, Princeton, RI, 1953.
M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom., 5:485–503, 1990.
M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13:99–113, 1992.
M. Pellegrini and P. Shor. Finding stabbing lines in 3-space. Discrete Comput. Geom., 8:191–208, 1992.
J. Plücker. Neue Geometrie des Raumes. Leipzig, 1868.
F.-T. Pu. Data structures for global illumination computation and visibility queries in 3-space. PhD thesis, Department of Computer Science, University of Maryland, College Park, Maryland, March 1998.
H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
D. M. Y. Sommerville. Analytic Geometry of Three Dimensions. Cambridge University Press, Cambridge, England, 1934.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mount, D.M., Pu, FT. (1999). Binary Space Parititions in Plücker Space. In: Goodrich, M.T., McGeoch, C.C. (eds) Algorithm Engineering and Experimentation. ALENEX 1999. Lecture Notes in Computer Science, vol 1619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48518-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-48518-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66227-3
Online ISBN: 978-3-540-48518-6
eBook Packages: Springer Book Archive