Algorithms for fair partitioning of convex polygons
DOI10.1016/J.TCS.2015.08.003zbMATH Open1332.68263OpenAlexW2179864577MaRDI QIDQ896117FDOQ896117
Authors: Bogdan Armaselu, Ovidiu Daescu 
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.003
Recommendations
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38)
Cites Work
Cited In (14)
- Equal-area locus-based convex polygon decomposition
- Voronoi-based splinegon decomposition and shortest-path tree computation
- Fair partitions of polygons: an elementary introduction
- Cutting polygons into small pieces with chords: Laser-based localization
- Finding equitable convex partitions of points in a polygon efficiently
- Equal-Area Locus-Based Convex Polygon Decomposition
- Pizza again? On the division of polygons into sections with a common origin
- Fair Partitioning by Straight Lines
- A survey of mass partitions
- Keep your distance: land division with separation
- A combinatorial algorithm to establish a fair border
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- Algorithms for fair partitioning of convex polygons
- Title not available (Why is that?)
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)
