Herman J. Haverkort

Available identifiers

zbMath Open haverkort.herman-jMaRDI QIDQ1776900

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6182149	2023-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q6060044	2023-11-02	Paper
The limit of $L_p$ Voronoi diagrams as $p \rightarrow 0$ is the bounding-box-area Voronoi diagram	2022-07-15	Paper
Algorithmische Geometrie	2022-06-15	Paper
How to play hot and cold	2020-04-22	Paper
Shortest-path-preserving rounding	2020-02-25	Paper
Four-Dimensional Hilbert Curves for R-Trees	2019-09-11	Paper
Box-trees for collision checking in industrial installations	2018-11-23	Paper
The priority R-tree	2018-11-05	Paper
Reptilings and space-filling curves for acute triangles	2018-07-26	Paper
How many three-dimensional Hilbert curves are there	2018-06-05	Paper
No acute tetrahedron is an 8-reptile	2018-02-23	Paper
Cache-oblivious R-trees	2017-10-20	Paper
Visibility maps of realistic terrains have linear smoothed complexity	2017-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q5368731	2017-10-10	Paper
Box-trees and R-trees with near-optimal query time	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5365043	2017-09-29	Paper
How to play hot and cold on a line	2017-09-22	Paper
Hyperorthogonal well-folded Hilbert curves	2017-03-30	Paper
Visibility maps of realistic terrains have linear smoothed complexity	2017-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q2968078	2017-03-09	Paper
Flow computations on imprecise terrains	2017-03-09	Paper
Computing visibility on terrains in external memory	2014-04-01	Paper
Four-dimensional hilbert curves for R-trees	2014-04-01	Paper
I/O-Efficient Algorithms on Near-Planar Graphs	2013-11-28	Paper
Drawing Metro Maps Using Bézier Curves	2013-04-03	Paper
Shortest-Paths Preserving Metro Maps	2012-03-09	Paper
Flow Computations on Imprecise Terrains	2011-08-12	Paper
Algorithmic aspects of proportional symbol maps	2010-09-27	Paper
Algorithms and Data Structures	2010-04-20	Paper
The complexity of flow on fat terrains and its i/o-efficient computation	2010-03-16	Paper
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions	2010-03-11	Paper
Algorithms for Multi-Criteria Boundary Labeling	2010-02-04	Paper
Locality and bounding-box quality of two-dimensional space-filling curves	2009-11-16	Paper
Algorithms and Computation	2009-08-07	Paper
Cache-oblivious R-trees	2009-05-13	Paper
I/O-Efficient Flow Modeling on Fat Terrains	2009-02-17	Paper
Efficient \(c\)-oriented range searching with DOP-trees	2009-02-12	Paper
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves	2008-11-25	Paper
Computing a minimum-dilation spanning tree is NP-hard	2008-09-19	Paper
I/O-Efficient Algorithms on Near-Planar Graphs	2008-09-18	Paper
Constructing minimum-interference networks	2008-06-18	Paper
Sparse geometric graphs with small dilation	2008-06-18	Paper
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions	2008-05-27	Paper
Algorithms for Multi-criteria One-Sided Boundary Labeling	2008-03-25	Paper
Algorithmic Aspects of Proportional Symbol Maps	2008-03-11	Paper
Algorithms and Computation	2006-11-14	Paper
Algorithms and Computation	2006-11-14	Paper
SOFSEM 2006: Theory and Practice of Computer Science	2006-11-14	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Computing all immobilizing grasps of a simple polygon with few contacts	2006-06-14	Paper
Constrained higher order Delaunay triangulations	2005-05-12	Paper
Optimal spanners for axis-aligned rectangles	2005-02-09	Paper
Facility location and the geometric minimum-diameter spanning tree.	2004-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q4411284	2003-07-07	Paper
Box-trees and R-trees with near-optimal query time	2002-12-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Herman J. Haverkort