Recursive tilings and space-filling curves with little fragmentation

H.J. Haverkort

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

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 languageEnglish
Title of host publicationAbstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)
EditorsJ. Vahrenhold
Place of PublicationDortmund
PublisherTechnische Universität Dortmund
Pages185-188
Publication statusPublished - 2010
Event26th European Workshop on Computational Geometry (EuroCG 2010) - Dortmund
Duration: 22 Mar 201024 Mar 2010
Conference number: 26
http://eurocg.org/

Workshop

Workshop26th European Workshop on Computational Geometry (EuroCG 2010)
Abbreviated titleEuroCG 2010
CityDortmund
Period22/03/1024/03/10
Internet address

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

Cite this