Year: 2021
Type: preprint
Abstract: We study the problem of decomposing (i.e. partitioning and covering) polygons into components that are $α$-fat, which means that the aspect ratio of each subpolygon is at most $α$. We consider decompositions without Steiner points. We present a polynomial-time algorithm for simple polygons that finds the minimum $α$ such that an $α$-fat partition exists. Furthermore, we show that finding an $α$-fat partition or covering with minimum cardinality is NP-hard for polygons with holes.
Source: arXiv (Cornell University)
Authors: Buchin, Maike, Selbach, Leonie
Institution: Ruhr University Bochum
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3138939576