Skip to Main content Skip to Navigation
New interface
Journal articles

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 :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Friday, September 1, 2006 - 4:05:47 PM
Last modification on : Friday, February 4, 2022 - 3:22:14 AM
Long-term archiving on: : Monday, April 5, 2010 - 10:28:51 PM




Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. Circular Separability of Polygons. Algorithmica, 2001, 30 (1), pp.67--82. ⟨10.1007/s004530010078⟩. ⟨inria-00090667⟩



Record views


Files downloads