Pages that link to "Item:Q2461545"
From MaRDI portal
The following pages link to A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545):
Displaying 5 items.
- Computing hereditary convex structures (Q540446) (← links)
- Improving bounds on the diameter of a polyhedron in high dimensions (Q2359957) (← links)
- (Q3031546) (← links)
- Breaking the 3/2 Barrier for Unit Distances in Three Dimensions (Q5206099) (← links)
- An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)