Herman J. Haverkort

98 papers A* 4A 8B 11C 2Journal 55Unranked 16

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface. IEEE Trans. Vis. Comput. Graph. Annika Bonerath, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Elmar Langetepe, Benjamin Niedermann
2025	J	`jnl`	Bicriteria Polygon Aggregation with Arbitrary Shapes. CoRR Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman J. Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann, Jonas Sauer
2025	J	`jnl`	Bicriteria Shapes: Hierarchical Grouping and Aggregation of Polygons with an Efficient Graph-Cut Approach. ACM Trans. Spatial Algorithms Syst. Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert
2024	J	`jnl`	The Limit of $$L_p$$ Voronoi Diagrams as $$p\rightarrow 0$$ is the Bounding-Box-Area Voronoi Diagram. Discret. Comput. Geom. Herman J. Haverkort, Rolf Klein
2022	J	`jnl`	Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface. CoRR Annika Bonerath, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Elmar Langetepe, Benjamin Niedermann
2022	A*	`conf`	Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
2022	J	`jnl`	Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
2022	J	`jnl`	Minimum-error triangulations for sea surface reconstruction. J. Comput. Geom. Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
2022	J	`jnl`	The limit of L CoRR Herman J. Haverkort, Rolf Klein
2021	—	`conf`	Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert
2021	J	`jnl`	Hyperbolae are the locus of constant angle difference. CoRR Herman J. Haverkort, Rolf Klein
2020	J	`jnl`	How to play hot and cold. Comput. Geom. Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald
2020	A*	`conf`	Plane-Filling Trails (Media Exposition). SoCG Herman J. Haverkort
2020	J	`jnl`	Plane-filling trails. CoRR Herman J. Haverkort
2020	—	`conf`	Restricted-Weight Minimum-Dilation Spanners on Three Points. CCCG Kevin Buchin, Herman J. Haverkort, Hidde Koerts
2019	C	`conf`	Shortest-Path-Preserving Rounding. IWOCA Herman J. Haverkort, David Kübel, Elmar Langetepe
2019	J	`jnl`	Shortest-Path-Preserving Rounding. CoRR Herman J. Haverkort, David Kübel, Elmar Langetepe
2018	J	`jnl`	A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains. CoRR Herman J. Haverkort, Laura Toma
2018	J	`jnl`	Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time - a proof by reduction from epsilon-closeness. CoRR Herman J. Haverkort
2018	J	`jnl`	No acute tetrahedron is an 8-reptile. Discret. Math. Herman J. Haverkort
2018	J	`jnl`	Reptilings and space-filling curves for acute triangles. Discret. Comput. Geom. Marinus Gottschau, Herman J. Haverkort, Kilian Matzke
2017	J	`jnl`	How many three-dimensional Hilbert curves are there? J. Comput. Geom. Herman J. Haverkort
2017	B	`conf`	How to Play Hot and Cold on a Line. WADS Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald
2017	J	`jnl`	Sixteen space-filling curves and traversals for d-dimensional cubes and simplices. CoRR Herman J. Haverkort
2016	J	`jnl`	How many three-dimensional Hilbert curves are there? CoRR Herman J. Haverkort
2016	J	`jnl`	Hyperorthogonal well-folded Hilbert curves. J. Comput. Geom. Arie Bos, Herman J. Haverkort
2016	—	`ch.`	Quadtrees and Morton Indexing. Encyclopedia of Algorithms Herman J. Haverkort, Laura Toma
2015	A*	`conf`	Hyperorthogonal Well-Folded Hilbert Curves. SoCG Arie Bos, Herman J. Haverkort
2015	J	`jnl`	Hyperorthogonal well-folded Hilbert curves. CoRR Arie Bos, Herman J. Haverkort
2015	J	`jnl`	No acute tetrahedron is an 8-reptile. CoRR Herman J. Haverkort
2014	—	`ch.`	Terrain Modeling for the Geosciences. Computing Handbook, 3rd ed. (1) Herman J. Haverkort, Laura Toma
2013	B	`conf`	An Edge Quadtree for External Memory. SEA Herman J. Haverkort, Mark McGranaghan, Laura Toma
2013	J	`jnl`	Flow computations on imprecise terrains. J. Comput. Geom. Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira
2013	—	`conf`	On IO-efficient viewshed algorithms and their accuracy. SIGSPATIAL/GIS Herman J. Haverkort, Laura Toma, Bob PoFang Wei
2012	A	`conf`	Drawing Metro Maps Using Bézier Curves. GD Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff
2012	—	`conf`	Efficient external-memory bisimulation on DAGs. SIGMOD Conference Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort
2012	—	`conf`	Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis
2012	J	`jnl`	Harmonious Hilbert curves and other extradimensional space-filling curves CoRR Herman J. Haverkort
2012	J	`jnl`	I/O-optimal algorithms on grid graphs CoRR Herman J. Haverkort
2012	J	`jnl`	Simple I/O-efficient flow accumulation on grid terrains CoRR Herman J. Haverkort, Jeffrey Janssen
2011	J	`jnl`	An inventory of three-dimensional Hilbert space-filling curves CoRR Herman J. Haverkort
2011	J	`jnl`	Flow Computations on Imprecise Terrains CoRR Anne Driemel, Herman J. Haverkort, Maarten Löffler
2011	B	`conf`	Flow Computations on Imprecise Terrains. WADS Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira
2011	—	`conf`	Flow on noisy terrains: an experimental evaluation. GIS Herman J. Haverkort, Constantinos P. Tsirogiannis
2011	J	`jnl`	Four-dimensional hilbert curves for R-trees. ACM J. Exp. Algorithmics Herman J. Haverkort, Freek van Walderveen
2011	J	`jnl`	I/O efficient bisimulation partitioning on very large directed acyclic graphs CoRR Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort
2011	J	`jnl`	I/O-Efficient Algorithms on Near-Planar Graphs. J. Graph Algorithms Appl. Herman J. Haverkort, Laura Toma
2011	A*	`conf`	Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2011	J	`jnl`	Recursive tilings and space-filling curves with little fragmentation. J. Comput. Geom. Herman J. Haverkort
2011	A	`conf`	Shortest-Paths Preserving Metro Maps. GD Tal Milea, Okke Schrijvers, Kevin Buchin, Herman J. Haverkort
2010	J	`jnl`	Algorithmic Aspects of Proportional Symbol Maps. Algorithmica Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
2010	J	`jnl`	Locality and bounding-box quality of two-dimensional space-filling curves. Comput. Geom. Herman J. Haverkort, Freek van Walderveen
2010	J	`jnl`	Recursive tilings and space-filling curves with little fragmentation CoRR Herman J. Haverkort
2010	J	`jnl`	Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma
2010	J	`jnl`	The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
2010	J	`jnl`	Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. J. Comput. Geom. Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2009	J	`jnl`	Algorithms for Multi-Criteria Boundary Labeling. J. Graph Algorithms Appl. Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg
2009	J	`jnl`	Cache-Oblivious R-Trees. Algorithmica Lars Arge, Mark de Berg, Herman J. Haverkort
2009	J	`jnl`	Efficient c-oriented range searching with DOP-trees. Comput. Geom. Mark de Berg, Herman J. Haverkort, Micha Streppel
2009	A	`conf`	Four-Dimensional Hilbert Curves for R-Trees. ALENEX Herman J. Haverkort, Freek van Walderveen
2009	—	`conf`	Improved visibility computation on massive grid terrains. GIS Jeremy Fishman, Herman J. Haverkort, Laura Toma
2009	—	`conf`	Visibility maps of realistic terrains have linear smoothed complexity. SCG Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2008	J	`jnl`	Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. Otfried Cheong, Herman J. Haverkort, Mira Lee
2008	J	`jnl`	Computing visibility on terrains in external memory. ACM J. Exp. Algorithmics Herman J. Haverkort, Laura Toma, Yi Zhuang
2008	J	`jnl`	Constructing minimum-interference networks. Comput. Geom. Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
2008	J	`jnl`	Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves CoRR Herman J. Haverkort, Freek van Walderveen
2008	A	`conf`	Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. ESA Herman J. Haverkort, Freek van Walderveen
2008	J	`jnl`	Sparse geometric graphs with small dilation. Comput. Geom. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
2008	J	`jnl`	The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2007	A	`conf`	Algorithms for Multi-criteria One-Sided Boundary Labeling. GD Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg
2007	A	`conf`	Computing Visibility on Terrains in External Memory. ALENEX Herman J. Haverkort, Laura Toma, Yi Zhuang
2007	J	`jnl`	Computing a Minimum-Dilation Spanning Tree is NP-hard CoRR Otfried Cheong, Herman J. Haverkort, Mira Lee
2007	—	`conf`	Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS Otfried Cheong, Herman J. Haverkort, Mira Lee
2007	B	`conf`	I/O-Efficient Flow Modeling on Fat Terrains. WADS Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
2007	B	`conf`	I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma
2007	J	`jnl`	Sparse geometric graphs with small dilation CoRR Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
2006	A	`conf`	Algorithmic Aspects of Proportional Symbol Maps. ESA Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
2006	J	`jnl`	Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. Algorithmica Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
2006	B	`conf`	Constructing Interference-Minimal Networks. SOFSEM Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
2006	B	`conf`	I/O-Efficient Algorithms on Near-Planar Graphs. LATIN Herman J. Haverkort, Laura Toma
2005	—	`conf`	Cache-oblivious r-trees. SCG Lars Arge, Mark de Berg, Herman J. Haverkort
2005	J	`jnl`	Constrained higher order Delaunay triangulations. Comput. Geom. Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld
2005	C	`conf`	Constructing interference-minimal networks. EuroCG Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
2005	A	`conf`	Efficient c-Oriented Range Searching with DOP-Trees. ESA Mark de Berg, Herman J. Haverkort, Micha Streppel
2005	B	`conf`	Multiple Polyline to Polygon Matching. ISAAC Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort
2005	J	`jnl`	Optimal spanners for axis-aligned rectangles. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
2005	B	`conf`	Sparse Geometric Graphs with Small Dilation. ISAAC Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
2004	J	`jnl`	Box-trees for collision checking in industrial installations. Comput. Geom. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
2004	J	`jnl`	Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
2004	—	`conf`	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2004	—	`conf`	The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2003	B	`conf`	On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. ISAAC Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
2003	B	`conf`	Significant-Presence Range Queries in Categorical Data. WADS Mark de Berg, Herman J. Haverkort
2002	J	`jnl`	Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
2002	—	`conf`	Box-trees for collision checking in industrial installations. SCG Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
2002	—	`conf`	Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
2001	—	`conf`	Box-trees and R-trees with near-optimal query time. SCG Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
1999	—	`conf`	Finding a minimal tree in a polygon with its medial axis. CCCG Herman J. Haverkort, Hans L. Bodlaender