Computing Largest Circles Separating Two Sets of Segments - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1996

Computing Largest Circles Separating Two Sets of Segments

Résumé

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 non déposé

Dates et versions

hal-01179145 , version 1 (22-07-2015)

Identifiants

  • HAL Id : hal-01179145 , version 1

Citer

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. 8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada. ⟨hal-01179145⟩
202 Consultations
2 Téléchargements

Partager

Gmail Facebook X LinkedIn More