Skip to main content

Binary Space Parititions in Plücker Space

  • Chapter
  • First Online:
Book cover Algorithm Engineering and Experimentation (ALENEX 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1619))

Included in the following conference series:

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Michael F. Cohen and John R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press Professional, Cambridge, Mass., 1993.

    MATH  Google Scholar 

  4. 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.

    MATH  Google Scholar 

  5. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.

    MATH  Google Scholar 

  6. 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.

    Article  Google Scholar 

  7. 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.

  8. Andrew S. Glassner, editor. An Introduction to Ray Tracing. Academic Press, San Diego, CA, 1989.

    MATH  Google Scholar 

  9. Václav Hlavatý. Differential Line Geometry. P. Noordhoff Ltd., Groningen, Holland, 1953. Translated by Harry Levy.

    MATH  Google Scholar 

  10. C. M. Jessop. A Treatise of Line Complex. Combridge, Combridge, England, 1903.

    Google Scholar 

  11. D. E. Knuth. The Art of Computer Programming. Addison Wesley, second edition, 1978.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13:99–113, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Pellegrini and P. Shor. Finding stabbing lines in 3-space. Discrete Comput. Geom., 8:191–208, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Plücker. Neue Geometrie des Raumes. Leipzig, 1868.

    Google Scholar 

  18. 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.

    Google Scholar 

  19. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  20. D. M. Y. Sommerville. Analytic Geometry of Three Dimensions. Cambridge University Press, Cambridge, England, 1934.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics