Algorithms for fair partitioning of convex polygons
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- A combinatorial algorithm to establish a fair border
- Cutting polygons into small pieces with chords: Laser-based localization
- Fair Partitioning by Straight Lines
- Pizza again? On the division of polygons into sections with a common origin
- Keep your distance: land division with separation
- Algorithms for fair partitioning of convex polygons
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- Fair partitions of polygons: an elementary introduction
- Finding equitable convex partitions of points in a polygon efficiently
- Voronoi-based splinegon decomposition and shortest-path tree computation
- scientific article; zbMATH DE number 1629819 (Why is no real title available?)
- Equal-area locus-based convex polygon decomposition
- Equal-Area Locus-Based Convex Polygon Decomposition
- A survey of mass partitions
This page was built for publication: Algorithms for fair partitioning of convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896117)