Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space |
scientific article; zbMATH DE number 6647461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space |
scientific article; zbMATH DE number 6647461 |
Statements
Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (English)
0 references
3 November 2016
0 references
Hausdorff deviation
0 references
best \(n\)-net
0 references
ball cover
0 references
Chebyshev center
0 references
0 references
0.89812094
0 references
0.8966524
0 references
0.89608073
0 references
0.88865054
0 references
0 references
0.8861086
0 references
0.8806814
0 references
0.87684005
0 references
