Skip to main content
SpringerLink
Log in

Efficient Algorithms for Two-Center Problems for a Convex Polygon

Extended Abstract

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 2000)

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

Included in the following conference series:

Abstract

Let P be a convex polygon with n vertices. We want to find two congruent disks whose union covers P and whose radius is minimized. We also consider its discrete version with centers restricted to be at vertices of P. Standard and discrete two-center problems are respectively solved in O(n log3 n log log n) and O(n log2 n) time. Furthermore, we can solve both of the standard and discrete two-center problems for a set of points in convex positions in O(nlog2 n) time.

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. P. K. Agarwal and M. Sharir and E. Welzl, The discrete 2-center problem, Proc. 13th Ann. ACM Symp. Comput. Geom., pp. 147–155, 1997.

    Google Scholar 

  2. L. Boxer and R. Miller, A parallel circle-cover minimization algorithm, Inform. Process. Lett., 32, pp. 57–60, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. M. Chan, More planar two-center algorithms, Computational Geometry: Theory and Applications, 13, pp. 189–198, 1999

    MATH  MathSciNet  Google Scholar 

  4. B. Chazelle, and L. J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica, 1, pp. 133–162, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Chazelle, and L. J. Guibas, Fractional cascading: II. Applications, Algorithmica, 1, pp. 163–191, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  6. S.-W. Cheng, O. Cheong, H. Everett, and R. van Oostrum, Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons, Proc. 15th Ann. ACM Symp. Comput. Geom., pp. 227–236, 1999.

    Google Scholar 

  7. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM, 34, pp. 200–208, 1987.

    Article  MathSciNet  Google Scholar 

  8. D. Eppstein, Faster construction of planar two-centers, Proc. 8th ACM-SIAM Symp. Discrete Algorithms, pp. 131–138, 1997.

    Google Scholar 

  9. J. Friedman, J. Hershberger, and J. Snoeyink, Compliant motion in a simple polygon, Proc. 5th Ann. ACM Symp. Comput. Geom., pp. 175–186, 1989.

    Google Scholar 

  10. S. K. Kim, Parallel algorithms for geometric intersection graphs, Ph.D. Thesis, Dept. of Comput. Sci. Eng., U. of Washington, 1990.

    Google Scholar 

  11. S. K. Kim, and C.-S. Shin, Efficient algorithms for two-center problems for a convex polygon, HKUST-TCSC-1999-16, Dept. of Comp. Sci., HKUST, 1999.

    Google Scholar 

  12. C. C. Lee and D. T. Lee, On a circle-cover minimization problem, Inform. Process. Lett., 18, pp. 109–115, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  13. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30, pp. 852–865, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Sharir, A Near-Linear Algorithm for the Planar 2-Center Problem, Proc. 12th Ann. ACM Symp. Comput. Geom., pp. 106–112, 1996.

    Google Scholar 

  15. C.-S. Shin, J.-H. Kim, S. K. Kim, and K.-Y. Chwa, Two-center problems for a convex polygon, Proc. 6th Euro. Symp. on Algo., Vol. 1461, pp. 199–210, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, Chung-Ang University, Seoul, 156-756, Korea

    Sung Kwon Kim

  2. Dept. of Computer Science, HKUST, Clear Water Bay, Hong Kong

    Chan-Su Shin

Authors
  1. Sung Kwon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chan-Su Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, S.K., Shin, CS. (2000). Efficient Algorithms for Two-Center Problems for a Convex Polygon. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation