16 papers
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…
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
A problem that occurs in different applications in geographical information science is to generate compact regions from areas on a map. This is important, e.g., in the context of e…
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…
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…
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…
EulerMerge: Simplifying Euler Diagrams Through Set Merges
Xinyuan Yan, Peter Rodgers, Peter Rottmann +3
Euler diagrams are an intuitive and popular method to visualize set-based data. In a Euler diagram, each set is represented as a closed curve, and set intersections are shown by cu…