Computing Largest Circles Separating Two Sets of Segments

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00338701
Contributor : Olivier Devillers <>
Submitted on : Friday, November 14, 2008 - 9:43:24 AM
Last modification on : Wednesday, August 14, 2019 - 4:12:05 PM
Long-term archiving on : Monday, June 7, 2010 - 9:25:06 PM

File

bcduy-clcst.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, World Scientific Publishing, 2000, 10, pp.41--54. ⟨10.1142/S0218195900000036⟩. ⟨inria-00338701⟩

Share

Metrics

Record views

462

Files downloads

782