Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2003: Algorithms - ESA 2003 pp 494–505Cite as

Binary Space Partition for Orthogonal Fat Rectangles

  • Conference paper

  • 1892 Accesses

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

Abstract

We generate a binary space partition (BSP) of size O(n log8 n) and depth O(n log4 n) for n orthogonal fat rectangles in three-space, improving earlier bounds of Agarwal et al. We also give a lower bound construction showing that the size of an orthogonal BSP for these objects is Ω(n log n) in the worst case.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Grove, E.F., Murali, T.M., Vitter, J.S.: Binary space partitions for fat rectangles. SIAM J. Comput. 29, 1422–1448 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica 28(3), 353–366 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Berg, M., de Groot, M., Overmars, M.: New results on binary space partitions in the plane. Comput. Geom. Theory Appl. 8, 317–333 (1997)

    MATH  Google Scholar 

  4. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)

    MATH  Google Scholar 

  5. Dumitrescu, A., Mitchell, J.S.B., Sharir, M.: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. In: Proc. 17th ACM Symp. on Comput. Geom., Medford, MA, pp. 141–150. ACM Press, New York (2001)

    Google Scholar 

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

    Article  Google Scholar 

  7. Paterson, M.S., Yao, F.F.: Efficient binary space partitions for hiddensurface removal and solid modeling. Discrete Comput. Geom. 5, 485–503 (1990)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Schumacker, R.A., Brand, R., Gilliland, M., Sharp, W.: Study for applying computer-generated images to visual simulation. Tech. Rep. AFHRL– TR–69–14, U.S. Air Force Human Resources Laboratory (1969)

    Google Scholar 

  10. Tóth, C.D.: Binary space partition for line segments with a limited number of directions. SIAM J. Comput. 32(2), 307–325 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Tóth, G.: Point sets with many k-sets. Discrete Comput. Geom. 26(2), 187–194 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Santa Barbara, CA, 93106, USA

    Csaba D. Tóth

Authors
  1. Csaba D. Tóth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università degli Studi “Roma Tre”, via della Vasca Navale 79, 00146, Rome, Italy

    Giuseppe Di Battista

  2. School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Uri Zwick

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tóth, C.D. (2003). Binary Space Partition for Orthogonal Fat Rectangles. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39658-1_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20064-2

  • Online ISBN: 978-3-540-39658-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation