From the 1 of 5 linked papers with an AI index.
1 citations · 1 across the 3 of their papers we have counts for
5 papers
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
The paper investigates how to select faces in a planar polygonal subdivision to maximize a circularity measure (Polsby‑Popper score or its generalization A/P^α), proving weak NP‑ha…
Polynomial-time -approximation for -coloured Non-crossing Euclidean TSP
Daniel Bauer, Jan-Henrik Haunert
Given a -coloured point set , the -coloured Non-crossing Euclidean Travelling Salesperson Problem (short -ETSP) asks for non-crossing closed c…
Strong ILP Formulations for the p-Regions Problem
Daniel Faber, Jan-Henrik Haunert, Petra Mutzel
Regionalization is a fundamental task in spatial analysis that seeks to partition a larger area - such as a country - into smaller regions that are homogeneous with respect to a gi…
Bicriteria Polygon Aggregation with Arbitrary Shapes
Lotte Blank, David Eppstein, Jan-Henrik Haunert +6
We study the problem of aggregating a set of polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Equivalently, this can b…
Automatic Uncertainty-Aware Synthetic Data Bootstrapping for Historical Map Segmentation
Lukas Arzoumanidis, Julius Knechtel, Jan-Henrik Haunert +1
The automated analysis of historical documents, particularly maps, has drastically benefited from advances in deep learning and its success across various computer vision applicati…