Recursive tilings and space-filling curves with little fragmentation

H.J. Haverkort

Research output: Contribution to journalArticleAcademicpeer-review

87 Downloads (Pure)

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 can be applied to optimize 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. 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
Pages (from-to)92-127
JournalJournal of Computational Geometry
Volume2
Issue number1
Publication statusPublished - 2011

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

Cite this