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 allow ed to meet only at their endpoints. This settles an open problem from a previous paper\cite{bcdy-csp-95}. In the general case, when line segments may intersect $Ømega(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 Ackermann function.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073985
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:14:35 PM
Last modification on : Saturday, January 27, 2018 - 1:31:29 AM
Long-term archiving on: Sunday, April 4, 2010 - 9:20:48 PM

Identifiers

  • HAL Id : inria-00073985, version 1

Collections

Citation

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. RR-2705, INRIA. 1995. ⟨inria-00073985⟩

Share

Metrics

Record views

253

Files downloads

235