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.
https://hal.inria.fr/inria-00090667
Contributeur : Olivier Devillers
<>
Soumis le : vendredi 1 septembre 2006 - 16:05:47
Dernière modification le : mercredi 7 mars 2018 - 10:36:28
Document(s) archivé(s) le : lundi 5 avril 2010 - 22:28:51
