Skip to main content
SpringerLink
Log in

The 2-Center Problem in a Simple Polygon

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9472))

Included in the following conference series:

Abstract

The geodesic k-center problem in a simple polygon with n vertices consists in the following. Find k points, called centers, in the polygon to minimize the maximum geodesic distance from any point of the polygon to its closest center. In this paper, we focus on the case where \(k=2\) and present an exact algorithm that returns an optimal geodesic 2-center in \(O(n^2\log ^2 n)\) time.

This work was supported by the NRF grant 2011-0030044 (SRC-GAIA) funded by the government of Korea.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

References

  1. Ahn, H.-K., Barba, L., Bose, P., De Carufel, J.-L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. In: Arge, L., Pach, J. (eds.) 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol. 34, pp. 209–223. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2015)

    Google Scholar 

  2. Asano, T., Toussaint, G.T.: Computing geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University (1985)

    Google Scholar 

  3. Borgelt, M.G., Van Kreveld, M., Luo, J.: Geodesic disks and clustering in a simple polygon. Int. J. Comput. Geom. Appl. 21(06), 595–608 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13(3), 189–198 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chang, H.-C., Erickson, J., Xu, C.: Detecting weakly simple polygons. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1655–1670. SIAM (2015)

    Google Scholar 

  6. Chazelle, B., Matoušek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579–597 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cole, R.: Parallel merge sort. SIAM J. Comput. 17(4), 770–785 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1–4), 209–233 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hwang, R., Lee, R., Chang, R.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica 9(1), 1–22 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kim, S.K., Shin, C.-S.: Efficient algorithms for two-center problems for a convex polygon. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 299–309. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852–865 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Megiddo, N.: On the ball spanned by balls. Discrete Comput. Geom. 4(1), 605–610 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(1), 611–626 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Vigan, I.: Packing and covering a polygon with geodesic disks. Technical report, CoRR abs/1311.6033 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pohang University of Science and Technology, Pohang, Korea

    Eunjin Oh & Hee-Kap Ahn

  2. University of Ottawa, Ottawa, Canada

    Jean-Lou De Carufel

Authors
  1. Eunjin Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Lou De Carufel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hee-Kap Ahn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eunjin Oh .

Editor information

Editors and Affiliations

  1. Masdar Institute, Abu Dhabi, United Arab Emirates

    Khaled Elbassioni

  2. Kyoto University, Kyoto, Japan

    Kazuhisa Makino

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oh, E., De Carufel, JL., Ahn, HK. (2015). The 2-Center Problem in a Simple Polygon. In: Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science(), vol 9472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48971-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48971-0_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48970-3

  • Online ISBN: 978-3-662-48971-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation