# 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 also

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"
        }
    ]

## Options

where

  An expression that limits points passed to a filter. Points that don’t pass the expression skip the stage but are available to subsequent stages in a pipeline. [Default: no filtering]

where_merge

  A strategy for merging points skipped by a ‘where’ option when running in standard mode. If `true`, the skipped points are added to the first point view returned by the skipped filter. If `false`, skipped points are placed in their own point view. If `auto`, skipped points are merged into the returned point view provided that only one point view is returned and it has the same point count as it did when the filter was run. [Default: `auto`]