29 Span<std::array<BMLoop *, 3>> looptris,
33 bool (*test_fn)(
struct BMFace *,
void *user_data),
36 Span<std::array<BMLoop *, 3>> looptris,
59 void *filter_userdata);
76 unsigned int *r_overlap_tot);
82 unsigned int *r_overlap_tot);
void BKE_bmbvh_free(BMBVHTree *tree)
BMBVHTree * BKE_bmbvh_new_ex(struct BMesh *bm, Span< std::array< BMLoop *, 3 > > looptris, int flag, const float3 *cos_cage, bool cos_cage_free, bool(*test_fn)(struct BMFace *, void *user_data), void *user_data)
struct BMFace * BKE_bmbvh_find_face_closest(const BMBVHTree *tree, const float co[3], float dist_max)
struct BMFace * BKE_bmbvh_ray_cast(const BMBVHTree *tree, const float co[3], const float dir[3], float radius, float *r_dist, float r_hitout[3], float r_cagehit[3])
struct BVHTree * BKE_bmbvh_tree_get(BMBVHTree *tree)
BMBVHTree * BKE_bmbvh_new(struct BMesh *bm, Span< std::array< BMLoop *, 3 > > looptris, int flag, const float3 *cos_cage, bool cos_cage_free)
struct BMVert * BKE_bmbvh_find_vert_closest(const BMBVHTree *tree, const float co[3], float dist_max)
struct BVHTreeOverlap * BKE_bmbvh_overlap(const BMBVHTree *bmtree_a, const BMBVHTree *bmtree_b, unsigned int *r_overlap_tot)
BMBVHTree * BKE_bmbvh_new_from_editmesh(struct BMEditMesh *em, struct BMesh *bm, int flag, const float3 *cos_cage, bool cos_cage_free)
struct BMFace * BKE_bmbvh_ray_cast_filter(const 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)
VecBase< float, 3 > float3
bool(*) BMBVHTree_FaceFilter(struct BMFace *f, void *userdata)
struct BVHTreeOverlap * BKE_bmbvh_overlap_self(const BMBVHTree *bmtree, unsigned int *r_overlap_tot)