# filters.mortonorder¶

Sorts the XY data using Morton ordering.

It’s also possible to compute a reverse Morton code by reading the binary representation from the end to the beginning. This way, points are sorted with a good dispersement. For example, by successively selecting N representative points within tiles:

See LOPoCS and pgmorton for some use case examples of the Reverse Morton algorithm.

Default Embedded Stage

This stage is enabled by default

## Example¶

[
"uncompressed.las",
{
"type":"filters.mortonorder",
"reverse":"false"
},
{
"type":"writers.las",
"filename":"compressed.laz",
"compression":"true"
}
]


None.