28 const float (*cos_cage)[3],
31 struct BMLoop *(*looptris)[3],
34 const float (*cos_cage)[3],
39 struct BMLoop *(*looptris)[3],
42 const float (*cos_cage)[3],
63 void *filter_userdata);
76 unsigned int *r_overlap_tot);
82 unsigned int *r_overlap_tot);
struct BMFace * BKE_bmbvh_ray_cast(BMBVHTree *tree, const float co[3], const float dir[3], float radius, float *r_dist, float r_hitout[3], float r_cagehit[3])
bool(* BMBVHTree_FaceFilter)(struct BMFace *f, void *userdata)
struct BVHTreeOverlap * BKE_bmbvh_overlap(const BMBVHTree *bmtree_a, const BMBVHTree *bmtree_b, unsigned int *r_overlap_tot)
struct BMFace * BKE_bmbvh_find_face_closest(BMBVHTree *tree, const float co[3], float dist_max)
struct BMFace * BKE_bmbvh_ray_cast_filter(BMBVHTree *tree, const float co[3], const float dir[3], float radius, float *r_dist, float r_hitout[3], float r_cagehit[3], BMBVHTree_FaceFilter filter_cb, void *filter_userdata)
struct BVHTree * BKE_bmbvh_tree_get(BMBVHTree *tree)
BMBVHTree * BKE_bmbvh_new(struct BMesh *bm, struct BMLoop *(*looptris)[3], int looptris_tot, int flag, const float(*cos_cage)[3], bool cos_cage_free)
void BKE_bmbvh_free(BMBVHTree *tree)
struct BMVert * BKE_bmbvh_find_vert_closest(BMBVHTree *tree, const float co[3], float dist_max)
struct BVHTreeOverlap * BKE_bmbvh_overlap_self(const BMBVHTree *bmtree, unsigned int *r_overlap_tot)
BMBVHTree * BKE_bmbvh_new_from_editmesh(struct BMEditMesh *em, int flag, const float(*cos_cage)[3], bool cos_cage_free)
BMBVHTree * BKE_bmbvh_new_ex(struct BMesh *bm, struct BMLoop *(*looptris)[3], int looptris_tot, int flag, const float(*cos_cage)[3], bool cos_cage_free, bool(*test_fn)(struct BMFace *, void *user_data), void *user_data)
ATTR_WARN_UNUSED_RESULT BMesh * bm