Circular Separability of Polygons

Abstract : 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.
Document type :
Reports
RR-2406, 1994


https://hal.inria.fr/inria-00074269
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:54:18 PM
Last modification on : Wednesday, May 31, 2006 - 2:24:32 PM

Identifiers

  • HAL Id : inria-00074269, version 1

Collections

Citation

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. Circular Separability of Polygons. RR-2406, 1994. <inria-00074269>

Export

Share

Metrics

Consultation de
la notice

126

Téléchargement du document

37