On the estimation of \(k\)-thickness convex sets (Q2716037)
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 the estimation of \(k\)-thickness convex sets |
scientific article; zbMATH DE number 1601009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the estimation of \(k\)-thickness convex sets |
scientific article; zbMATH DE number 1601009 |
Statements
30 May 2001
0 references
\(k\)-thickness
0 references
convex set
0 references
Haussdorf's distance
0 references
On the estimation of \(k\)-thickness convex sets (English)
0 references
The \(k\)-thickness of convex set \(G\) is defined as the supremum of the sum of Haussdorf's distances between sequential pairs of \(k+1\) imbedded convex subsets of \(G.\) In this paper it is found that the upper and lower bounds of \(k\)-thickness for 2-dimensional sets \(G\) are increasing as \(k^{1/3}.\)
0 references
