default search action
Herman J. Haverkort
Person information
- affiliation: University of Bonn, Germany
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [c39]Anna Arutyunova, Anne Driemel
, Jan-Henrik Haunert
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG 2022: 7:1-7:18 - [i24]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR abs/2203.07325 (2022) - [i23]Herman J. Haverkort, Rolf Klein:
The limit of Lp Voronoi diagrams as p→0 is the bounding-box-area Voronoi diagram. CoRR abs/2207.07377 (2022) - [i22]Annika Bonerath, Anne Driemel, Jan-Henrik Haunert
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface. CoRR abs/2209.00913 (2022) - 2021
- [c38]Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin
Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) 2021: 6:1-6:16 - [i21]Herman J. Haverkort, Rolf Klein:
Hyperbolae are the locus of constant angle difference. CoRR abs/2112.00454 (2021) - 2020
- [j28]Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
How to play hot and cold. Comput. Geom. 87: 101596 (2020) - [c37]Kevin Buchin, Herman J. Haverkort, Hidde Koerts:
Restricted-Weight Minimum-Dilation Spanners on Three Points. CCCG 2020: 240-248 - [c36]Herman J. Haverkort:
Plane-Filling Trails (Media Exposition). SoCG 2020: 81:1-81:5 - [i20]Herman J. Haverkort:
Plane-filling trails. CoRR abs/2003.12745 (2020)
2010 – 2019
- 2019
- [c35]Herman J. Haverkort, David Kübel, Elmar Langetepe:
Shortest-Path-Preserving Rounding. IWOCA 2019: 265-277 - [i19]Herman J. Haverkort, David Kübel, Elmar Langetepe:
Shortest-Path-Preserving Rounding. CoRR abs/1905.08621 (2019) - 2018
- [j27]Marinus Gottschau
Reptilings and space-filling curves for acute triangles. Discret. Comput. Geom. 60(1): 170-199 (2018) - [j26]Herman J. Haverkort:
No acute tetrahedron is an 8-reptile. Discret. Math. 341(4): 1131-1135 (2018) - [i18]Herman J. Haverkort, Laura Toma:
A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains. CoRR abs/1810.01946 (2018) - [i17]Herman J. Haverkort:
Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time - a proof by reduction from epsilon-closeness. CoRR abs/1812.01332 (2018) - 2017
- [j25]Herman J. Haverkort:
How many three-dimensional Hilbert curves are there? J. Comput. Geom. 8(1): 206-281 (2017) - [c34]Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald
How to Play Hot and Cold on a Line. WADS 2017: 449-460 - [i16]Herman J. Haverkort:
Sixteen space-filling curves and traversals for d-dimensional cubes and simplices. CoRR abs/1711.04473 (2017) - 2016
- [j24]Arie Bos, Herman J. Haverkort:
Hyperorthogonal well-folded Hilbert curves. J. Comput. Geom. 7(2): 145-190 (2016) - [r1]Herman J. Haverkort, Laura Toma:
Quadtrees and Morton Indexing. Encyclopedia of Algorithms 2016: 1637-1642 - [i15]Herman J. Haverkort:
How many three-dimensional Hilbert curves are there? CoRR abs/1610.00155 (2016) - 2015
- [c33]Arie Bos, Herman J. Haverkort:
Hyperorthogonal Well-Folded Hilbert Curves. SoCG 2015: 812-826 - [i14]Arie Bos, Herman J. Haverkort:
Hyperorthogonal well-folded Hilbert curves. CoRR abs/1508.02517 (2015) - [i13]Herman J. Haverkort:
No acute tetrahedron is an 8-reptile. CoRR abs/1508.03773 (2015) - 2014
- [p1]Herman J. Haverkort, Laura Toma:
Terrain Modeling for the Geosciences. Computing Handbook, 3rd ed. (1) 2014: 31: 1-21 - 2013
- [j23]Anne Driemel
Flow computations on imprecise terrains. J. Comput. Geom. 4(1): 38-78 (2013) - [c32]Herman J. Haverkort, Laura Toma, Bob PoFang Wei:
On IO-efficient viewshed algorithms and their accuracy. SIGSPATIAL/GIS 2013: 24-33 - [c31]Herman J. Haverkort, Mark McGranaghan, Laura Toma:
An Edge Quadtree for External Memory. SEA 2013: 115-126 - 2012
- [c30]Martin Fink, Herman J. Haverkort, Martin Nöllenburg
Drawing Metro Maps Using Bézier Curves. GD 2012: 463-474 - [c29]Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis:
Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS 2012: 52-60 - [c28]Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort:
Efficient external-memory bisimulation on DAGs. SIGMOD Conference 2012: 553-564 - [i12]Herman J. Haverkort:
Harmonious Hilbert curves and other extradimensional space-filling curves. CoRR abs/1211.0175 (2012) - [i11]Herman J. Haverkort, Jeffrey Janssen:
Simple I/O-efficient flow accumulation on grid terrains. CoRR abs/1211.1857 (2012) - [i10]Herman J. Haverkort:
I/O-optimal algorithms on grid graphs. CoRR abs/1211.2066 (2012) - 2011
- [j22]Herman J. Haverkort, Freek van Walderveen:
Four-dimensional hilbert curves for R-trees. ACM J. Exp. Algorithmics 16 (2011) - [j21]Herman J. Haverkort, Laura Toma:
I/O-Efficient Algorithms on Near-Planar Graphs. J. Graph Algorithms Appl. 15(4): 503-532 (2011) - [j20]Herman J. Haverkort:
Recursive tilings and space-filling curves with little fragmentation. J. Comput. Geom. 2(1): 92-127 (2011) - [c27]Tal Milea, Okke Schrijvers, Kevin Buchin
Shortest-Paths Preserving Metro Maps. GD 2011: 445-446 - [c26]Herman J. Haverkort, Constantinos P. Tsirogiannis:
Flow on noisy terrains: an experimental evaluation. GIS 2011: 84-91 - [c25]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA 2011: 285-296 - [c24]Anne Driemel
Flow Computations on Imprecise Terrains. WADS 2011: 350-361 - [i9]Herman J. Haverkort:
An inventory of three-dimensional Hilbert space-filling curves. CoRR abs/1109.2323 (2011) - [i8]Anne Driemel, Herman J. Haverkort, Maarten Löffler:
Flow Computations on Imprecise Terrains. CoRR abs/1111.1651 (2011) - [i7]Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort:
I/O efficient bisimulation partitioning on very large directed acyclic graphs. CoRR abs/1112.0857 (2011) - 2010
- [j19]Sergio Cabello
Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58(3): 543-565 (2010) - [j18]Herman J. Haverkort, Freek van Walderveen:
Locality and bounding-box quality of two-dimensional space-filling curves. Comput. Geom. 43(2): 131-147 (2010) - [j17]Mark de Berg, Otfried Cheong
The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010) - [j16]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010) - [j15]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. J. Comput. Geom. 1(1): 57-71 (2010) - [i6]Herman J. Haverkort:
Recursive tilings and space-filling curves with little fragmentation. CoRR abs/1002.1843 (2010)
2000 – 2009
- 2009
- [j14]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009) - [j13]Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009) - [j12]Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg
Algorithms for Multi-Criteria Boundary Labeling. J. Graph Algorithms Appl. 13(3): 289-317 (2009) - [c23]Herman J. Haverkort, Freek van Walderveen:
Four-Dimensional Hilbert Curves for R-Trees. ALENEX 2009: 63-73 - [c22]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility maps of realistic terrains have linear smoothed complexity. SCG 2009: 163-168 - [c21]Jeremy Fishman, Herman J. Haverkort, Laura Toma:
Improved visibility computation on massive grid terrains. GIS 2009: 121-130 - 2008
- [j11]Marc Benkert, Joachim Gudmundsson
Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008) - [j10]Boris Aronov
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j9]Otfried Cheong
Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008) - [j8]Herman J. Haverkort, Laura Toma, Yi Zhuang:
Computing visibility on terrains in external memory. ACM J. Exp. Algorithmics 13 (2008) - [j7]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms 4(1): 9:1-9:30 (2008) - [c20]Herman J. Haverkort, Freek van Walderveen:
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. ESA 2008: 515-527 - [i5]Herman J. Haverkort, Freek van Walderveen:
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. CoRR abs/0806.4787 (2008) - 2007
- [c19]Herman J. Haverkort, Laura Toma, Yi Zhuang:
Computing Visibility on Terrains in External Memory. ALENEX 2007 - [c18]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24 - [c17]Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg
Algorithms for Multi-criteria One-Sided Boundary Labeling. GD 2007: 243-254 - [c16]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC 2007: 500-511 - [c15]Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250 - [i4]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - [i3]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CoRR abs/cs/0703023 (2007) - 2006
- [j6]Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. Algorithmica 44(2): 117-136 (2006) - [c14]Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731 - [c13]Herman J. Haverkort, Laura Toma:
I/O-Efficient Algorithms on Near-Planar Graphs. LATIN 2006: 580-591 - [c12]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176 - 2005
- [j5]Tetsuo Asano, Mark de Berg, Otfried Cheong
Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) - [j4]Joachim Gudmundsson
Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005) - [c11]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-oblivious r-trees. SCG 2005: 170-179 - [c10]Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519 - [c9]Boris Aronov
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - [c8]Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort:
Multiple Polyline to Polygon Matching. ISAAC 2005: 60-70 - [i2]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing interference-minimal networks. EuroCG 2005: 203-206 - 2004
- [j3]Joachim Gudmundsson
Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004) - [j2]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004) - [c7]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358 - [i1]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004 - 2003
- [c6]Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen:
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. ISAAC 2003: 260-269 - [c5]Mark de Berg, Herman J. Haverkort:
Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473 - 2002
- [j1]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson
Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. 28(3): 291-312 (2002) - [c4]Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160 - [c3]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. SCG 2002: 53-62 - 2001
- [c2]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time. SCG 2001: 124-133
1990 – 1999
- 1999
- [c1]Herman J. Haverkort, Hans L. Bodlaender:
Finding a minimal tree in a polygon with its medial axis. CCCG 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: