Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length |
scientific article |
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
