2 papers
cs.CG2022
Minimum Link Fencing
Sujoy Bhore, Fabian Klute, Maarten Löffler +3
We study a variant of the geometric multicut problem, where we are given a set of colored and pairwise interior-disjoint polygons in the plane. The objective is to co…
cs.CG2021
Layered Area-Proportional Rectangle Contact Representations
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoi…