Recursive tilings and space-filling curves with little fragmentation

H.J. Haverkort

Research output: Book/ReportReportAcademic

1 Downloads (Pure)

Abstract

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and space-filling curves with low Arrwwid numbers can be applied to optimise disk, memory or server access patterns when processing sets of points in d-dimensional space. This paper presents recursive tilings and space-filling curves with optimal Arrwwid numbers. For d >= 3, we see that regular cube tilings and space-filling curves cannot have optimal Arrwwid number, and we see how to construct alternatives with better Arrwwid numbers.
Original languageEnglish
Publishers.n.
Number of pages28
Publication statusPublished - 2010

Publication series

NamearXiv.org [cs.CG]
Volume1002.1843

Fingerprint Dive into the research topics of 'Recursive tilings and space-filling curves with little fragmentation'. Together they form a unique fingerprint.

Cite this