Separating point sets in polygonal environments

DOI10.1145/997817.997822MaRDI QIDQ5361649zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides

Publication date 29 September 2017

Published in Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/997817.997822

zbMATH Keywords

chordsgeodesicspolygonsseparability

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• Minimum polygonal separation
• Separability by two lines and by nearly straight polygonal chains
• The complexity of separating points in the plane
• Geometric separability using orthogonal objects

Cited in

(14)

• Separating sets in interpolation and geometry
• Geometric separability using orthogonal objects
• Dispersing and grouping points on planar segments
• The complexity of separating points in the plane
• On polygons excluding point sets
• Efficient algorithms for bichromatic separability
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• The complexity of computing minimum separating polygons
• The complexity of separating points in the plane
• scientific article; zbMATH DE number 5204786 (Why is no real title available?)
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• Separating objects in the plane by wedges and strips
• Circular separability of polygons
• Separating bichromatic point sets by L-shapes

This page was built for publication: Separating point sets in polygonal environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361649)