The following pages link to Herman J. Haverkort (Q1776900):
Displayed 50 items.
- (Q706724) (redirect page) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- Reptilings and space-filling curves for acute triangles (Q724950) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- Locality and bounding-box quality of two-dimensional space-filling curves (Q1037780) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- No acute tetrahedron is an 8-reptile (Q1699564) (← links)
- Constrained higher order Delaunay triangulations (Q1776901) (← links)
- (Q1849439) (redirect page) (← links)
- Box-trees and R-trees with near-optimal query time (Q1849440) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← links)
- How to play hot and cold (Q2173459) (← links)
- The complexity of flow on fat terrains and its i/o-efficient computation (Q2269137) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- Shortest-path-preserving rounding (Q2301750) (← links)
- How to play hot and cold on a line (Q2405303) (← links)
- Computing all immobilizing grasps of a simple polygon with few contacts (Q2492631) (← links)
- Visibility maps of realistic terrains have linear smoothed complexity (Q2968069) (← links)
- (Q2968078) (← links)
- Flow computations on imprecise terrains (Q2968096) (← links)
- Hyperorthogonal well-folded Hilbert curves (Q2970470) (← links)
- Shortest-Paths Preserving Metro Maps (Q3223983) (← links)
- Algorithms for Multi-Criteria Boundary Labeling (Q3402364) (← links)
- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves (Q3541113) (← links)
- I/O-Efficient Flow Modeling on Fat Terrains (Q3603530) (← links)
- (Q4411284) (← links)
- Box-trees for collision checking in industrial installations (Q4557537) (← links)
- Drawing Metro Maps Using Bézier Curves (Q4912228) (← links)
- The priority R-tree (Q4962701) (← links)
- Algorithmische Geometrie (Q5082244) (← links)
- Algorithms and Computation (Q5191654) (← links)
- Flow Computations on Imprecise Terrains (Q5199256) (← links)
- Four-Dimensional Hilbert Curves for R-Trees (Q5233566) (← links)
- Box-trees and R-trees with near-optimal query time (Q5361567) (← links)
- (Q5365043) (← links)
- Hyperorthogonal Well-Folded Hilbert Curves (Q5368731) (← links)
- Cache-oblivious R-trees (Q5370610) (← links)
- Visibility maps of realistic terrains have linear smoothed complexity (Q5370714) (← links)
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions (Q5387782) (← links)
- Computing visibility on terrains in external memory (Q5406173) (← links)
- Four-dimensional hilbert curves for R-trees (Q5406250) (← links)
- Algorithmic Aspects of Proportional Symbol Maps (Q5449575) (← links)
- Algorithms for Multi-criteria One-Sided Boundary Labeling (Q5452228) (← links)
- Algorithms – ESA 2005 (Q5475861) (← links)
- How many three-dimensional Hilbert curves are there (Q5745393) (← links)
- I/O-Efficient Algorithms on Near-Planar Graphs (Q5891342) (← links)