Nonconvex cases for carpenter's rulers
From MaRDI portal
Publication:2346998
DOI10.1016/j.tcs.2015.02.031zbMath1327.68315OpenAlexW2068027439MaRDI QIDQ2346998
Publication date: 26 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.031
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- The worm problem of Leo Moser
- An improved upper bound for Leo Moser's worm problem
- Minimal universal covers in \(E^ n\)
- Research Problems in Discrete Geometry
- Sectorial Covers for Curves of Constant Length
- Movement Problems for 2-Dimensional Linkages
- Convex Regions Which Cover Arcs of Constant Length
- Minimum covers for arcs of constant length
- A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM
- Unnamed Item
- Unnamed Item
This page was built for publication: Nonconvex cases for carpenter's rulers