Anzeige
Erschienen in:
2000 | OriginalPaper | Buchkapitel
Efficient Algorithms for Two-Center Problems for a Convex Polygon
Extended Abstract
verfasst von : Sung Kwon Kim, Chan-Su Shin
Erschienen in: Computing and Combinatorics
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 log3n log log n) and O(n log2n) time. Furthermore, we can solve both of the standard and discrete two-center problems for a set of points in convex positions in O(nlog2n) time.