Tetrahedral Trees

The Tetrahedral Trees library is a tool for efficient spatial and topological queries on large tetrahedral meshes with arbitrary topology and complex boundaries, which arise in several application domains, such as 3D Geographic Information Systems (GISs), scientific visualization, and finite element analysis. The library is based on Tetrahedral trees, a family of spatial indexes based on a nested space subdivision (an octree or a kD-tree) and defined by several different subdivision criteria. The library contains efficient algorithms for spatial and topological queries on Tetrahedral trees. For a description of the required libraries for building the library, the compilation process, the run-time options and of the supported input format, please refer to the github page of the repository listed above. The source code and additional information can be found on GitHub.
Reference: Tetrahedral Trees: A Family of Hierarchical Spatial Indexes for Tetrahedral Meshes by Riccardo Fellegara, Leila De Floriani, Paola Magillo, and Kenneth Weiss in ACM Transactions on Spatial Algorithms and Systems, 6 (4), pages 1-34, 2020.