载入中...
搜索中...
未找到
Spatial.h
浏览该文件的文档.
Binary space partition tree (kd-style AABB splits) for 2D culling. Alternating X/Y splits at node mid...
Definition BSPTree2D.h:18
Binary space partition tree (kd-style AABB splits) for 3D culling. Alternating X/Y/Z splits at node m...
Definition BSPTree3D.h:18
Region octree for 3D AABB broad-phase / scene culling. Same storage rules as QuadTree (smallest fully...
Definition Octree.h:18
Region quadtree for 2D AABB broad-phase / map culling. Items are stored in the smallest node that ful...
Definition QuadTree.h:19
Uniform-grid spatial hash for 2D AABB queries (map / particle / entity culling). Items are registered...
Definition SpatialHash2D.h:18
Uniform-grid spatial hash for 3D AABB / sphere queries.
Definition SpatialHash3D.h:15
Spatial index module — broad-phase / map culling structures. Script: spatial <- eve....
Definition Spatial.h:21
~Spatial() override=default
No owned indexes; factories return caller-owned pointers.
Module_REG(Spatial)
Definition Scene.h:36