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?
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.Sign up to join this community