32 HULL_FLAG_INPUT = (1 << 0),
34 HULL_FLAG_INTERIOR_ELE = (1 << 1),
35 HULL_FLAG_OUTPUT_GEOM = (1 << 2),
37 HULL_FLAG_DEL = (1 << 3),
38 HULL_FLAG_HOLE = (1 << 4),
52static void hull_add_triangle(
64 for (i = 0; i < 3; i++) {
102 BMFace *f, *example =
nullptr;
116 for (i = 0; i < 3; i++) {
118 example = hull_find_example_face(
bm, edges[i]);
131 for (i = 0; i < 3; i++) {
137 for (i = 0; i < 3; i++) {
138 const int next = (i == 2 ? 0 : i + 1);
149 for (i = 0; i < 3; i++) {
157struct HullFinalEdges {
158 Map<BMVert *, ListBaseT<LinkData> *> *edges;
159 BLI_mempool *base_pool, *link_pool;
162static LinkData *final_edges_find_link(ListBaseT<LinkData> *adj,
BMVert *
v)
165 if (link.data ==
v) {
173static int hull_final_edges_lookup(HullFinalEdges *final_edges,
BMVert *v1,
BMVert *
v2)
175 ListBaseT<LinkData> *adj;
182 adj = final_edges->edges->lookup_default(v1,
nullptr);
187 return !!final_edges_find_link(adj,
v2);
191static HullFinalEdges *hull_final_edges(
BLI_mempool *hull_triangles)
193 HullFinalEdges *final_edges;
196 final_edges->edges = MEM_new<Map<BMVert *, ListBaseT<LinkData> *>>(
"final edges map");
209 for (i = 0; i < 3; i++) {
218 ListBaseT<LinkData> *adj = final_edges->edges->lookup_or_add_cb(v1, [&]() {
219 return static_cast<ListBaseT<LinkData> *
>(
BLI_mempool_calloc(final_edges->base_pool));
222 if (!final_edges_find_link(adj,
v2)) {
233static void hull_final_edges_free(HullFinalEdges *final_edges)
235 MEM_delete(final_edges->edges);
238 MEM_delete(final_edges);
243static void hull_remove_overlapping(
BMesh *
bm,
245 HullFinalEdges *final_edges)
252 BMIter bm_iter1, bm_iter2;
263 if (!hull_final_edges_lookup(final_edges,
e->v1,
e->v2)) {
280static void hull_mark_interior_elements(
BMesh *
bm,
BMOperator *op, HullFinalEdges *final_edges)
288 if (!hull_final_edges_lookup(final_edges,
e->v1,
e->v2)) {
384 bool any_faces =
false;
394 if (hole && any_faces) {
400static int hull_input_vert_count(
BMOperator *op)
413static BMVert **hull_input_verts_copy(
BMOperator *op,
const int num_input_verts)
421 input_verts[i++] =
v;
427static float (*hull_verts_for_bullet(
BMVert **input_verts,
const int num_input_verts))[3]
432 for (i = 0; i < num_input_verts; i++) {
441 const int num_input_verts)
447 for (i = 0; i < num_verts; i++) {
452 if (original_index >= 0 && original_index < num_input_verts) {
453 hull_verts[i] = input_verts[original_index];
472 const int num_input_verts = hull_input_vert_count(op);
474 input_verts = hull_input_verts_copy(op, num_input_verts);
475 coords = hull_verts_for_bullet(input_verts, num_input_verts);
478 hull_verts = hull_verts_from_bullet(hull, input_verts, num_input_verts);
482 for (i = 0; i < count; i++) {
490 fvi.reinitialize(
len);
497 fv[0] = hull_verts[fvi[0]];
498 for (j = 2; j <
len; j++) {
499 fv[1] = hull_verts[fvi[j - 1]];
500 fv[2] = hull_verts[fvi[j]];
502 hull_add_triangle(
bm, hull_triangles, fv[0], fv[1], fv[2]);
509 MEM_delete(hull_verts);
511 MEM_delete(input_verts);
515static bool hull_num_input_verts_is_ok(
BMOperator *op)
519 int partial_num_verts = 0;
523 if (partial_num_verts >= 3) {
528 return (partial_num_verts >= 3);
533 HullFinalEdges *final_edges;
539 if (!hull_num_input_verts_is_ok(op)) {
548 if (ele->head.htype ==
BM_VERT) {
551 else if (ele->head.htype ==
BM_EDGE) {
561 hull_from_bullet(
bm, op, hull_triangles);
563 final_edges = hull_final_edges(hull_triangles);
565 hull_mark_interior_elements(
bm, op, final_edges);
569 hull_remove_overlapping(
bm, hull_triangles, final_edges);
571 hull_tag_holes(
bm, op);
575 hull_final_edges_free(final_edges);
578 hull_output_triangles(
bm, hull_triangles);
581 hull_tag_unused(
bm, op);
586 bm, op, op->slots_out,
"geom_interior.out",
BM_ALL_NOLOOP, HULL_FLAG_INTERIOR_ELE);
591 bm, op, op->slots_out,
"geom_unused.out",
BM_ALL_NOLOOP, HULL_FLAG_DEL);
597 bm, op, op->slots_out,
"geom_holes.out",
BM_ALL_NOLOOP, HULL_FLAG_HOLE);
601 bm, op, op->slots_out,
"geom.out",
BM_ALL_NOLOOP, HULL_FLAG_OUTPUT_GEOM);
Read Blender memory allocation and freeing.
struct plConvexHull__ * plConvexHull
#define BLI_assert_msg(a, msg)
#define BM_ITER_ELEM(ele, iter, data, itype)
#define BMO_vert_flag_disable(bm, e, oflag)
#define BMO_edge_flag_test(bm, e, oflag)
#define BMO_edge_flag_enable(bm, e, oflag)
#define BMO_vert_flag_enable(bm, e, oflag)
#define BMO_face_flag_enable(bm, e, oflag)
#define BMO_ITER(ele, iter, slot_args, slot_name, restrict_flag)
#define BMO_vert_flag_test(bm, e, oflag)
#define BMO_face_flag_disable(bm, e, oflag)
#define BMO_face_flag_test(bm, e, oflag)
ccl_device_inline dual1 len(const ccl_private dual< T > &a)
BMFace * BM_face_create_verts(BMesh *bm, BMVert **vert_arr, const int len, const BMFace *f_example, const eBMCreateFlag create_flag, const bool create_edges)
void bmo_convex_hull_exec(BMesh *bm, BMOperator *op)
MINLINE void copy_v3_v3(float r[3], const float a[3])
void * MEM_new_array_uninitialized(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
ATTR_WARN_UNUSED_RESULT const BMVert * v
float normal_tri_v3(float n[3], const float v1[3], const float v2[3], const float v3[3])
void BLI_mempool_destroy(BLI_mempool *pool) ATTR_NONNULL(1)
void * MEM_new_zeroed(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
void BMO_slot_buffer_from_enabled_flag(BMesh *bm, BMOperator *op, BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name, char htype, short oflag)
BLI_mempool * BLI_mempool_create(unsigned int esize, unsigned int elem_num, unsigned int pchunk, unsigned int flag) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT ATTR_RETURNS_NONNULL
void BM_face_copy_shared(BMesh *bm, BMFace *f, BMLoopFilterFunc filter_fn, void *user_data)
copies face loop data from shared adjacent faces.
void BM_face_select_set(BMesh *bm, BMFace *f, const bool select)
Select Face.
bool BM_vert_in_face(BMVert *v, BMFace *f)
void BLI_mempool_iternew(BLI_mempool *pool, BLI_mempool_iter *iter) ATTR_NONNULL()
BLI_INLINE bool BM_edge_is_boundary(const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
void * BLI_mempool_iterstep(BLI_mempool_iter *iter) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
BMFace * BM_face_exists(BMVert *const *varr, int len)
BMEdge * BM_edge_exists(BMVert *v_a, BMVert *v_b)
bool BMO_slot_bool_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
void BLI_addtail(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
ATTR_WARN_UNUSED_RESULT const BMVert * v2
void * BLI_mempool_calloc(BLI_mempool *pool) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT ATTR_RETURNS_NONNULL ATTR_NONNULL(1)
void BMO_error_raise(BMesh *bm, BMOperator *owner, eBMOpErrorLevel level, const char *msg) ATTR_NONNULL(1
BMEdge * BM_edge_create(BMesh *bm, BMVert *v1, BMVert *v2, const BMEdge *e_example, const eBMCreateFlag create_flag)
Main function for creating a new edge.
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
void * MEM_new_array_zeroed(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
int plConvexHullGetFaceSize(plConvexHull hull, int n)
void plConvexHullGetVertex(plConvexHull hull, int n, float coords[3], int *original_index)
int plConvexHullNumVertices(plConvexHull hull)
plConvexHull plConvexHullCompute(float(*coords)[3], int count)
void plConvexHullDelete(plConvexHull hull)
int plConvexHullNumFaces(plConvexHull hull)
void plConvexHullGetFaceVertices(plConvexHull hull, int n, int *vertices)
KERNEL_FEATURE_LIGHT_PASSES KERNEL_FEATURE_PATH_GUIDING float