Overview
Gimme DOTS Geometry utilizes Unity's Burst Compiler to enable very fast query times for various questions regarding space, e.g. "Which objects are within a 10m radius?" or "How many entities are inside this area?"
The stuff you'll get:
- Native spatial-hashed Quadtrees (sparse and dense variants)
- Native spatial-hashed Octrees (sparse and dense variants)
- Native 2D KD-Tree (working in XY-, XZ-, and YZ)
- Native 3D KD-Tree / Native 3D-Tree
- Dynamic Ball* Trees (2D + 3D)
- Hull Algorithms (Convex Hull + Minimum Enclosing Disc and Sphere)
- Polygons with holes and extremely fast Query Jobs (and two triangulation methods)
- Advanced Native Containers
- Native Priority Queue (Binary Heap)
- Native Sorted List (Skip List)
- Native AVL Tree
- Line Intersection Jobs
- 19 Sample Scenes
- And a lot more!
All spatial data structures support parallel queries. Like the polygons themselves, polygon queries support holes as well.
Dependencies
- Burst 1.8 or higher
- Collections 1.4 or higher
- Mathematics 1.2 or higher
Documentation
Contact:
Email | Website | Discord