Abstract
This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number a such that any ball Q can be covered by a tiles (or curve fragments) with total volume O(volume(Q)). Recursive tilings and space-filling curves with low Arrwwid
numbers may be applied to optimise disk, memory or server access patterns when processing sets of points in Rd. This paper presents recursive tilings and space-filling curves with optimal Arrwwid numbers. When d >= 3, regular cube tilings and space-??lling curves cannot have optimal Arrwwid number; alternatives with better Arrwwid numbers are presented.
| Original language | English |
|---|---|
| Title of host publication | Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010) |
| Editors | J. Vahrenhold |
| Place of Publication | Dortmund |
| Publisher | Technische Universität Dortmund |
| Pages | 185-188 |
| Publication status | Published - 2010 |
| Event | 26th European Workshop on Computational Geometry (EuroCG 2010) - Dortmund Duration: 22 Mar 2010 → 24 Mar 2010 Conference number: 26 http://eurocg.org/ |
Workshop
| Workshop | 26th European Workshop on Computational Geometry (EuroCG 2010) |
|---|---|
| Abbreviated title | EuroCG 2010 |
| City | Dortmund |
| Period | 22/03/10 → 24/03/10 |
| Internet address |