Circular Separability of Polygons
Computational Geometry
2016-08-31 v1
Abstract
Two planar sets are circularly separable if there exists a circle enclosing one of the sets 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.
Cite
@article{arxiv.cs/9909007,
title = {Circular Separability of Polygons},
author = {Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec},
journal= {arXiv preprint arXiv:cs/9909007},
year = {2016}
}
Comments
23 pages, 7 figures, abstract presented at SODA95