39#define EDGE_OUT (1 << 0)
40#define FACE_OUT (1 << 1)
49 const int f_base_len = f_base->
len;
50 int faces_array_tot = f_base_len - 3;
51 int edges_array_tot = f_base_len - 3;
54 const int quad_method = 0, ngon_method = 0;
77 if (faces_array_tot) {
79 for (i = 0; i < faces_array_tot; i++) {
80 BMFace *f = faces_array[i];
86 if (edges_array_tot) {
91 int e_a_concave = (BM_elem_flag_test(e_a->v1, BM_ELEM_TAG) &&
92 BM_elem_flag_test(e_a->v2, BM_ELEM_TAG));
93 int e_b_concave = (BM_elem_flag_test(e_b->v1, BM_ELEM_TAG) &&
94 BM_elem_flag_test(e_b->v2, BM_ELEM_TAG));
98 if (e_a_concave != e_b_concave) {
99 return e_a_concave < e_b_concave;
105 return e_a_len > e_b_len;
108 for (i = 0; i < edges_array_tot; i++) {
116 for (j = 0; j < 2; j++) {
135 BMFace *f_new, *f_pair[2] = {l_pair[0]->
f, l_pair[1]->
f};
140 if (f_double) [[unlikely]] {
155 while (faces_double) {
156 LinkNode *next = faces_double->next;
158 MEM_delete(faces_double);
167 bool is_concave =
false;
169 const BMLoop *l_iter, *l_first;
180 }
while ((l_iter = l_iter->
next) != l_first);
189 bool changed =
false;
A min-heap / priority queue ADT.
#define BLI_POLYFILL_ARENA_SIZE
#define BLI_POLYFILL_ALLOC_NGON_RESERVE
Read Blender memory allocation and freeing.
#define BM_FACE_FIRST_LOOP(p)
#define BM_elem_flag_disable(ele, hflag)
#define BM_elem_flag_enable(ele, hflag)
#define BMO_edge_flag_enable(bm, e, oflag)
#define BMO_face_flag_enable(bm, e, oflag)
#define BMO_ITER(ele, iter, slot_args, slot_name, restrict_flag)
VecBase< float, 3 > cross(VecOp< float, 3 >, VecOp< float, 3 >) RET
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
Heap * BLI_heap_new_ex(unsigned int reserve_num) ATTR_WARN_UNUSED_RESULT
MemArena * BLI_memarena_new(size_t bufsize, const char *name) ATTR_WARN_UNUSED_RESULT ATTR_RETURNS_NONNULL ATTR_NONNULL(2) ATTR_MALLOC
void bmo_connect_verts_concave_exec(BMesh *bm, BMOperator *op)
MINLINE void copy_v3_v3(float r[3], const float a[3])
ATTR_WARN_UNUSED_RESULT const BMLoop * l
void BM_face_triangulate(BMesh *bm, BMFace *f, BMFace **r_faces_new, int *r_faces_new_tot, BMEdge **r_edges_new, int *r_edges_new_tot, LinkNode **r_faces_double, const int quad_method, const int ngon_method, const bool use_tag, MemArena *pf_arena, Heap *pf_heap)
BMESH TRIANGULATE FACE.
void BLI_heap_free(Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1)
void cross_tri_v3(float n[3], const float v1[3], const float v2[3], const float v3[3])
void void BLI_linklist_prepend(LinkNode **listp, void *ptr) ATTR_NONNULL(1)
BMFace * BM_faces_join(BMesh *bm, BMFace **faces, int totface, const bool do_del, BMFace **r_double)
Join Connected Faces.
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_INLINE bool BM_edge_is_contiguous(const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
bool BM_edge_loop_pair(BMEdge *e, BMLoop **r_la, BMLoop **r_lb)
float BM_edge_calc_length_squared(const BMEdge *e)
void BM_face_kill(BMesh *bm, BMFace *f)
static bool bm_face_split_by_concave(BMesh *bm, BMFace *f_base, const float eps, MemArena *pf_arena, Heap *pf_heap)
static bool bm_face_convex_tag_verts(BMFace *f)
MINLINE float dot_v3v3(const float a[3], const float b[3]) ATTR_WARN_UNUSED_RESULT
void BLI_heap_clear(Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1)
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
void BLI_memarena_free(MemArena *ma) ATTR_NONNULL(1)
bool BM_loop_is_convex(const BMLoop *l)
struct BMOpSlot slots_in[BMO_OP_MAX_SLOTS]
struct BMOpSlot slots_out[BMO_OP_MAX_SLOTS]
struct BMLoop * radial_next