Z-order curve
In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space filling curve, Morton order or Morton code map multidimensional data to one dimension while preserving locality of the data points. It is named after , who first applied the order to file sequencing in 1966. The z-value of a point in multidimensions is simply calculated by interleaving the binary representations of its coordinate values. Once the data are sorted into this ordering, any one-dimensional data structure can be used such as binary search trees, B-trees, skip lists or (with low significant bits truncated) hash tables. The resulting ordering can equivalently be described as the order one would get from a depth-first traversal of a quadtree or octree.
Bx-treeCache (computing)Direct3DDiscrete global gridDomino tilingFractalGeoMesaGeohashGeohash-36Glossary of computer graphicsHilbert R-treeHilbert curveInterleave sequenceInterleavingList of data structuresList of fractals by Hausdorff dimensionList of mathematical shapesMatrix representationMemory access patternMoore curveMorton-orderMorton-order matrix representationMorton-order matrix representionMorton codeMorton number (number theory)Morton orderMoser–De Bruijn sequenceOrder (mathematics)PVRTCQuadtreeQuater-imaginary baseRow- and column-major orderSpace-filling curveSpatial databaseSpatiotemporal databaseStrassen algorithmSwizzled texturesSwizzling (computer graphics)Texture SwizzlingTexture mapping
Link from a Wikipage to another Wikipage
primaryTopic
Z-order curve
In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space filling curve, Morton order or Morton code map multidimensional data to one dimension while preserving locality of the data points. It is named after , who first applied the order to file sequencing in 1966. The z-value of a point in multidimensions is simply calculated by interleaving the binary representations of its coordinate values. Once the data are sorted into this ordering, any one-dimensional data structure can be used such as binary search trees, B-trees, skip lists or (with low significant bits truncated) hash tables. The resulting ordering can equivalently be described as the order one would get from a depth-first traversal of a quadtree or octree.
has abstract
Die Z-Kurve (Lebesgue-Kurve, e ...... it dem zweidimensionalen Fall.
@de
En mathématiques, et plus préc ...... onc une courbe de remplissage.
@fr
In mathematical analysis and c ...... ersal of a quadtree or octree.
@en
La corba de Lebesgue és una co ...... de profunditat d'un quadtree.
@ca
Mortonův rozklad (též Mortonov ...... vil zaměstnanec kanadské IBM .
@cs
В математическом анализе и инф ...... м в глубину дерева квадрантов.
@ru
解析学、計算機科学、数学的な関数など分野ごとに、 Z階数、 ...... 用可能となる。これは 4分木 の深度優先探索とも等価である。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,936,082
Link from a Wikipage to another Wikipage
direction
vertical
@en
footer
Z-order curve iterations extended to three dimensions.
@en
image
@en
@en
wikiPageUsesTemplate
subject
hypernym
comment
Die Z-Kurve (Lebesgue-Kurve, e ...... it dem zweidimensionalen Fall.
@de
En mathématiques, et plus préc ...... onc une courbe de remplissage.
@fr
In mathematical analysis and c ...... ersal of a quadtree or octree.
@en
La corba de Lebesgue és una co ...... s de cerca binària, arbres B,
@ca
Mortonův rozklad (též Mortonov ...... vil zaměstnanec kanadské IBM .
@cs
В математическом анализе и инф ...... м в глубину дерева квадрантов.
@ru
解析学、計算機科学、数学的な関数など分野ごとに、 Z階数、 ...... 用可能となる。これは 4分木 の深度優先探索とも等価である。
@ja
label
Corba de Lebesgue
@ca
Courbe de Lebesgue
@fr
Mortonův rozklad
@cs
Z-Kurve
@de
Z-order curve
@en
Z階数曲線
@ja
Кривая Мортона
@ru