The following pages link to Selecting distances in the plane (Q2366232):
Displaying 15 items.
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
- Bottleneck matching in the plane (Q6103175) (← links)
