Blender V4.3
BKE_editmesh_bvh.hh
Go to the documentation of this file.
1/* SPDX-FileCopyrightText: 2001-2002 NaN Holding BV. All rights reserved.
2 *
3 * SPDX-License-Identifier: GPL-2.0-or-later */
4
9#pragma once
10
12#include "BLI_span.hh"
13
14struct BMBVHTree;
15struct BMEditMesh;
16struct BMFace;
17struct BMLoop;
18struct BMVert;
19struct BMesh;
20struct BVHTree;
21
22typedef struct BMBVHTree BMBVHTree;
23
24typedef bool (*BMBVHTree_FaceFilter)(struct BMFace *f, void *userdata);
25
27 int flag,
28 const blender::float3 *cos_cage,
29 bool cos_cage_free);
31 blender::Span<std::array<BMLoop *, 3>> looptris,
32 int flag,
33 const blender::float3 *cos_cage,
34 bool cos_cage_free,
35 bool (*test_fn)(struct BMFace *, void *user_data),
36 void *user_data);
38 blender::Span<std::array<BMLoop *, 3>> looptris,
39 int flag,
40 const blender::float3 *cos_cage,
41 bool cos_cage_free);
44
46 const float co[3],
47 const float dir[3],
48 float radius,
49 float *r_dist,
50 float r_hitout[3],
51 float r_cagehit[3]);
52
54 const float co[3],
55 const float dir[3],
56 float radius,
57 float *r_dist,
58 float r_hitout[3],
59 float r_cagehit[3],
60 BMBVHTree_FaceFilter filter_cb,
61 void *filter_userdata);
62
67 const float co[3],
68 float dist_max);
70 const float co[3],
71 float dist_max);
72
76struct BVHTreeOverlap *BKE_bmbvh_overlap(const BMBVHTree *bmtree_a,
77 const BMBVHTree *bmtree_b,
78 unsigned int *r_overlap_tot);
79
84 unsigned int *r_overlap_tot);
85
87enum {
94};
BMBVHTree * BKE_bmbvh_new_from_editmesh(struct BMEditMesh *em, int flag, const blender::float3 *cos_cage, bool cos_cage_free)
bool(* BMBVHTree_FaceFilter)(struct BMFace *f, void *userdata)
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)
struct BMFace * BKE_bmbvh_find_face_closest(const BMBVHTree *tree, const float co[3], float dist_max)
BMBVHTree * BKE_bmbvh_new(struct BMesh *bm, blender::Span< std::array< BMLoop *, 3 > > looptris, int flag, const blender::float3 *cos_cage, bool cos_cage_free)
struct BMVert * BKE_bmbvh_find_vert_closest(const BMBVHTree *tree, const float co[3], float dist_max)
BMBVHTree * BKE_bmbvh_new_ex(struct BMesh *bm, blender::Span< std::array< BMLoop *, 3 > > looptris, int flag, const blender::float3 *cos_cage, bool cos_cage_free, bool(*test_fn)(struct BMFace *, void *user_data), void *user_data)
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)
struct BVHTreeOverlap * BKE_bmbvh_overlap_self(const BMBVHTree *bmtree, unsigned int *r_overlap_tot)
@ BMBVH_RETURN_ORIG
@ BMBVH_RESPECT_HIDDEN
@ BMBVH_RESPECT_SELECT
struct BVHTreeOverlap * BKE_bmbvh_overlap(const BMBVHTree *bmtree_a, const BMBVHTree *bmtree_b, unsigned int *r_overlap_tot)
void BKE_bmbvh_free(BMBVHTree *tree)
ATTR_WARN_UNUSED_RESULT BMesh * bm
KDTree_3d * tree
float co[3]
uint8_t flag
Definition wm_window.cc:138