Herman Haverkort is an Assistant Professor in the Algorithms Group of the Department of Mathematics and Computer Science at the Eindhoven University of Technology. His key areas of expertise are geometric algorithms and external-memory algorithms. Herman is specialized in algorithms, striving to design algorithms that can be proven to yield correct results fast, even when a large amount of data needs to be processed or searched. More specifically, he focuses on algorithms that process geometric data or geometric networks, such as found in geographic information systems. Herman has conducted research on a wide range of topics, including space-filling curves, terrain modeling for the geosciences, travel time cues in schematic maps, four-dimensional Hilbert curves for R-trees, edge quadtree for external memory and Bézier curves for metro maps.
Herman Haverkort received his PhD in Computer Science from the University of Utrecht in 2004. He worked as a researcher at the University of Aarhus and the University of Karlsruhe before joining TU/e. He has published on a wide range of topics, including recursive tilings and space-filling curves, automated cartography, search algorithms, algorithms for geographic elevation models, symbol placement on maps, I/O-efficient graph algorithms and geometric data structures for sets of two- or higher-dimensional objects.
No acute tetrahedron is an 8-reptileDiscrete Mathematics (2018)
Sixteen space-filling curves and traversals for d-dimensional cubes and simplicesarXiv (2017)
The sound of space-filling curves(2017)
How many three-dimensional Hilbert curves are there?Journal of Computational Geometry (2017)
How to play hot and cold on a line15th International Symposium on Algorithms and Data Structures (WADS 2017) (2017)
- Teachers Information Data Science
No ancillary activities