Herman J. Haverkort

Rolf Klein

Discret. Comput. Geom., 2024

2022

Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface.

[BibT_eX]

[DOI]

CoRR, 2022

The limit of L<sub>p</sub> Voronoi diagrams as p→0 is the bounding-box-area Voronoi diagram.

[BibT_eX]

[DOI]

Rolf Klein

CoRR, 2022

Minimum-Error Triangulations for Sea Surface Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Hyperbolae are the locus of constant angle difference.

[BibT_eX]

[DOI]

Rolf Klein

CoRR, 2021

Bicriteria Aggregation of Polygons via Graph Cuts.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

2020

Plane-filling trails.

[BibT_eX]

[DOI]

CoRR, 2020

How to play hot and cold.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Plane-Filling Trails (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Restricted-Weight Minimum-Dilation Spanners on Three Points.

[BibT_eX]

Kevin Buchin

Hidde Koerts

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Shortest-Path-Preserving Rounding.

[BibT_eX]

[DOI]

David Kübel

Elmar Langetepe

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

No acute tetrahedron is an 8-reptile.

[BibT_eX]

[DOI]

Discret. Math., 2018

Reptilings and space-filling curves for acute triangles.

[BibT_eX]

[DOI]

Marinus Gottschau

Kilian Matzke

Discret. Comput. Geom., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

How many three-dimensional Hilbert curves are there?

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

How to Play Hot and Cold on a Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Quadtrees and Morton Indexing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2015

Hyperorthogonal Well-Folded Hilbert Curves.

[BibT_eX]

[DOI]

Arie Bos

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Terrain Modeling for the Geosciences.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

An Edge Quadtree for External Memory.

[BibT_eX]

[DOI]

Mark McGranaghan

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On IO-efficient viewshed algorithms and their accuracy.

[BibT_eX]

[DOI]

Bob PoFang Wei

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012

I/O-optimal algorithms on grid graphs

[BibT_eX]

[DOI]

CoRR, 2012

Simple I/O-efficient flow accumulation on grid terrains

[BibT_eX]

[DOI]

Jeffrey Janssen

CoRR, 2012

Harmonious Hilbert curves and other extradimensional space-filling curves

[BibT_eX]

[DOI]

CoRR, 2012

Efficient external-memory bisimulation on DAGs.

[BibT_eX]

[DOI]

Jelle Hellings

George H. L. Fletcher

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Fast generation of multiple resolution instances of raster data sets.

[BibT_eX]

[DOI]

Lars Arge

Constantinos Tsirogiannis

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.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Recursive tilings and space-filling curves with little fragmentation.

[BibT_eX]

[DOI]

J. Comput. Geom., 2011

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

[BibT_eX]

[DOI]

Jelle Hellings

George H. L. Fletcher

CoRR, 2011

Flow Computations on Imprecise Terrains

[BibT_eX]

[DOI]

Anne Driemel

Maarten Löffler

CoRR, 2011

An inventory of three-dimensional Hilbert space-filling curves

[BibT_eX]

[DOI]

CoRR, 2011

Flow Computations on Imprecise Terrains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures.

[BibT_eX]

[DOI]

Constantinos P. Tsirogiannis

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Flow on noisy terrains: an experimental evaluation.

[BibT_eX]

[DOI]

Constantinos P. Tsirogiannis

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Shortest-Paths Preserving Metro Maps.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

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

[BibT_eX]

[DOI]

Comput. Geom., 2010

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

[BibT_eX]

[DOI]

Comput. Geom., 2010

2009

Algorithms for Multi-Criteria Boundary Labeling.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Improved visibility computation on massive grid terrains.

[BibT_eX]

[DOI]

Jeremy Fishman

Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

Visibility maps of realistic terrains have linear smoothed complexity.

[BibT_eX]

[DOI]

Constantinos P. Tsirogiannis

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Four-Dimensional Hilbert Curves for R-Trees.

[BibT_eX]

[DOI]

Freek van Walderveen

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

Constructing minimum-interference networks.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Sparse geometric graphs with small dilation.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves.

[BibT_eX]

[DOI]

Freek van Walderveen

Proceedings of the Algorithms, 2008

2007

I/O-Efficient Flow Modeling on Fat Terrains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Algorithms for Multi-criteria One-Sided Boundary Labeling.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Computing a Minimum-Dilation Spanning Tree is NP-hard.

[BibT_eX]

[DOI]

Otfried Cheong

Mira Lee

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

Computing Visibility on Terrains in External Memory.

[BibT_eX]

[DOI]

Yi Zhuang

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Constructing Interference-Minimal Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

I/O-Efficient Algorithms on Near-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Algorithmic Aspects of Proportional Symbol Maps.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Constrained higher order Delaunay triangulations.

[BibT_eX]

[DOI]

Joachim Gudmundsson

Marc J. van Kreveld

Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Multiple Polyline to Polygon Matching.

[BibT_eX]

[DOI]

Mirela Tanase

Remco C. Veltkamp

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Sparse Geometric Graphs with Small Dilation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Efficient c-Oriented Range Searching with DOP-Trees.

[BibT_eX]

[DOI]

Micha Streppel

Proceedings of the Algorithms, 2005

Cache-oblivious r-trees.

[BibT_eX]

[DOI]

Lars Arge

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.

[BibT_eX]

[DOI]

Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

2003

Significant-Presence Range Queries in Categorical Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts.

[BibT_eX]

[DOI]

Jae-Sook Cheong

A. Frank van der Stappen

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Box-trees for collision checking in industrial installations.

[BibT_eX]

[DOI]

Joachim Gudmundsson

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Facility Location and the Geometric Minimum-Diameter Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Box-trees and R-trees with near-optimal query time.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

1999

Finding a minimal tree in a polygon with its medial axis.

[BibT_eX]

[DOI]