The following pages link to Otfried Schwarzkopf (Q1175645):
Displaying 50 items.
- (Q247174) (redirect page) (← links)
- (Q1271280) (redirect page) (← links)
- (Q1380818) (redirect page) (← links)
- Geometric permutations of non-overlapping unit balls revisited (Q265727) (← links)
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- A generalization of the convex Kakeya problem (Q486985) (← links)
- The number of holes in the union of translates of a convex set in three dimensions (Q512258) (← links)
- Lines pinning lines (Q629835) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Reaching a goal with directional uncertainty (Q673767) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Set systems and families of permutations with small traces (Q691581) (← links)
- Hierarchical decompositions and circular ray shooting in simple polygons (Q705130) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- A note on the perimeter of fat objects (Q709064) (← links)
- A fast algorithm for data collection along a fixed track (Q744105) (← links)
- Smallest universal covers for families of triangles (Q827315) (← links)
- Computation of spatial skyline points (Q827323) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Finding largest rectangles in convex polygons (Q902427) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q1271283) (← links)
- Range searching in low-density environments (Q1350104) (← links)
- Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces (Q1380819) (← links)
- Approximation of convex figures by pairs of rectangles (Q1388135) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Casting a polyhedron with directional uncertainty (Q1405007) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- The one-round Voronoi game (Q1424320) (← links)
- The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
- Lower bounds to Helly numbers of line transversals to disjoint congruent balls (Q1760398) (← links)
- Geometric permutations of disjoint unit spheres (Q1776899) (← links)
- Voronoi diagrams on the sphere (Q1862122) (← links)
- Building bridges between convex regions (Q1873160) (← links)
- Competitive facility location: the Voronoi game (Q1884986) (← links)
- Piecewise linear paths among convex obstacles (Q1894717) (← links)
- Bounds on the size of merging networks (Q1897347) (← links)
- The overlay of lower envelopes and its applications (Q1907607) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- The cost of bounded curvature (Q1947977) (← links)
- The inverse Kakeya problem (Q2077897) (← links)
- The complexity of flow on fat terrains and its i/o-efficient computation (Q2269137) (← links)
- Packing 2D disks into a 3D container (Q2327534) (← links)
