H. Haverkort

activity

20072022

most citedI/O efficient bisimulation partitioning on very large directed acyclic graphs

33 citations · 73 across the 19 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.CG2022

Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface

Annika Bonerath, Anne Driemel, Jan-Henrik Haunert +3

In this paper, we analyze the approximation quality of a greedy heuristic for automatic map labeling. As input, we have a set of events, each associated with a label at a fixed pos…

math.MG2022

The limit of $L_{p}$ Voronoi diagrams as $p \to 0$ is the bounding-box-area Voronoi diagram

Herman Haverkort, Rolf Klein

We consider the Voronoi diagram of points in the real plane when the distance between two points $a$ and $b$ is given by $L_{p} (a - b)$ where $L_{p} ((x, y)) = (∣ x ∣^{p} + ∣ y ∣^{p})^{1/ p} .$ We pro…

cs.CG2022

Minimum-Error Triangulations for Sea Surface Reconstruction

Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert +6

We apply state-of-the-art computational geometry methods to the problem of reconstructing a time-varying sea surface from tide gauge records. Our work builds on a recent article by…

Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface

The limit of Lp​ Voronoi diagrams as p→0 is the bounding-box-area Voronoi diagram

Minimum-Error Triangulations for Sea Surface Reconstruction

The limit of $L_{p}$ Voronoi diagrams as $p \to 0$ is the bounding-box-area Voronoi diagram