The following pages link to Otfried Schwarzkopf (Q1175645):
Displaying 50 items.
- Finding a guard that sees most and a shop that sells most (Q2369935) (← links)
- The Hadwiger number of Jordan regions is unbounded (Q2369936) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Helly-type theorems for line transversals to disjoint unit balls (Q2482201) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- Casting with skewed ejection direction (Q2498406) (← links)
- The Voronoi diagram of curved objects (Q2572594) (← links)
- Fitting a graph to one-dimensional data (Q2663044) (← links)
- The reverse Kakeya problem (Q2664125) (← links)
- (Q2753947) (← links)
- Lower Bounds for Pinning Lines by Balls (Extended Abstract) (Q2851518) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- The Cost of Bounded Curvature (Q2914329) (← links)
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION (Q2999092) (← links)
- (Q3132843) (← links)
- (Q3132899) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS (Q3136224) (← links)
- (Q3355263) (← links)
- Computation of Non-dominated Points Using Compact Voronoi Diagrams (Q3404431) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- Farthest-Polygon Voronoi Diagrams (Q3527230) (← links)
- I/O-Efficient Flow Modeling on Fat Terrains (Q3603530) (← links)
- (Q3619940) (← links)
- CONSTRUCTING OPTIMAL HIGHWAYS (Q3620612) (← links)
- (Q4023736) (← links)
- Computing and Verifying Depth Orders (Q4291567) (← links)
- (Q4344150) (← links)
- Computing Many Faces in Arrangements of Lines and Segments (Q4388883) (← links)
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams (Q4388891) (← links)
- (Q4401024) (← links)
- (Q4425962) (← links)
- (Q4551357) (← links)
- (Q4553235) (← links)
- The one-round Voronoi game (Q4557542) (← links)
- Placing your Coins on a Shelf (Q4626296) (← links)
- Weight Balancing on Boundaries and Skeletons (Q4635568) (← links)
- Computing and Combinatorics (Q4681184) (← links)
- REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY (Q4682175) (← links)
- (Q4761861) (← links)
- CUTTINGS AND APPLICATIONS (Q4858649) (← links)
- A Fast Algorithm for Data Collection along a Fixed Track (Q4925227) (← links)
- (Q4947407) (← links)
- (Q5077652) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
- The Reverse Kakeya Problem (Q5115773) (← links)
- Placing your Coins on a Shelf (Q5136217) (← links)
- (Q5136224) (← links)
- Covering many points with a small-area box (Q5233323) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q5248517) (← links)
