A polyhedron is given as a set of its vertex coordinates. Is it possible to find its diameter faster than $O(n^2)$?

Or, maybe, some another common polyhedron representation would help fasten this?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.