Gimme DOTS Geometry
For the people who have thousands and thousands of objects or entities and now need to manage the query performance somehow. As fast as possible.
by Mario Binder
★★★★★ star rating
Price History +
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:
- 24 Sample Scenes
- Native spatial-hashed Quadtrees and Octrees (sparse and dense variants)
- Native 2D KD-Tree and 3D KD-Tree
- Voronoi Diagrams
- Dynamic R* Trees (2D + 3D)
- 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)
- Delaunay Triangulation
- Specialized algorithms for your custom Boids (All Radius and All Rectangle Queries)
- Advanced Native Containers
- Native Priority Queue (Binary Heap)
- Native Sorted List (Skip List)
- Native AVL Tree
- Line Intersection Jobs
- 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
Contact:
