Separating translates in the plane: Combinatorial bounds and an algorithm
From MaRDI portal
Publication:5056170
DOI10.1007/3-540-58218-5_10zbMath1502.68308OpenAlexW1536917398MaRDI QIDQ5056170
Hazel Everett, Jean-Marc Robert, Jurek Czyzowicz
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
Cites Work
- Unnamed Item
- Some dynamic computational geometry problems
- Geometric permutations of disjoint translates of convex sets
- Stabbing line segments
- Separating convex sets in the plane
- Planar graphs: Theory and algorithms
- Separation of convex sets
- Cutting disjoint disks by straight lines
- Separating plane convex sets.
This page was built for publication: Separating translates in the plane: Combinatorial bounds and an algorithm
