#include <bsp_tree.h>
|
enum | { UNDER_LEAF =0xFFFF,
OVER_LEAF =0xFFFE,
MAX_NODES =0xFFFE,
MAX_PLANES =(1<<16)
} |
|
|
bool | is_empty () const |
|
Vector< Node > | get_nodes () const |
|
Vector< Plane > | get_planes () const |
|
AABB | get_aabb () const |
|
bool | point_is_inside (const Vector3 &p_point) const |
|
int | get_points_inside (const Vector3 *p_points, int p_point_count) const |
|
template<class T > |
bool | convex_is_inside (const T &p_convex) const |
|
| operator Variant () const |
|
void | from_aabb (const AABB &p_aabb) |
|
| BSP_Tree (const Variant &p_variant) |
|
| BSP_Tree (const DVector< Face3 > &p_faces, float p_error_radius=0) |
|
| BSP_Tree (const Vector< Node > &p_nodes, const Vector< Plane > &p_planes, const AABB &p_aabb, float p_error_radius=0) |
|
The documentation for this class was generated from the following files:
- /Users/huihoo/Downloads/godot-2.0.4-stable/core/math/bsp_tree.h
- /Users/huihoo/Downloads/godot-2.0.4-stable/core/math/bsp_tree.cpp