Pages that link to "Item:Q5932809"

The following pages link to An efficient algorithm for the three-dimensional diameter problem (Q5932809):

Displaying 2 items.

• Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
• A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)