28#define USE_DEGENERATE_CHECK
30#define COST_INVALID FLT_MAX
38 int cd_loop_offset_end;
45 const DelimitData *delimit_data);
48 const DelimitData *delimit_data);
55 const DelimitData *delimit_data)
57#define UNIT_TO_ANGLE DEG2RADF(90.0f)
58#define ANGLE_TO_UNIT (1.0f / UNIT_TO_ANGLE)
83 for (cd_loop_offset = delimit_data->cd_loop_offset;
84 cd_loop_offset < delimit_data->cd_loop_offset_end;
85 cd_loop_offset += delimit_data->cd_loop_size)
97 const DelimitData *delimit_data)
114 if (
e->l->f->mat_nr !=
e->l->radial_next->f->mat_nr) {
135 const DelimitData *delimit_data)
155 const DelimitData *delimit_data)
158 float angle_cos_neg =
dot_v3v3(
e->l->f->
no,
e->l->radial_next->f->
no);
162 return angle_cos_neg;
168#ifdef USE_DEGENERATE_CHECK
173 const float center[3])
181 r[0] = m[0][0] * co[0] + m[1][0] * co[1] + m[2][0] * co[2];
182 r[1] = m[0][1] * co[0] + m[1][1] * co[1] + m[2][1] * co[2];
188 const float *center = l_ear->
v->
co;
191 float axis_mat[3][3];
207 float adjacent_2d[2];
239 l_first = l_ear->
prev;
246 }
while ((l_iter = l_iter->
next) != l_first);
269 l_iter = l_first = e_pair[1]->
l;
271 if (l_iter->
f->
len > 3) {
272 BMLoop *l_pivot = (l_iter->
v ==
v ? l_iter : l_iter->
next);
278 }
while ((l_iter = l_iter->
radial_next) != l_first);
287 const float angle_limit,
288 const bool do_dissolve_boundaries,
291 const int vinput_len,
293 const int einput_len,
294 const short oflag_out)
296 const float angle_limit_cos_neg = -
cosf(angle_limit);
297 DelimitData delimit_data = {0};
298 const int eheap_table_len = do_dissolve_boundaries ? einput_len :
max_ii(einput_len, vinput_len);
305 if (layer_len == 0) {
312 delimit_data.cd_loop_offset_end = delimit_data.cd_loop_offset +
313 delimit_data.cd_loop_size * layer_len;
323 int *vert_reverse_lookup;
338 for (i = 0; i < einput_len; i++) {
364 eheap_table[i] =
nullptr;
376 if (j != -1 && eheap_table[j]) {
380 }
while ((l_iter = l_iter->
next) != l_first);
384 if (f_new ==
nullptr) [[unlikely]] {
392 std::fill_n(vert_reverse_lookup,
bm->
totvert, -1);
393 for (i = 0; i < vinput_len; i++) {
405 for (i =
bm->
totedge - 1; i != -1; i--) {
414 if (v1->
e ==
nullptr) {
416 if (vidx_reverse != -1) {
417 vinput_arr[vidx_reverse] =
nullptr;
421 if (
v2->
e ==
nullptr) {
423 if (vidx_reverse != -1) {
424 vinput_arr[vidx_reverse] =
nullptr;
430 MEM_delete(vert_reverse_lookup);
437 if (do_dissolve_boundaries) {
439 for (i = 0; i < vinput_len; i++) {
461 for (i = 0; i < vinput_len; i++) {
463 if (
v !=
nullptr) [[likely]] {
492 vheap_table[i] =
nullptr;
497 l_iter = l_first = e_new->
l;
500 }
while ((l_iter = l_iter->
radial_next) != l_first);
506 if (j != -1 && vheap_table[j]) {
512#ifdef USE_DEGENERATE_CHECK
517 l_iter = l_first = e_new->
l;
520 BMLoop *l_cycle_first, *l_cycle_iter;
522 l_cycle_first = l_iter->
prev;
525 if (j != -1 && vheap_table[j] &&
529 l_cycle_iter->
v, delimit, &delimit_data);
532 }
while ((l_cycle_iter = l_cycle_iter->
next) != l_cycle_first);
534 }
while ((l_iter = l_iter->
radial_next) != l_first);
540 if (e_new ==
nullptr) [[unlikely]] {
552 const float angle_limit,
553 const bool do_dissolve_boundaries,
566 do_dissolve_boundaries,
574 MEM_delete(vinput_arr);
575 MEM_delete(einput_arr);
CustomData interface, see also DNA_customdata_types.h.
A min-heap / priority queue ADT.
Read Blender memory allocation and freeing.
#define BM_DISK_EDGE_NEXT(e, v)
#define BM_FACE_FIRST_LOOP(p)
#define USE_DEGENERATE_CHECK
#define BM_elem_index_get(ele)
#define BM_elem_flag_set(ele, hflag, val)
#define BM_elem_index_set(ele, index)
#define BM_elem_flag_test(ele, hflag)
#define BM_ITER_ELEM(ele, iter, data, itype)
#define BM_ITER_MESH(ele, iter, bm, itype)
#define BM_ITER_MESH_INDEX(ele, iter, bm, itype, indexvar)
#define BMO_face_flag_enable(bm, e, oflag)
SIMD_FORCE_INLINE btScalar angle(const btVector3 &v) const
Return the angle between this and another vector.
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
void void bool BLI_heap_is_empty(const Heap *heap) ATTR_NONNULL(1)
void BM_mesh_elem_index_ensure(BMesh *bm, const char htype)
Heap * BLI_heap_new_ex(unsigned int reserve_num) ATTR_WARN_UNUSED_RESULT
BLI_INLINE bool BM_edge_is_wire(const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
int CustomData_number_of_layers(const CustomData *data, eCustomDataType type)
float BM_edge_calc_face_angle(const BMEdge *e)
HeapNode * BLI_heap_top(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void * MEM_new_array_uninitialized(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
void BM_vert_kill(BMesh *bm, BMVert *v)
void void BLI_heap_remove(Heap *heap, HeapNode *node) ATTR_NONNULL(1
static bool bm_vert_collapse_is_degenerate(BMVert *v)
int CustomData_get_n_offset(const CustomData *data, eCustomDataType type, int n)
void BM_mesh_decimate_dissolve(BMesh *bm, float angle_limit, bool do_dissolve_boundaries, const BMO_Delimit delimit)
void BLI_heap_free(Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1)
MINLINE void swap_v2_v2(float a[2], float b[2])
MINLINE int max_ii(int a, int b)
int CustomData_sizeof(eCustomDataType type)
ATTR_WARN_UNUSED_RESULT const BMVert * v
static bool bm_edge_is_contiguous_loop_cd_all(const BMEdge *e, const DelimitData_CD *delimit_data)
float BM_vert_calc_edge_angle(const BMVert *v)
BLI_INLINE bool BM_edge_is_manifold(const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
MINLINE float cross_tri_v2(const float v1[2], const float v2[2], const float v3[2])
void MEM_delete_void(void *vmemh)
BLI_INLINE BMVert * BM_edge_other_vert(BMEdge *e, const BMVert *v) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
static bool bm_edge_is_delimiter(const BMEdge *e, const BMO_Delimit delimit, const DelimitData *delimit_data)
void BM_mesh_decimate_dissolve_ex(BMesh *bm, float angle_limit, bool do_dissolve_boundaries, BMO_Delimit delimit, BMVert **vinput_arr, int vinput_len, BMEdge **einput_arr, int einput_len, short oflag_out)
void BM_face_normal_update(BMFace *f)
void BM_edge_kill(BMesh *bm, BMEdge *e)
MINLINE int signum_i(float a)
BLI_INLINE bool BM_edge_is_contiguous(const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
HeapNode * BLI_heap_insert(Heap *heap, float value, void *ptr) ATTR_NONNULL(1)
static float bm_edge_calc_dissolve_error(const BMEdge *e, const BMO_Delimit delimit, const DelimitData *delimit_data)
static float bm_vert_edge_face_angle(BMVert *v, const BMO_Delimit delimit, const DelimitData *delimit_data)
void * BM_iter_as_arrayN(BMesh *bm, const char itype, void *data, int *r_len, void **stack_array, int stack_array_size)
Iterator as Array.
BMEdge * BM_vert_collapse_edge(BMesh *bm, BMEdge *e_kill, BMVert *v_kill, const bool do_del, const bool kill_degenerate_faces, const bool kill_duplicate_faces)
Vert Collapse Faces.
static bool bm_vert_is_delimiter(const BMVert *v, const BMO_Delimit delimit, const DelimitData *delimit_data)
bool isect_point_tri_v2_cw(const float pt[2], const float v1[2], const float v2[2], const float v3[2])
MINLINE void sub_v3_v3v3(float r[3], const float a[3], const float b[3])
void BLI_heap_node_value_update(Heap *heap, HeapNode *node, float value) ATTR_NONNULL(1
ATTR_WARN_UNUSED_RESULT const BMVert * v2
static bool bm_loop_collapse_is_degenerate(BMLoop *l_ear)
bool BM_vert_is_edge_pair(const BMVert *v)
bool BM_vert_edge_pair(const BMVert *v, BMEdge **r_e_a, BMEdge **r_e_b)
BMFace * BM_faces_join_pair(BMesh *bm, BMLoop *l_a, BMLoop *l_b, const bool do_del, BMFace **r_double)
Faces Join Pair.
MINLINE float dot_v3v3(const float a[3], const float b[3]) ATTR_WARN_UNUSED_RESULT
float cos_v3v3v3(const float p1[3], const float p2[3], const float p3[3]) ATTR_WARN_UNUSED_RESULT
MINLINE void zero_v2(float r[2])
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
static void mul_v2_m3v3_center(float r[2], const float m[3][3], const float a[3], const float center[3])
bool BM_edge_is_contiguous_loop_cd(const BMEdge *e, const int cd_loop_type, const int cd_loop_offset)
void axis_dominant_v3_to_m3(float r_mat[3][3], const float normal[3])
Normal to x,y matrix.
void * BLI_heap_node_ptr(const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void void float BLI_heap_node_value(const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
struct BMLoop * radial_next