Skip to main content
SpringerLink
Log in

Rectilinear Static and Dynamic Discrete 2-center Problems

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

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

Included in the following conference series:

Abstract

In this paper we consider several variants of the discrete 2-center problem. The problem is: Given a set S of n demand points and a set C of m supply points, find two “minimal” axis-parallel squares (or rectangles) centered at the points of C that cover all the points of S. We present efficient solutions for both the static and dynamic versions of the problem (i.e. points of S are allowed to be inserted or deleted) and also consider the problem in fixed d; d ≥ 3 dimensional space. For the static version in the plane we give an optimal algorithm.

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

Access this chapter

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 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. Agarwal P., Sharir M., Welzl E.: The discrete 2-center problem, Proc. 13th ACM Symp. on Computational Geometry (1997) 147–155

    Google Scholar 

  2. Agarwal P., Erickson J.: Geometric range searching and its relatives. TR CS-1997-11, Duke University (1997)

    Google Scholar 

  3. Bajaj C.: Geometric optimization and computational complexity. PhD thesis, TR 84-629, Cornell University (1984)

    Google Scholar 

  4. Bespamyatnikh S., Segal M.: Covering the set of points by boxes. Proc. 9th Canadian Conference on Computational Geometry (1997) 33–38

    Google Scholar 

  5. Cormen T,, Leiserson C., Rivest R.: Introduction to algorithms. The MIT Press (1990)

    Google Scholar 

  6. Chazelle B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Computing 17 (1988) 427–462

    Article  MathSciNet  MATH  Google Scholar 

  7. de Berg M., van Kreveld M., Overmars M., Schwartzkopf O.: Computational Geometry, Algorithms and Applications. Springer Verlag (1997)

    Google Scholar 

  8. Drezner Z.: The p-center problem: heuristic and optimal algorithms. Journal Operational Research Society 35 (1984) 741–748

    MATH  Google Scholar 

  9. Drezner Z.: On the rectangular p-center problem. Naval Research Logist. Quart. bf 34 (1987) 229–234

    Article  MathSciNet  MATH  Google Scholar 

  10. Eppstein D.: Faster construction of planar two-centers. Proc. 8th ACM-SIAM Sympos. Discrete Algorithms (1997) 131–138

    Google Scholar 

  11. Frederickson G. N., Johnson D. B.: Generalized selection and ranking: sorted matrices. SIAM J. Computing 13 (1994) 14–30

    Article  MathSciNet  Google Scholar 

  12. Glozman A., Kedem K., Shpitalnik G.: Efficient solution of the two-line center problem and other geometric problems via sorted matrices. Proc. 4th Workshop Algorithms Data Struct., Lecture Notes in Computer Science 955 (1995) 26–37

    Google Scholar 

  13. Hershberger J., Suri S.: Finding Tailored Partitions. J. Algorithms 12 (1991) 431–463

    Article  MathSciNet  MATH  Google Scholar 

  14. Jaromczyk J. W., Kowaluk M.: Orientation independent covering of point sets in R2 with pairs of rectangles or optimal squares. Proc. European Workshop on Computational Geometry. Lecture Notes in Computer Science 871 (1996) 71–78

    Google Scholar 

  15. Jaromczyk J. W., Kowaluk M.: An efficient algorithm for the euclidean two center problem. Proc. 10th ACM Symposium on Computational Geometry (1994) 303–311

    Google Scholar 

  16. Jaromczyk J. W., Kowaluk M.: The two-line center problem from a polar view: A new algorithm and data structure. Proc. 4th Workshop Algorithms Data Struct., Lecture Notes in Computer Science 955 (1995) 13–25

    Google Scholar 

  17. Katz M. J., Kedem K., Segal M.: Constrained square-center problems. In 6th Scan-dinavian Workshop on Algorithm Theory (1998) 95–106

    Google Scholar 

  18. Katz M. J., Sharir M.: An expander-based approach to geometric optimization. SIAM J. Computing 26 (1997) 1384–1408

    Article  MathSciNet  MATH  Google Scholar 

  19. Nussbaum D.: Rectilinear p-Piercing Problems. Proc. of the Intern. Symposium on Symbolic and Algebraic Computation (1997) 316–323

    Google Scholar 

  20. Segal M.: On the piercing of axis-parallel rectangles and rings. Int. Journal of Comp. Geom. and Appls., to appear

    Google Scholar 

  21. Sharir M.: A near-linear algorithm for the planar 2-center problem. Proc. 12th ACM Symp. On Computational Geometry (1996) 106–112

    Google Scholar 

  22. Sharir M., Welzl E.: Rectilinear and polygonal p-piercing and p-center problems. Proc. 12th ACM Symp. on Comput. Geometry (1996) 122–132

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of British Columbia, Vancouver, B.C, Canada, V6T 1Z4

    Sergei Bespamyatnikh

  2. Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel

    Michael Segal

Authors
  1. Sergei Bespamyatnikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Segal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bespamyatnikh, S., Segal, M. (1999). Rectilinear Static and Dynamic Discrete 2-center Problems. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation