Filters operate on data as inline operations. They can remove, modify, reorganize, and add points to the data stream as it goes by. Some filters can only operate on dimensions they understand (consider filters.reprojection doing geographic reprojection on XYZ coordinates), while others do not interrogate the point data at all and simply reorganize or split data.
PDAL filters commonly create new dimensions (e.g.,
alter existing ones (e.g.,
Classification). These filters will not
invalidate an existing KD-tree.
We treat those filters that alter XYZ coordinates separately.
When creating new dimensions, be mindful of the writer you are using and whether or not the custom dimension can be written to disk if that is the desired behavior.
- Estimate pointwise planarity, based on k-nearest neighbors. Returns a new
Coplanarwhere a value of 1 indicates that a point is part of a coplanar neighborhood (0 otherwise).
- Assign values for a dimension range to a specified value.
- Extract and label clusters using Euclidean distance metric. Returns a new
ClusterIDthat indicates the cluster that a point belongs to. Points not belonging to a cluster are given a cluster ID of 0.
- Assign RGB colors based on a dimension and a ramp
- Fetch and assign RGB color information from a GDAL-readable datasource.
- Filter that calculates local features based on the covariance matrix of a point’s neighborhood.
- Compute pointwise eigenvalues, based on k-nearest neighbors.
- Compute pointwise rank, based on k-nearest neighbors.
- Marks low points as noise.
- Copy data from one dimension to another.
- Compute pointwise height above ground estimate. Requires points to be classified as ground/non-ground prior to estimating.
- Compute pointwise Local Outlier Factor (along with K-Distance and Local Reachability Distance).
- Compute a criterion for point neighbors based on the miniball algorithm.
- Update pointwise classification using k-nearest neighbor consensus voting.
- Compute a distance metric based on nearest neighbors.
- Compute pointwise normal and curvature, based on k-nearest neighbors.
- Label noise points using either a statistical or radius outlier detection.
- Assign values to a dimension based on the extent of an OGR-readable data source or an OGR SQL query.
- Compute a deviation of a point from a manifold approximating its neighbors.
- Label ground/non-ground returns using [Zhang2003].
- Compute pointwise density of points within a given radius.
- Compute the percentage of points that are considered uni-directional neighbors of a point.
- Label ground/non-ground returns using [Pingel2013].
There are currently three PDAL filters that can be used to reorder points. These filters will invalidate an existing KD-tree.
PDAL filters that move XYZ coordinates will invalidate an existing KD-tree.
- Compute and apply transformation between two point clouds using the Coherent Point Drift algorithm.
- Compute and apply transformation between two point clouds using the Iterative Closest Point algorithm.
- Apply coordinates operation on point triplets, based on PROJ pipeline string, WKT2 coordinates operations or URN definitions.
- Reproject data using GDAL from one coordinate system to another.
- Transform each point using a 4x4 transformation matrix.
Some PDAL filters will cull points, returning a point cloud that is smaller than the input. These filters will invalidate an existing KD-tree.
- Filter points inside or outside a bounding box or a polygon
- Keep every Nth point.
- Remove points that are in a raster cell but have a value far from the value of the raster.
- Return N points from beginning of the point cloud.
- Cull points falling outside the computed Interquartile Range for a given dimension.
- Return a single point with min/max value in the named dimension.
- Cull points falling outside the computed Median Absolute Deviation for a given dimension.
- Cull points using MongoDB-style expression syntax.
- Pass only points given a dimension/range.
- Perform Poisson sampling and return only a subset of the input points.
- Return N points from end of the point cloud.
- Return the point within each voxel that is nearest the voxel center.
- Return the point within each voxel that is nearest the voxel centroid.
PDAL filters can be used to split the incoming point cloud into subsets. These filters will invalidate an existing KD-tree.
- Organize points into spatially contiguous, squarish, and non-overlapping chips.
- Divide points into approximately equal sized groups based on a simple scheme.
- Split data categorically by dimension.
- Split data by return order (e.g., ‘first’, ‘last’, ‘intermediate’, ‘only’).
- Split data based on a X/Y box length.
Multiple point clouds can be joined to form a single point cloud. These filters will invalidate an existing KD-tree.
- Merge data from two different readers into a single stream.
PDAL filters can be used to create new metadata. These filters will not invalidate an existing KD-tree.
Meshes can be computed from point clouds. These filters will invalidate an existing KD-tree.
- Create mesh using Delaunay triangulation.
- Create mesh using the Greedy Projection Triangulation approach.
- Create mesh using the Grid Projection approach [Li2010].
- Data smoothing and normal estimation using the approach of [Alexa2003].
- Create mesh using the Poisson surface reconstruction algorithm [Kazhdan2006].
PDAL has two filters than can be used to pass point clouds to other languages. These filters will invalidate an existing KD-tree.