A tight lower bound for computing the diameter of a 3D convex polytope

Keyphrases

• Tight Lower Bound 100%
• Convex Polytope 100%
• Three-dimensional (3D) 50%
• Combinatorial Structure 50%
• Time Algorithm 50%
• Euclidean Distance 50%
• Two-point 50%
• Linear Time 50%
• Tree Model 50%
• Polytope 50%
• Time Reduction 50%
• Vertex Set 50%
• 3-polytope 50%
• Algebraic Computation 50%
• Diameter of a Set 50%
• Computation Tree 50%

Mathematics

• Polytope 100%
• Set Point 66%
• Combinatorial Structure 33%
• Worst Case 33%
• Polyhedron 33%
• Diameter of a set 33%
• Linear Time 33%
• Euclidean Distance 33%