Cutting polygons into small pieces with chords: Laser-based localization
From MaRDI portal
Publication:5874470
DOI10.4230/LIPICS.ESA.2020.7OpenAlexW3082633361MaRDI QIDQ5874470FDOQ5874470
Authors:
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.15089
Recommendations
- scientific article; zbMATH DE number 1629819
- Cutting circles and polygons from area-minimizing rectangles
- A PTAS for Cutting Out Polygons with Lines
- A PTAS for cutting out polygons with lines
- Cutting out polygon collections with a saw
- Computing and Combinatorics
- Algorithms and Computation
- CUTTING OUT POLYGONS WITH LINES AND RAYS
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
Cites Work
- Almost optimal set covers in finite VC-dimension
- A counterexample to Borsuk’s conjecture
- Unsolved problems in geometry
- Title not available (Why is that?)
- Convex equipartitions via equivariant obstruction theory
- Approximation algorithms for hitting objects with straight lines
- Covering things with things
- Title not available (Why is that?)
- Minimum-link paths revisited
- Title not available (Why is that?)
- On the complexity of locating linear facilities in the plane
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Title not available (Why is that?)
- A 64-dimensional counterexample to Borsuk's conjecture
- On the equipartition of plane convex bodies and convex polygons
- Convex equipartitions: the spicy chicken theorem
- Equipartitioning by a convex 3-fan
- Fair partitions of polygons: an elementary introduction
- A Solution of Conway's Fried Potato Problem
- Algorithms for fair partitioning of convex polygons
- Balanced convex partitions of measures in \(\mathbb R^{d}\)
- Title not available (Why is that?)
This page was built for publication: Cutting polygons into small pieces with chords: Laser-based localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874470)
