Separating Translates in the Plane: Combinatorial Bounds and an Algorithm

DOI10.1142/S021819599700034XMaRDI QIDQ4375870zbMATH OpenFDO

Authors Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert

Publication date 25 May 1998

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S021819599700034X

zbMATH Keywords

combinatorial boundslinear separability

Mathematics Subject Classification ID

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

Recommendations

• Separating translates in the plane: Combinatorial bounds and an algorithm
• Separating convex sets in the plane
• On separation of plane convex sets
• Separating families of convex sets

Cited in

(2)

• Bounds for totally separable translative packings in the plane
• Separating translates in the plane: Combinatorial bounds and an algorithm

This page was built for publication: Separating Translates in the Plane: Combinatorial Bounds and an Algorithm

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