Performance of multi-dimensional space-filling curves

Mohamed Mokbel, Walid G. Aref, Ibrahim Kamel

Research output: Contribution to conferencePaper

21 Citations (Scopus)

Abstract

A space-filling curve is a way of mapping the multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the D-dimensional space so that every cell is visited exactly once. There are numerous kinds of space-filling curves. The difference between such curves is in their way of mapping to the one-dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space-filling curve. A space-filling curve consists of a set of segments. Each segment connects two consecutive multi-dimensional points. Five different types of segments are distinguished, namely, Jump, Contiguity, Reverse, Forward, and Still. A description vector V = (J,C,R,F,S), where J,C,R,F, and S, are the percentages of Jump, Contiguity, Reverse, Forward, and Still segments in the space-filling curve, encapsulates all the properties of a space-filling curve. The knowledge of V facilitates the process of selecting the appropriate space-filling curve for different applications. Closed formulas are developed to compute the description vector V for any D-dimensional space and grid size N for different space-filling curves. A comparative study of different space-filling curves with respect to the description vector is conducted and results are presented and discussed.

Original languageEnglish
Pages149-154
Number of pages6
Publication statusPublished - 1 Dec 2002
Externally publishedYes
EventTenth ACM International Symposium on Advances in Geographic Information Systems - McLean, VA, United States
Duration: 8 Nov 20029 Nov 2002

Other

OtherTenth ACM International Symposium on Advances in Geographic Information Systems
CountryUnited States
CityMcLean, VA
Period8/11/029/11/02

Fingerprint

Pixels

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Mokbel, M., Aref, W. G., & Kamel, I. (2002). Performance of multi-dimensional space-filling curves. 149-154. Paper presented at Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA, United States.

Performance of multi-dimensional space-filling curves. / Mokbel, Mohamed; Aref, Walid G.; Kamel, Ibrahim.

2002. 149-154 Paper presented at Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA, United States.

Research output: Contribution to conferencePaper

Mokbel, M, Aref, WG & Kamel, I 2002, 'Performance of multi-dimensional space-filling curves' Paper presented at Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA, United States, 8/11/02 - 9/11/02, pp. 149-154.
Mokbel M, Aref WG, Kamel I. Performance of multi-dimensional space-filling curves. 2002. Paper presented at Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA, United States.
Mokbel, Mohamed ; Aref, Walid G. ; Kamel, Ibrahim. / Performance of multi-dimensional space-filling curves. Paper presented at Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA, United States.6 p.
@conference{92f37b46a22b4922aa8e0c11c7d14e7f,
title = "Performance of multi-dimensional space-filling curves",
abstract = "A space-filling curve is a way of mapping the multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the D-dimensional space so that every cell is visited exactly once. There are numerous kinds of space-filling curves. The difference between such curves is in their way of mapping to the one-dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space-filling curve. A space-filling curve consists of a set of segments. Each segment connects two consecutive multi-dimensional points. Five different types of segments are distinguished, namely, Jump, Contiguity, Reverse, Forward, and Still. A description vector V = (J,C,R,F,S), where J,C,R,F, and S, are the percentages of Jump, Contiguity, Reverse, Forward, and Still segments in the space-filling curve, encapsulates all the properties of a space-filling curve. The knowledge of V facilitates the process of selecting the appropriate space-filling curve for different applications. Closed formulas are developed to compute the description vector V for any D-dimensional space and grid size N for different space-filling curves. A comparative study of different space-filling curves with respect to the description vector is conducted and results are presented and discussed.",
author = "Mohamed Mokbel and Aref, {Walid G.} and Ibrahim Kamel",
year = "2002",
month = "12",
day = "1",
language = "English",
pages = "149--154",
note = "Tenth ACM International Symposium on Advances in Geographic Information Systems ; Conference date: 08-11-2002 Through 09-11-2002",

}

TY - CONF

T1 - Performance of multi-dimensional space-filling curves

AU - Mokbel, Mohamed

AU - Aref, Walid G.

AU - Kamel, Ibrahim

PY - 2002/12/1

Y1 - 2002/12/1

N2 - A space-filling curve is a way of mapping the multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the D-dimensional space so that every cell is visited exactly once. There are numerous kinds of space-filling curves. The difference between such curves is in their way of mapping to the one-dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space-filling curve. A space-filling curve consists of a set of segments. Each segment connects two consecutive multi-dimensional points. Five different types of segments are distinguished, namely, Jump, Contiguity, Reverse, Forward, and Still. A description vector V = (J,C,R,F,S), where J,C,R,F, and S, are the percentages of Jump, Contiguity, Reverse, Forward, and Still segments in the space-filling curve, encapsulates all the properties of a space-filling curve. The knowledge of V facilitates the process of selecting the appropriate space-filling curve for different applications. Closed formulas are developed to compute the description vector V for any D-dimensional space and grid size N for different space-filling curves. A comparative study of different space-filling curves with respect to the description vector is conducted and results are presented and discussed.

AB - A space-filling curve is a way of mapping the multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the D-dimensional space so that every cell is visited exactly once. There are numerous kinds of space-filling curves. The difference between such curves is in their way of mapping to the one-dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space-filling curve. A space-filling curve consists of a set of segments. Each segment connects two consecutive multi-dimensional points. Five different types of segments are distinguished, namely, Jump, Contiguity, Reverse, Forward, and Still. A description vector V = (J,C,R,F,S), where J,C,R,F, and S, are the percentages of Jump, Contiguity, Reverse, Forward, and Still segments in the space-filling curve, encapsulates all the properties of a space-filling curve. The knowledge of V facilitates the process of selecting the appropriate space-filling curve for different applications. Closed formulas are developed to compute the description vector V for any D-dimensional space and grid size N for different space-filling curves. A comparative study of different space-filling curves with respect to the description vector is conducted and results are presented and discussed.

UR - http://www.scopus.com/inward/record.url?scp=0038305063&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038305063&partnerID=8YFLogxK

M3 - Paper

SP - 149

EP - 154

ER -