Octree#

An octree is a tree data structure where each internal node has eight children. Octrees are commonly used for spatial partitioning of 3D point clouds. Non-empty leaf nodes of an octree contain one or more points that fall within the same spatial subdivision. Octrees are a useful description of 3D space and can be used to quickly find nearby points. Open3D has the geometry type Octree that can be used to create, search, and traverse octrees with a user-specified maximum tree depth, max_depth.

From point cloud#

An octree can be constructed from a point cloud using the method convert_from_point_cloud. Each point is inserted into the tree by following the path from the root node to the appropriate leaf node at depth max_depth. As the tree depth increases, internal (and eventually leaf) nodes represents a smaller partition of 3D space.

If the point cloud has color, the the corresponding leaf node takes the color of the last inserted point. The size_expand parameter increases the size of the root octree node so it is slightly bigger than the original point cloud bounds to accommodate all points.

[2]:
print('input')
N = 2000

armadillo = o3d.data.ArmadilloMesh()
mesh = o3d.io.read_triangle_mesh(armadillo.path)
pcd = mesh.sample_points_poisson_disk(N)
# fit to unit cube
pcd.scale(1 / np.max(pcd.get_max_bound() - pcd.get_min_bound()),
          center=pcd.get_center())
pcd.colors = o3d.utility.Vector3dVector(np.random.uniform(0, 1, size=(N, 3)))
o3d.visualization.draw_geometries([pcd])

print('octree division')
octree = o3d.geometry.Octree(max_depth=4)
octree.convert_from_point_cloud(pcd, size_expand=0.01)
o3d.visualization.draw_geometries([octree])
input
../../_images/tutorial_geometry_octree_3_1.png
octree division
../../_images/tutorial_geometry_octree_3_3.png

From voxel grid#

An octree can also be constructed from an Open3D VoxelGrid geometry using the method create_from_voxel_grid. Each voxel of the input VoxelGrid is treated as a point in 3D space with coordinates corresponding to the origin of the voxel. Each leaf node takes the color of its corresponding voxel.

[3]:
print('voxelization')
voxel_grid = o3d.geometry.VoxelGrid.create_from_point_cloud(pcd,
                                                            voxel_size=0.05)
o3d.visualization.draw_geometries([voxel_grid])

print('octree division')
octree = o3d.geometry.Octree(max_depth=4)
octree.create_from_voxel_grid(voxel_grid)
o3d.visualization.draw_geometries([octree])
voxelization
../../_images/tutorial_geometry_octree_5_1.png
octree division
../../_images/tutorial_geometry_octree_5_3.png

Additionally, an Octree can be converted to a VoxelGrid with to_voxel_grid.

Traversal#

An octree can be traversed which can be useful for searching or processing subsections of 3D geometry. By providing the traverse method with a callback, each time a node (internal or leaf) is visited, additional processing can be performed.

In the following example, an early stopping criterion is used to only process internal/leaf nodes with more than a certain number of points. This early stopping ability can be used to efficiently process spatial regions meeting certain conditions.

[4]:
def f_traverse(node, node_info):
    early_stop = False

    if isinstance(node, o3d.geometry.OctreeInternalNode):
        if isinstance(node, o3d.geometry.OctreeInternalPointNode):
            n = 0
            for child in node.children:
                if child is not None:
                    n += 1
            print(
                "{}{}: Internal node at depth {} has {} children and {} points ({})"
                .format('    ' * node_info.depth,
                        node_info.child_index, node_info.depth, n,
                        len(node.indices), node_info.origin))

            # we only want to process nodes / spatial regions with enough points
            early_stop = len(node.indices) < 250
    elif isinstance(node, o3d.geometry.OctreeLeafNode):
        if isinstance(node, o3d.geometry.OctreePointColorLeafNode):
            print("{}{}: Leaf node at depth {} has {} points with origin {}".
                  format('    ' * node_info.depth, node_info.child_index,
                         node_info.depth, len(node.indices), node_info.origin))
    else:
        raise NotImplementedError('Node type not recognized!')

    # early stopping: if True, traversal of children of the current node will be skipped
    return early_stop
[5]:
octree = o3d.geometry.Octree(max_depth=4)
octree.convert_from_point_cloud(pcd, size_expand=0.01)
octree.traverse(f_traverse)
0: Internal node at depth 0 has 8 children and 2000 points ([-2.65131669 30.80093763  1.94205337])
    0: Internal node at depth 1 has 4 children and 66 points ([-2.65131669 30.80093763  1.94205337])
    1: Internal node at depth 1 has 2 children and 45 points ([-2.14631669 30.80093763  1.94205337])
    2: Internal node at depth 1 has 8 children and 406 points ([-2.65131669 31.30593763  1.94205337])
        0: Internal node at depth 2 has 2 children and 6 points ([-2.65131669 31.30593763  1.94205337])
        1: Internal node at depth 2 has 1 children and 6 points ([-2.39881669 31.30593763  1.94205337])
        2: Internal node at depth 2 has 4 children and 43 points ([-2.65131669 31.55843763  1.94205337])
        3: Internal node at depth 2 has 1 children and 6 points ([-2.39881669 31.55843763  1.94205337])
        4: Internal node at depth 2 has 4 children and 55 points ([-2.65131669 31.30593763  2.19455337])
        5: Internal node at depth 2 has 5 children and 90 points ([-2.39881669 31.30593763  2.19455337])
        6: Internal node at depth 2 has 4 children and 78 points ([-2.65131669 31.55843763  2.19455337])
        7: Internal node at depth 2 has 6 children and 122 points ([-2.39881669 31.55843763  2.19455337])
    3: Internal node at depth 1 has 7 children and 363 points ([-2.14631669 31.30593763  1.94205337])
        0: Internal node at depth 2 has 1 children and 6 points ([-2.14631669 31.30593763  1.94205337])
        2: Internal node at depth 2 has 1 children and 4 points ([-2.14631669 31.55843763  1.94205337])
        3: Internal node at depth 2 has 3 children and 10 points ([-1.89381669 31.55843763  1.94205337])
        4: Internal node at depth 2 has 4 children and 82 points ([-2.14631669 31.30593763  2.19455337])
        5: Internal node at depth 2 has 4 children and 46 points ([-1.89381669 31.30593763  2.19455337])
        6: Internal node at depth 2 has 6 children and 109 points ([-2.14631669 31.55843763  2.19455337])
        7: Internal node at depth 2 has 6 children and 106 points ([-1.89381669 31.55843763  2.19455337])
    4: Internal node at depth 1 has 5 children and 348 points ([-2.65131669 30.80093763  2.44705337])
        0: Internal node at depth 2 has 4 children and 62 points ([-2.65131669 30.80093763  2.44705337])
        1: Internal node at depth 2 has 4 children and 99 points ([-2.39881669 30.80093763  2.44705337])
        2: Internal node at depth 2 has 2 children and 20 points ([-2.65131669 31.05343763  2.44705337])
        3: Internal node at depth 2 has 8 children and 146 points ([-2.39881669 31.05343763  2.44705337])
        7: Internal node at depth 2 has 1 children and 21 points ([-2.39881669 31.05343763  2.69955337])
    5: Internal node at depth 1 has 4 children and 321 points ([-2.14631669 30.80093763  2.44705337])
        0: Internal node at depth 2 has 8 children and 176 points ([-2.14631669 30.80093763  2.44705337])
        1: Internal node at depth 2 has 1 children and 1 points ([-1.89381669 30.80093763  2.44705337])
        2: Internal node at depth 2 has 8 children and 143 points ([-2.14631669 31.05343763  2.44705337])
        6: Internal node at depth 2 has 1 children and 1 points ([-2.14631669 31.05343763  2.69955337])
    6: Internal node at depth 1 has 5 children and 228 points ([-2.65131669 31.30593763  2.44705337])
    7: Internal node at depth 1 has 5 children and 223 points ([-2.14631669 31.30593763  2.44705337])

Find leaf node containing point#

Using the above traversal mechanism, an octree can be quickly searched for the leaf node that contains a given point. This functionality is provided via the locate_leaf_node method.

[6]:
octree.locate_leaf_node(pcd.points[0])
[6]:
(OctreePointColorLeafNode with color [0.0176031, 0.0111749, 0.63824] containing 1 points.,
 OctreeNodeInfo with origin [-2.52507, 31.5584, 2.00518], size 0.063125, depth 4, child_index 4)