Equal-Area Locus-Based Convex Polygon Decomposition
From MaRDI portal
Publication:3511394
DOI10.1007/978-3-540-69355-0_13zbMath1143.68613OpenAlexW2174095290MaRDI QIDQ3511394
David Adjiashvili, David Peleg
Publication date: 10 July 2008
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_13
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed multirobot exploration, mapping, and task allocation
- Generalizing ham sandwich cuts to equitable subdivisions
- Coverage for robotics -- a survey of recent results
- Equipartitions of measures by 2-fans
- The Early History of the Ham Sandwich Theorem
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- Distributed Computing – IWDC 2005
- Discrete and Computational Geometry
- Simultaneous partitions of measures by \(k\)-fans
This page was built for publication: Equal-Area Locus-Based Convex Polygon Decomposition