jrd730 / QuadTreeLinks
a dynamic 2d space partitioning tree
☆24Updated 4 years ago
Alternatives and similar repositories for QuadTree
Users that are interested in QuadTree are comparing it to the libraries listed below
Sorting:
- Acceleration structure library (BVH-, KD-Tree) with basic parallel construction☆56Updated 6 years ago
- Loose Quadtree (Region Tree) simple C++11 implementation☆66Updated last year
- Octree library in C++☆60Updated 13 years ago
- Templated hierarchical spatial trees designed for high-peformance.☆131Updated last year
- Visibility Determination Library: hierarchical frustum and occlusion culling algorithms☆41Updated 4 years ago
- A basic geometry C++ library for 2D and 3D applications☆97Updated last year
- A comparison of the GLM, CLM, and Eigen libraries for speed and ease of use.☆41Updated 10 months ago
- 3D B-Spline renderer written in C++ using Qt, OpenGL and Eigen☆27Updated 3 months ago
- Generating Trees with a Space Colonization Algorithm☆43Updated 7 years ago
- 3D graphics engine☆49Updated 3 years ago
- ☆42Updated 8 years ago
- Tiny Global Illumination OpenGL Renderer☆54Updated 10 years ago
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆117Updated 13 years ago
- 🔺 Fast polygon triangulation library based on Seidel's algorithm.☆43Updated last month
- Single header implementation of "A linear-time component-labeling algorithm using contour tracing technique" by Fu Chang, Chun-Jen Chen,…☆56Updated 4 months ago
- Basic linear algebra C++ library for 2D and 3D applications☆47Updated 11 months ago
- 3D Computational Geometry in C++11☆20Updated 7 years ago
- Development of this project is continued at https://github.com/spire-engine/spire-engine. This repo is no longer updated.☆59Updated 5 years ago
- procedural geometry for Ogre3D☆46Updated this week
- The Configurable Math Library☆85Updated last week
- A 2D constrained Delaunay triangulation library☆81Updated 7 years ago
- Demonstrates order independent transparency on Vulkan using depth peeling.