14such as "Neighbors within Voxel Search”, “K Nearest Neighbor Search” and
15“Neighbors within Radius Search”. It automatically adjusts its dimension to the point
16data set. A set of leaf node classes provide additional functionality, such as
17spacial "occupancy" and "point density per voxel" checks. Functions for serialization
18and deserialization enable to efficiently encode the octree structure into a binary format.
19Furthermore, a memory pool implementation reduces expensive memory allocation and
20deallocation operations in scenarios where octrees needs to be created at high rate.
21
22The following figure illustrates the voxel bounding boxes of an octree nodes at lowest tree level.
23The octree voxels are surrounding every 3D point from the bunny's surface. The red dots represent the point data.
24This image is created with the octree_viewer (visualization/tools/octree_viewer).
25
26For examples how to use the <b>pcl_octree</b> library, please visit the <a href="http://www.pointclouds.org/documentation/tutorials/">pcl tutorial page</a>.
27
28\image html http://www.pointclouds.org/assets/images/contents/documentation/octree_bunny.png