AI Chat AI Image Generator AI Video Text to Speech

Decomposing Polygons into Fat Components

03/16/2021

∙

by Maike Buchin, et al.

∙

∙

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.

Maike Buchin
11 publications
Leonie Selbach
2 publications

research

∙ 01/01/2020

A polynomial-time partitioning algorithm for weighted cactus graphs

Partitioning problems where the goal is to partition a graph into connec...

0 Maike Buchin, et al. ∙

research

∙ 11/02/2022

Partitioning a Polygon Into Small Pieces

We study the problem of partitioning a given simple polygon P into a min...

0 Mikkel Abrahamsen, et al. ∙

research

∙ 07/09/2021

Preserving Diversity when Partitioning: A Geometric Approach

Diversity plays a crucial role in multiple contexts such as team formati...

0 Sebastian Perez-Salazar, et al. ∙

research

∙ 07/13/2018

Approximation Algorithms for Clustering via Weighted Impurity Measures

An impurity measures I:R^k →R^+ maps a k-dimensional vector v to a non-...

0 Ferdinando Cicalese, et al. ∙

research

∙ 12/13/2021

Locally Fair Partitioning

We model the societal task of redistricting political districts as a par...

0 Pankaj K. Agarwal, et al. ∙

research

∙ 03/25/2018

Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows

Let T=(V,E) be a tree with associated costs on its subtrees. A minmax k-...

0 Di Chen, et al. ∙

research

∙ 12/31/2019

Minimizing Impurity Partition Under Constraints

Set partitioning is a key component of many algorithms in machine learni...

0 Thuan Nguyen, et al. ∙