Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042)
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 6561930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length |
scientific article; zbMATH DE number 6561930 |
Statements
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (English)
0 references
1 April 2016
0 references
quadtree complexity theorem
0 references
digital cover cardinality
0 references
rectifiable curve
0 references
length
0 references
0 references
0.8781532
0 references
0.8485254
0 references
0.84346926
0 references
0.8404293
0 references
0.8388801
0 references
0.8383681
0 references
0.8372804
0 references
