Algorithms for fair partitioning of convex polygons

DOI10.1016/j.tcs.2015.08.003zbMath1332.68263OpenAlexW2179864577MaRDI QIDQ896117

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

zbMATH Keywords

algorithmconvex polygonfair partitioning

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38)

Related Items (3)

A survey of mass partitions ⋮ Keep your distance: land division with separation ⋮ Cutting polygons into small pieces with chords: Laser-based localization

Cites Work

• Fair partitions of polygons: an elementary introduction
• Discrete and Computational Geometry
• Discrete and Computational Geometry
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for fair partitioning of convex polygons