KDTree

A high-performance, lazily-built KD-Tree implementation for spatial partitioning of particles and triangle meshes in three-dimensional space. This library provides efficient ray-triangle intersection queries and is particularly suited for polyhedral geometry operations.

Here is a visualization of a KDTree partitioning a 3D space filled with particles:

This project supports partioning of particles in 3D space as well as triangle meshes (polyhedra).

KDTree

• Overview
  • Features
  • Requirements
  • Installation
  • Usage
  • Algorithm Comparison
  • Project Structure
  • Performance Tips
  • Benchmarking
  • License
  • Author
  • Acknowledgments
  • Contributing
  • Citation

Minimal Code Examples:

• C++
• Python

Source Code Documentation:

• C++ Documentation
• Python Documentation

Build and Configuration:

• CMake Reference

Building and Running the Tests:

• CTest (C++ Tests)
• Pytest (Python Tests)