Circular Separability of Polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1994

Circular Separability of Polygons

Jean-Daniel Boissonnat
  • Function : Author
  • PersonId : 830857
Jurek Czyzowicz
  • Function : Author
Olivier Devillers
Mariette Yvinec


Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints. The resulting circle must contain the query points and it must lie in the halfplanes delimited by the query lines.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2406.pdf (301.74 Ko) Télécharger le fichier

Dates and versions

inria-00074269 , version 1 (24-05-2006)


  • HAL Id : inria-00074269 , version 1


Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. Circular Separability of Polygons. RR-2406, INRIA. 1994. ⟨inria-00074269⟩
105 View
133 Download


Gmail Facebook Twitter LinkedIn More