On finding a large number of 3D points with a small diameter (Q2457016)
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: On finding a large number of 3D points with a small diameter |
scientific article; zbMATH DE number 5206106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding a large number of 3D points with a small diameter |
scientific article; zbMATH DE number 5206106 |
Statements
On finding a large number of 3D points with a small diameter (English)
0 references
29 October 2007
0 references
Clustering
0 references
approximation algorithms
0 references
computational geometry
0 references
universal cover
0 references
Borsuk's conjecture
0 references
0 references
0 references
0 references
0.8000183701515198
0 references
0.7922079563140869
0 references
0.789910078048706
0 references
0.7828518748283386
0 references
