Circular separability of polygons
From MaRDI portal
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.
Recommendations
Cited in
(14)- Computing circular separability
- On circumscribing polygons for line segments
- Separability by two lines and by nearly straight polygonal chains
- Separating circles on the sphere by polygonal tilings
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Finding the largest empty disk containing a query point
- Distance between separating circles and points
- scientific article; zbMATH DE number 4062596 (Why is no real title available?)
- Topological relations between separating circles
- scientific article; zbMATH DE number 139795 (Why is no real title available?)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- scientific article; zbMATH DE number 4121493 (Why is no real title available?)
- scientific article; zbMATH DE number 7157354 (Why is no real title available?)
- Separation of continua by circles
This page was built for publication: Circular separability of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943827)
