The following pages link to Rolf Klein (Q166235):
Displaying 50 items.
- Reprint of: Optimally solving a transportation problem using Voronoi diagrams (Q390172) (← links)
- A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- (Q753492) (redirect page) (← links)
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams (Q753493) (← links)
- A new model in firefighting theory (Q779236) (← links)
- Abstract Voronoi diagrams revisited (Q833716) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- On the geometric dilation of closed curves, graphs, and point sets (Q870424) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- A local strategy for cleaning expanding cellular domains by simple robots (Q888433) (← links)
- A tight upper bound for the path length of AVL trees (Q912600) (← links)
- (Q1007624) (redirect page) (← links)
- Voronoi diagram for services neighboring a highway (Q1007626) (← links)
- The node visit cost of brother trees (Q1098304) (← links)
- A functional relation in stable knot theory (Q1183056) (← links)
- Geometry and robotics. Workshop, Toulouse, France, May 26-28, 1988. Proceedings (Q1187703) (← links)
- Concrete and abstract Voronoi diagrams (Q1188589) (← links)
- Walking an unknown street with bounded detour (Q1194307) (← links)
- How to find a point on a line within a fixed distance (Q1289022) (← links)
- Global asymptotic stability of hybrid position/force control applied to compliant unilateral constraints (Q1301106) (← links)
- Towards dynamic randomized algorithms in computational geometry (Q1310282) (← links)
- A combinatorial property of convex sets (Q1355195) (← links)
- The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- How many lions are needed to clear a grid? (Q1662492) (← links)
- Reversibility properties of the fire-fighting problem in graphs (Q1693325) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- Does a point lie inside a polygon ? (Q1824391) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- A new model and algorithms in firefighting theory (Q2161254) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- Partially walking a polygon (Q2331219) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- Optimally solving a transportation problem using Voronoi diagrams (Q2391547) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- The geometric dilation of finite point sets (Q2492632) (← links)
- The Polygon Exploration Problem (Q2784471) (← links)
- Voronoi Diagrams and Delaunay Triangulations (Q2854053) (← links)
- Abstract Voronoi Diagrams with Disconnected Regions (Q2872095) (← links)
- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane (Q3060767) (← links)
- Tolerant Algorithms (Q3092276) (← links)
