Herman J. Haverkort

According to our database, Herman J. Haverkort authored at least 66 papers between 1999 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Minimum-error triangulations for sea surface reconstruction.

Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin

J. Comput. Geom., 2022

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

Annika Bonerath, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Elmar Langetepe, Benjamin Niedermann

CoRR, 2022

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

Herman J. Haverkort, Rolf Klein

CoRR, 2022

2021

Hyperbolae are the locus of constant angle difference.

Herman J. Haverkort, Rolf Klein

CoRR, 2021

Bicriteria Aggregation of Polygons via Graph Cuts.

Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert

Proceedings of the 11th International Conference on Geographic Information Science, 2021

2020

Plane-filling trails.

Herman J. Haverkort

CoRR, 2020

How to play hot and cold.

Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald

Comput. Geom., 2020

Plane-Filling Trails (Media Exposition).

Herman J. Haverkort

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Restricted-Weight Minimum-Dilation Spanners on Three Points.

Kevin Buchin, Herman J. Haverkort, Hidde Koerts

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Shortest-Path-Preserving Rounding.

Herman J. Haverkort, David Kübel, Elmar Langetepe

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

No acute tetrahedron is an 8-reptile.

Herman J. Haverkort

Discret. Math., 2018

Reptilings and space-filling curves for acute triangles.

Marinus Gottschau, Herman J. Haverkort, Kilian Matzke

Discret. Comput. Geom., 2018

Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time - a proof by reduction from epsilon-closeness.

Herman J. Haverkort

CoRR, 2018

A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains.

Herman J. Haverkort, Laura Toma

CoRR, 2018

2017

How many three-dimensional Hilbert curves are there?

Herman J. Haverkort

J. Comput. Geom., 2017

Sixteen space-filling curves and traversals for d-dimensional cubes and simplices.

Herman J. Haverkort

CoRR, 2017

How to Play Hot and Cold on a Line.

Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Quadtrees and Morton Indexing.

Herman J. Haverkort, Laura Toma

Encyclopedia of Algorithms, 2016

Hyperorthogonal well-folded Hilbert curves.

Arie Bos, Herman J. Haverkort

J. Comput. Geom., 2016

2014

Terrain Modeling for the Geosciences.

Herman J. Haverkort, Laura Toma

Proceedings of the Computing Handbook, 2014

2013

Flow computations on imprecise terrains.

Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira

J. Comput. Geom., 2013

An Edge Quadtree for External Memory.

Herman J. Haverkort, Mark McGranaghan, Laura Toma

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On IO-efficient viewshed algorithms and their accuracy.

Herman J. Haverkort, Laura Toma, Bob PoFang Wei

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012

I/O-optimal algorithms on grid graphs

Herman J. Haverkort

CoRR, 2012

Simple I/O-efficient flow accumulation on grid terrains

Herman J. Haverkort, Jeffrey Janssen

CoRR, 2012

Harmonious Hilbert curves and other extradimensional space-filling curves

Herman J. Haverkort

CoRR, 2012

Efficient external-memory bisimulation on DAGs.

Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Fast generation of multiple resolution instances of raster data sets.

Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Drawing Metro Maps Using Bézier Curves.

Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Recursive tilings and space-filling curves with little fragmentation.

Herman J. Haverkort

J. Comput. Geom., 2011

I/O-Efficient Algorithms on Near-Planar Graphs.

Herman J. Haverkort, Laura Toma

J. Graph Algorithms Appl., 2011

Four-dimensional hilbert curves for R-trees.

Herman J. Haverkort, Freek van Walderveen

ACM J. Exp. Algorithmics, 2011

I/O efficient bisimulation partitioning on very large directed acyclic graphs

Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort

CoRR, 2011

Flow Computations on Imprecise Terrains

Anne Driemel, Herman J. Haverkort, Maarten Löffler

CoRR, 2011

An inventory of three-dimensional Hilbert space-filling curves

Herman J. Haverkort

CoRR, 2011

Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures.

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Flow on noisy terrains: an experimental evaluation.

Herman J. Haverkort, Constantinos P. Tsirogiannis

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Shortest-Paths Preserving Metro Maps.

Tal Milea, Okke Schrijvers, Kevin Buchin, Herman J. Haverkort

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Visibility Maps of Realistic Terrains have Linear Smoothed Complexity.

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis

J. Comput. Geom., 2010

Locality and bounding-box quality of two-dimensional space-filling curves.

Herman J. Haverkort, Freek van Walderveen

Comput. Geom., 2010

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions.

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma

Comput. Geom., 2010

The complexity of flow on fat terrains and its i/o-efficient computation.

Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma

Comput. Geom., 2010

Algorithmic Aspects of Proportional Symbol Maps.

Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann

Algorithmica, 2010

2009

Algorithms for Multi-Criteria Boundary Labeling.

Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg

J. Graph Algorithms Appl., 2009

Efficient c-oriented range searching with DOP-trees.

Mark de Berg, Herman J. Haverkort, Micha Streppel

Comput. Geom., 2009

Cache-Oblivious R-Trees.

Lars Arge, Mark de Berg, Herman J. Haverkort

Algorithmica, 2009

Improved visibility computation on massive grid terrains.

Jeremy Fishman, Herman J. Haverkort, Laura Toma

Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

2008

The priority R-tree: A practically efficient and worst-case optimal R-tree.

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi

ACM Trans. Algorithms, 2008

Computing visibility on terrains in external memory.

Herman J. Haverkort, Laura Toma, Yi Zhuang

ACM J. Exp. Algorithmics, 2008

Computing a minimum-dilation spanning tree is NP-hard.

Otfried Cheong, Herman J. Haverkort, Mira Lee

Comput. Geom., 2008

Constructing minimum-interference networks.

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff

Comput. Geom., 2008

Sparse geometric graphs with small dilation.

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron

Comput. Geom., 2008

2007

I/O-Efficient Flow Modeling on Fat Terrains.

Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Algorithms for Multi-criteria One-Sided Boundary Labeling.

Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts.

Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen

Algorithmica, 2006

Constructing Interference-Minimal Networks.

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005

Constrained higher order Delaunay triangulations.

Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld

Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.

Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff

Comput. Geom., 2005

Multiple Polyline to Polygon Matching.

Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Sparse Geometric Graphs with Small Dilation.

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Box-trees for collision checking in industrial installations.

Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson

Comput. Geom., 2004

Facility location and the geometric minimum-diameter spanning tree.

Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff

Comput. Geom., 2004

2003

Significant-Presence Range Queries in Categorical Data.

Mark de Berg, Herman J. Haverkort

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

Box-Trees and R-Trees with Near-Optimal Query Time.

Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort

Discret. Comput. Geom., 2002

1999

Finding a minimal tree in a polygon with its medial axis.

Herman J. Haverkort, Hans L. Bodlaender

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999