Minimal enclosing parallelepiped in 3D (Q1886236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2116163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal enclosing parallelepiped in 3D |
scientific article; zbMATH DE number 2116163 |
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
0.86408776
0 references
0.8567013
0 references
0.8545177
0 references
0.8544799
0 references
0 references
0.85154104
0 references
