Herman J. Haverkort

According to our database1, Herman J. Haverkort authored at least 57 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Shortest-Path-Preserving Rounding.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

No acute tetrahedron is an 8-reptile.
Discrete Mathematics, 2018

Reptilings and space-filling curves for acute triangles.
Discrete & Computational Geometry, 2018

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

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

How many three-dimensional Hilbert curves are there?
JoCG, 2017

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

How to Play Hot and Cold on a Line.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Quadtrees and Morton Indexing.
Encyclopedia of Algorithms, 2016

Hyperorthogonal well-folded Hilbert curves.
JoCG, 2016

Terrain Modeling for the Geosciences.
Proceedings of the Computing Handbook, 2014

Flow computations on imprecise terrains.
JoCG, 2013

An Edge Quadtree for External Memory.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On IO-efficient viewshed algorithms and their accuracy.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

I/O-optimal algorithms on grid graphs
CoRR, 2012

Simple I/O-efficient flow accumulation on grid terrains
CoRR, 2012

Harmonious Hilbert curves and other extradimensional space-filling curves
CoRR, 2012

Efficient external-memory bisimulation on DAGs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Fast generation of multiple resolution instances of raster data sets.
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.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Recursive tilings and space-filling curves with little fragmentation.
JoCG, 2011

I/O-Efficient Algorithms on Near-Planar Graphs.
J. Graph Algorithms Appl., 2011

Four-dimensional hilbert curves for R-trees.
ACM Journal of Experimental Algorithmics, 2011

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

Flow Computations on Imprecise Terrains
CoRR, 2011

An inventory of three-dimensional Hilbert space-filling curves
CoRR, 2011

Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Flow on noisy terrains: an experimental evaluation.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Shortest-Paths Preserving Metro Maps.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Visibility Maps of Realistic Terrains have Linear Smoothed Complexity.
JoCG, 2010

Locality and bounding-box quality of two-dimensional space-filling curves.
Comput. Geom., 2010

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

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

Algorithmic Aspects of Proportional Symbol Maps.
Algorithmica, 2010

Algorithms for Multi-Criteria Boundary Labeling.
J. Graph Algorithms Appl., 2009

Efficient c-oriented range searching with DOP-trees.
Comput. Geom., 2009

Cache-Oblivious R-Trees.
Algorithmica, 2009

Improved visibility computation on massive grid terrains.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

The priority R-tree: A practically efficient and worst-case optimal R-tree.
ACM Trans. Algorithms, 2008

Computing visibility on terrains in external memory.
ACM Journal of Experimental Algorithmics, 2008

Computing a minimum-dilation spanning tree is NP-hard.
Comput. Geom., 2008

Constructing minimum-interference networks.
Comput. Geom., 2008

Sparse geometric graphs with small dilation.
Comput. Geom., 2008

I/O-Efficient Flow Modeling on Fat Terrains.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Algorithms for Multi-criteria One-Sided Boundary Labeling.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

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

Constrained higher order Delaunay triangulations.
Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.
Comput. Geom., 2005

Multiple Polyline to Polygon Matching.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Sparse Geometric Graphs with Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Constructing interference-minimal networks.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Box-trees for collision checking in industrial installations.
Comput. Geom., 2004

Facility location and the geometric minimum-diameter spanning tree.
Comput. Geom., 2004

Significant-Presence Range Queries in Categorical Data.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Box-Trees and R-Trees with Near-Optimal Query Time.
Discrete & Computational Geometry, 2002

Finding a minimal tree in a polygon with its medial axis.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999