Skip to main content
SpringerLink
Log in

Linear size binary space partitions for fat objects

  • Session 4. Chair: Marek Karpinski
  • Conference paper
  • First Online:
Algorithms — ESA '95 (ESA 1995)

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

Included in the following conference series:

Abstract

We describe a new method for constructing binary space partitions for scenes in arbitrary dimensions. If the objects in the scene are fat (that is, they are not extremely long and skinny) then the BSP has linear size and it can be constructed in O(n log2 n) time, where n is the number of objects. In fact, the method produces a linear size BSP for a more general class of scenes, namely scenes that satisfy the bounding-box-fitness condition—a property that we suspect many realistic scenes exhibit. The method is very simple and should perform well in practice.

Supported by the Dutch Organisation for Scientific Research (N.W.O.) and by ESPRIT Basic Research Action No. 7141 (project ALCOM II: Algorithms and Complexity)

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, M. J. Katz, and M. Sharir. Computing depth orders and related problems. In Proc. 4th Scand. Workshop Algorithm Theory, volume 824 of Lecture Notes in Computer Science, pages 1–12, 1994.

    Google Scholar 

  2. C. Ballieux. Motion planning using binary space partitions. Report Inf/src/93-25, Utrecht University, 1993.

    Google Scholar 

  3. M. de Berg, M. de Groot, and M. Overmars. New results on binary space partitions in the plane. In Proc. 4th Scand. Workshop Algorithm Theory, volume 824 of Lecture Notes in Computer Science, 1994.

    Google Scholar 

  4. M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput., 23(2):437–446, 1994.

    Article  Google Scholar 

  5. N. Chin and S. Feiner. Near real time shadow generation using bsp trees. In Proc. SIGGRAPH'89, pages 99–106, 1989.

    Google Scholar 

  6. A. Efrat, M. Sharir, and G. Rote. On the union of fat wedges and separating a collection of segments by a line. Comput. Geom. Theory Appl., 3:277–288, 1994.

    Google Scholar 

  7. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14(3):124–133, 1980.

    Google Scholar 

  8. Marc van Kreveld. On fat partitioning, fat covering, and the union size of polygons. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 452–463, 1993.

    Google Scholar 

  9. J. Matousek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. SIAM J. Comput., 23:--–--, 1994.

    Google Scholar 

  10. B. Naylor, J. A. Amatodes, and W. Thibault. Merging BSP trees yields polyhedral set operations. Comput. Graph., 24(4):115–124, August 1990.

    Google Scholar 

  11. M. H. Overmars. Point location in fat subdivisions. Inform. Process. Lett., 44:261–265, 1992.

    Article  Google Scholar 

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

    Google Scholar 

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

    MathSciNet  Google Scholar 

  14. H. Samet. Applications of Spatial Data Structures. Addison Wesley, Reading, MA, 1990.

    Google Scholar 

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

    Google Scholar 

  16. F. van der Stappen. Motion Planning Amidsts Fat Obstacles. Ph. D. Thesis, Utrecht University, 1994.

    Google Scholar 

  17. S. J. Teller and C. H. Séquin. Visibility preprocessing for interactive walkthroughs. Comput. Graph., 25(4):61–69, July 1991.

    Google Scholar 

  18. W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. In Proc. SIGGRAPH'87, pages 153–162, 1987.

    Google Scholar 

  19. A. F. van der Stappen and M. H. Overmars. Motion planning amidst fat obstacles. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 31–40, 1994.

    Google Scholar 

  20. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Syst. Theory, 10:99–127, 1977.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands

    Mark de Berg

Authors
  1. Mark de Berg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Berg, M. (1995). Linear size binary space partitions for fat objects. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_148

Download citation

  • DOI: https://doi.org/10.1007/3-540-60313-1_148

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60313-9

  • Online ISBN: 978-3-540-44913-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation