Separating translates in the plane: Combinatorial bounds and an algorithm

DOI10.1007/3-540-58218-5_10MaRDI QIDQ5056170zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58218-5_10

Mathematics Subject Classification ID

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

Recommendations

• Separating Translates in the Plane: Combinatorial Bounds and an Algorithm
• An optimal algorithm for one-separation of a set of isothetic polygons
• Minimum polygonal separation
• On separating two simple polygons by a single translation
• Separating convex sets in the plane

Cites work

• Cutting disjoint disks by straight lines
• Geometric permutations of disjoint translates of convex sets
• scientific article; zbMATH DE number 176772 (Why is no real title available?)
• Planar graphs: Theory and algorithms
• Separating convex sets in the plane
• Separating plane convex sets.
• Separation of convex sets
• Some dynamic computational geometry problems
• Stabbing line segments

Cited in

(4)

• On the union of fat wedges and separating a collection of segments by a line
• Bounds for totally separable translative packings in the plane
• On the separability of quadrilaterals in the plane by translations and rotations
• 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 Q5056170)