A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:36, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight lower bound for computing the diameter of a 3D convex polytope |
scientific article |
Statements
A tight lower bound for computing the diameter of a 3D convex polytope (English)
0 references
28 November 2007
0 references
Computational geometry
0 references
Lower bound
0 references
Diameter
0 references
Convex polytope
0 references
Hopcroft's problem
0 references
