载入中...
搜索中...
未找到
BSPTree3D.h
浏览该文件的文档.
Binary space partition tree (kd-style AABB splits) for 3D culling. Alternating X/Y/Z splits at node m...
Definition BSPTree3D.h:16
BSPTree3D & operator=(const BSPTree3D &)=delete
int queryAABB(float minX, float minY, float minZ, float maxX, float maxY, float maxZ)
Definition BSPTree3D.cpp:200
BSPTree3D(const BSPTree3D &)=delete
int querySphere(float cx, float cy, float cz, float radius)
Definition BSPTree3D.cpp:207
~BSPTree3D()=default
int queryPoint(float x, float y, float z)
Definition BSPTree3D.cpp:194
bool update(int id, float minX, float minY, float minZ, float maxX, float maxY, float maxZ)
Definition BSPTree3D.cpp:57
bool insert(int id, float minX, float minY, float minZ, float maxX, float maxY, float maxZ)
Definition BSPTree3D.cpp:38
Definition Scene.h:33
Definition Bounds.h:43