Minimal enclosing parallelepiped in 3D (Q1886236)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal enclosing parallelepiped in 3D |
scientific article |
Statements
Minimal enclosing parallelepiped in 3D (English)
0 references
18 November 2004
0 references
Given a set of \(n\) points in a three dimensional Euclidean space, find a parallelepid with minimum volume to contain all \(n\) given points. Two algorithms are presented to solve the above problem in \(O(n^6)\) time.
0 references
enclosing parallelepid
0 references
minimization
0 references
