Cutting polygons into small pieces with chords: Laser-based localization
From MaRDI portal
Publication:5874470
DOI10.4230/LIPIcs.ESA.2020.7OpenAlexW3082633361MaRDI QIDQ5874470
No author found.
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.15089
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 64-dimensional counterexample to Borsuk's conjecture
- Fair partitions of polygons: an elementary introduction
- On the equipartition of plane convex bodies and convex polygons
- Algorithms for fair partitioning of convex polygons
- Equipartitioning by a convex 3-fan
- Approximation algorithms for hitting objects with straight lines
- Unsolved problems in geometry
- On the complexity of locating linear facilities in the plane
- Almost optimal set covers in finite VC-dimension
- Convex equipartitions via equivariant obstruction theory
- Minimum-link paths revisited
- Convex equipartitions: the spicy chicken theorem
- Covering things with things
- BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ d
- A counterexample to Borsuk’s conjecture
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- A Solution of Conway's Fried Potato Problem
