The following pages link to Jan Vahrenhold (Q390104):
Displayed 26 items.
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) (Q390105) (← links)
- An in-place algorithm for Klee's measure problem in two dimensions (Q845997) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Item:Q390104 (redirect page) (← links)
- Efficient bulk operations on dynamic \(R\)-trees (Q1601035) (← links)
- Resilient \(k\)-d trees: \(k\)-means in space revisited (Q1762186) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case (Q2248735) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Subquadratic medial-axis approximation in $\mathbb{R}^3$ (Q2970424) (← links)
- In-Place Randomized Slope Selection (Q3434540) (← links)
- (Q4428994) (← links)
- Approximate Shortest Distances Among Smooth Obstacles in 3D (Q4636544) (← links)
- (Q4778542) (← links)
- (Q4956074) (← links)
- (Q5207875) (← links)
- Terracost (Q5269277) (← links)
- I/O-efficient dynamic planar point location (extended abstract) (Q5361530) (← links)
- Algorithms and Data Structures (Q5394245) (← links)
- I/O-Efficiently Pruning Dense Spanners (Q5449759) (← links)
- Planar point location for large data sets (Q5463434) (← links)
- In-Place Algorithms for Computing (Layers of) Maxima (Q5757902) (← links)
- Klee's measure problem made oblivious (Q6109000) (← links)