Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem

  • Jerzy W. Jaromczyk
  • , Mirosław Kowaluk

Producción científica: Article › revisión exhaustiva

Resumen

We provide lower and upper bounds for γ(n), the number of optimal solutions for the two-center problem: "Given a set S of n points in the real plane, find two closed discs whose union contains all of the points such that the radius of the larger disc is minimized." The main result of the paper shows the matching upper and lower bounds for the two-center problem and demonstrates that γ(n) = n.

Idioma originalEnglish
Páginas (desde-hasta)187-196
Número de páginas10
PublicaciónComputational Geometry: Theory and Applications
Volumen14
N.º4
DOI
EstadoPublished - dic 27 1999

Nota bibliográfica

Funding Information:
I A conference version of this paper appeared in the Proceedings of the Seventh Canadian Conference on Computational Geometry, Quebec, August 1995, pp. 19–24. ∗Corresponding author. E-mail: [email protected] 1Partially supported by the Center for Computational Sciences of the University of Kentucky.

Financiación

I A conference version of this paper appeared in the Proceedings of the Seventh Canadian Conference on Computational Geometry, Quebec, August 1995, pp. 19–24. ∗Corresponding author. E-mail: [email protected] 1Partially supported by the Center for Computational Sciences of the University of Kentucky.

Financiadores
University of Kentucky

    ASJC Scopus subject areas

    • Computer Science Applications
    • Geometry and Topology
    • Control and Optimization
    • Computational Theory and Mathematics
    • Computational Mathematics

    Huella

    Profundice en los temas de investigación de 'A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem'. En conjunto forman una huella única.

    Citar esto