Pages that link to "Item:Q5248517"
From MaRDI portal
The following pages link to A deterministic algorithm for the three-dimensional diameter problem (Q5248517):
Displaying 6 items.
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Computing minimum-volume enclosing axis-aligned ellipsoids (Q2481119) (← links)
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). (Q2482899) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
