| Publication | Date of Publication | Type |
|---|
The limit of \(L_p\) Voronoi diagrams as \(p\rightarrow 0\) is the bounding-box-area Voronoi diagram
Discrete & Computational Geometry | 2024-10-25 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2024-05-14 | Paper |
Minimum-error triangulations for sea surface reconstruction
(available as arXiv preprint) | 2023-12-20 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2023-12-20 | Paper |
Plane-Filling Trails (Media Exposition)
(available as arXiv preprint) | 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 |
| Algorithmic geometry. Foundations, methods, applications | 2022-06-15 | Paper |
How to play hot and cold
Computational Geometry | 2020-04-22 | Paper |
Shortest-path-preserving rounding
(available as arXiv preprint) | 2020-02-25 | Paper |
Four-dimensional Hilbert curves for R-trees
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
The priority R-tree: a practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Reptilings and space-filling curves for acute triangles
Discrete & Computational Geometry | 2018-07-26 | Paper |
How many three-dimensional Hilbert curves are there?
(available as arXiv preprint) | 2018-06-05 | Paper |
No acute tetrahedron is an 8-reptile
Discrete Mathematics | 2018-02-23 | Paper |
Cache-oblivious R-trees
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Visibility maps of realistic terrains have linear smoothed complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Hyperorthogonal well-folded Hilbert curves | 2017-10-10 | Paper |
Box-trees and R-trees with near-optimal query time
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Implicit flow routing on terrains with applications to surface networks and drainage structures | 2017-09-29 | Paper |
| How to play hot and cold on a line | 2017-09-22 | Paper |
Hyperorthogonal well-folded Hilbert curves
(available as arXiv preprint) | 2017-03-30 | Paper |
| Flow computations on imprecise terrains | 2017-03-09 | Paper |
| scientific article; zbMATH DE number 6693712 (Why is no real title available?) | 2017-03-09 | Paper |
| Visibility maps of realistic terrains have linear smoothed complexity | 2017-03-09 | Paper |
Four-dimensional hilbert curves for R-trees
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Computing visibility on terrains in external memory
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
I/O-efficient algorithms on near-planar graphs
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Drawing metro maps using Bézier curves
Graph Drawing | 2013-04-03 | Paper |
Shortest-Paths Preserving Metro Maps
Graph Drawing | 2012-03-09 | Paper |
Flow Computations on Imprecise Terrains
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Flow Computations on Imprecise Terrains
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Algorithmic aspects of proportional symbol maps
Algorithmica | 2010-09-27 | Paper |
Significant-presence range queries in categorical data.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry | 2010-03-16 | Paper |
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
Computational Geometry | 2010-03-11 | Paper |
Algorithms for Multi-Criteria Boundary Labeling
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Locality and bounding-box quality of two-dimensional space-filling curves
Computational Geometry | 2009-11-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Cache-oblivious R-trees
Algorithmica | 2009-05-13 | Paper |
I/O-Efficient Flow Modeling on Fat Terrains
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Efficient \(c\)-oriented range searching with DOP-trees
Computational Geometry | 2009-02-12 | Paper |
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Computing a minimum-dilation spanning tree is NP-hard
Computational Geometry | 2008-09-19 | Paper |
I/O-Efficient Algorithms on Near-Planar Graphs
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Constructing minimum-interference networks
Computational Geometry | 2008-06-18 | Paper |
Sparse geometric graphs with small dilation
Computational Geometry | 2008-06-18 | Paper |
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
Algorithms and Computation | 2008-05-27 | Paper |
Algorithms for Multi-criteria One-Sided Boundary Labeling
Graph Drawing | 2008-03-25 | Paper |
Algorithmic Aspects of Proportional Symbol Maps
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing all immobilizing grasps of a simple polygon with few contacts
Algorithmica | 2006-06-14 | Paper |
Constrained higher order Delaunay triangulations
Computational Geometry | 2005-05-12 | Paper |
Optimal spanners for axis-aligned rectangles
Computational Geometry | 2005-02-09 | Paper |
Facility location and the geometric minimum-diameter spanning tree.
Computational Geometry | 2004-01-23 | Paper |
| scientific article; zbMATH DE number 1947054 (Why is no real title available?) | 2003-07-07 | Paper |
Box-trees and R-trees with near-optimal query time
Discrete & Computational Geometry | 2002-12-01 | Paper |
