2 papers
cs.CG2021
Decomposing Polygons into Fat Components
Maike Buchin, Leonie Selbach
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 .…
cs.DS2020
Partitioning algorithms for weighted trees and cactus graphs
Maike Buchin, Leonie Selbach
In this paper, we consider different constrained partition problems for weighted trees and cactus graphs. We focus on the (l,u)-partition problem, which is the problem of partition…