The following pages link to (Q4225312):
Displayed 9 items.
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491) (← links)
- Finding efficient solutions for rectilinear distance location problems efficiently (Q1148204) (← links)
- Finding the intersection of n half-spaces in time O(n log n) (Q1260355) (← links)
- Gathering by repulsion (Q2206731) (← links)
- On farthest Voronoi cells (Q2332415) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- On farthest Bregman Voronoi cells (Q5077159) (← links)
- Loop invariants (Q5176169) (← links)
- Hamiltonicity for convex shape Delaunay and Gabriel graphs (Q5918982) (← links)