Pages that link to "Item:Q5361540"
From MaRDI portal
The following pages link to Deterministic algorithms for 3-D diameter and some 2-D lower envelopes (Q5361540):
Displayed 5 items.
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- (Q5090454) (← links)
- An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)