Skip to main content
SpringerLink
Log in

Applications of a new space partitioning technique

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1991)

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

Included in the following conference series:

Abstract

We present several applications of a recent space partitioning technique of Chazelle, Sharir and Welzl [8]. Our results include efficient algorithms for output-sensitive hidden surface removal, for ray shooting in two and three dimensions, and for constructing spanning trees with low stabbing number.

Work on this paper by the second author has been supported by Office of Naval Research Grants N00014-89-J-3042 and N00014-90-J-1284, by National Science Foundation Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development. Both authors wish to acknowledge the support of DIMACS, an NSF Science and Technology Center, under grant STC-88-09684.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.K. Agarwal, A deterministic algorithm for partitioning arrangements of lines and its applications, Proc. 5th ACM Symp. on Computational Geometry, 1989, pp. 11–22.

    Google Scholar 

  2. P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, Proc. 5th ACM Symp. on Computational Geometry, 1989, pp. 315–325.

    Google Scholar 

  3. P. K. Agarwal and M. Sharir, Applications of a new space partitioning scheme, Tech. Rept. CS-1991-14, Dept. Computer Science, Duke University, 1991.

    Google Scholar 

  4. B. Aronov and M. Sharir, On the zone of an algebraic surface in a hyperplane arrangement, Proc. 2nd Workshop on Algorithms and Data Structures, 1991.

    Google Scholar 

  5. R. Bar Yehuda and S. Fogel, Good splitters with applications to ray shooting, Proc. 2nd Canadian Conf. on Computational Geometry, 1990, pp. 81–85.

    Google Scholar 

  6. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld, Efficient ray shooting and hidden surface removal, Proc. 7th Symposium on Computational Geometry, 1991.

    Google Scholar 

  7. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir and J. Stolfi, Lines in space: Combinatorics and algorithms, Tech. Rept. 491, Dept. of Computer Science, New York University, February 1990.

    Google Scholar 

  8. B. Chazelle, M. Sharir and E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Proc. 6th ACM Symp. on Computational Geometry, 1990, pp. 23–33.

    Google Scholar 

  9. B. Chazelle and E. Welzl, Quasi-optimal range searching in spaces of finite Vapnik-Chervonenkis dimensions, Discrete Comput. Geom. 4 (1989), pp. 467–489.

    Google Scholar 

  10. S.W. Cheng and R. Janardan, Space efficient ray shooting and intersection searching: Algorithms, dynamization, and applications, in Second SIAM-ACM Symposium on Discrete Algorithms, 1991.

    Google Scholar 

  11. D. Dobkin and H. Edelsbrunner, Space searching for intersecting objects, J. Algorithms 8 (1987), pp. 348–361.

    Google Scholar 

  12. D. Dobkin and D. Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, J. of Algorithms 6 (1985), 381–392.

    Google Scholar 

  13. H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink and E. Welzl, Implicitly representing arrangements of lines and of segments, Discrete Comput. Geom. 4 (1989), pp. 433–466.

    Google Scholar 

  14. L. Guibas, M. Overmars and M. Sharir, Ray shooting, implicit point location, and related queries in arrangements of segments, Tech. Report 433, Courant Institute, New York University, 1989.

    Google Scholar 

  15. J. Matoušek, Spanning trees with low crossing numbers, to appear in Informatique Theoretique et Applications.

    Google Scholar 

  16. J. Matoušek, Cutting hyperplane arrangements, Proc. 6th ACM Symp. on Computational Geometry, 1990, pp. 1–10.

    Google Scholar 

  17. J. Matoušek, More on cutting hyperplanes and spanning trees with low crossing number, Tech. Rept., Freie Universität Berlin, 1990.

    Google Scholar 

  18. M. Overmars and M. Sharir, An improved technique for output-sensitive hidden surface removal, Tech. rept. RUU-CS-89-32, Computer Science Department, University of Utrecht, December 1989.

    Google Scholar 

  19. M. Overmars and M. Sharir, Merging visibility maps, Proc. 6th ACM Symp. on Computational Geometry, 1990, pp. 168–176.

    Google Scholar 

  20. M. Pellegrini, Stabbing and ray shooting in three-dimensional space, Proc. 6th ACM Symp. on Computational Geometry, 1990, pp. 177–186.

    Google Scholar 

  21. A. Schmitt, H. Müller and W. Leister, Ray tracing algorithms — Theory and algorithms, in Theoretical Foundations of Computer Graphics and CAD (ed. R. Earnshaw), NATO Series, Springer Verlag, 1988, pp. 997–1030.

    Google Scholar 

  22. M. Sharir and M. Overmars, A simple output-sensitive hidden surface removal algorithm, Tech. rept. RUU-CS-89-26, Computer Science Department University of Utrecht, November 1989.

    Google Scholar 

  23. D.M.H. Sommerville, Analytical Geometry in Three Dimensions, Cambridge, 1951.

    Google Scholar 

  24. J. Stolfi, Primitives for Computational Geometry, Ph.D. Dissertation, Stanford University, 1989.

    Google Scholar 

  25. E. Welzl, Partition trees for triangle counting and other range searching problems, Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 23–33.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Duke University, 27706, Durham, NC

    Pankaj K. Agarwal

  2. School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel

    Micha Sharir

  3. Courant Institute of Mathematical Sciences, New York University, 10012, New York, NY

    Micha Sharir

Authors
  1. Pankaj K. Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Micha Sharir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agarwal, P.K., Sharir, M. (1991). Applications of a new space partitioning technique. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028277

Download citation

  • DOI: https://doi.org/10.1007/BFb0028277

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54343-5

  • Online ISBN: 978-3-540-47566-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation