Computing Largest Circles Separating Two Sets of Segments - Archive ouverte HAL Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2000

Computing Largest Circles Separating Two Sets of Segments

(1) , (2) , (1) , (3) , (1)
1
2
3

Abstract

A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An Theta(n log n) optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. In the general case, when line segments may intersect Omega(n^2) times, our algorithm can be adapted to work in O(n alpha(n) log n) time and O(n alpha(n)) space, where alpha(n) represents the extremely slowly growing inverse of the Ackermann function.
Fichier principal
Vignette du fichier
bcduy-clcst.pdf (203.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00338701 , version 1 (14-11-2008)

Identifiers

Cite

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. International Journal of Computational Geometry and Applications, 2000, 10, pp.41--54. ⟨10.1142/S0218195900000036⟩. ⟨inria-00338701⟩
152 View
448 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More