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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 25, 1998; revised April 21, 1999.
Rights and permissions
About this article
Cite this article
-D. Boissonnat, J., Czyzowicz, J., Devillers, O. et al. Circular Separability of Polygons. Algorithmica 30, 67–82 (2001). https://doi.org/10.1007/s004530010078
Issue Date:
DOI: https://doi.org/10.1007/s004530010078