44#define EFLAG_SET(eed, val) \
46 CHECK_TYPE(eed, ScanFillEdge *); \
47 (eed)->user_flag = (eed)->user_flag | uint(val); \
51# define EFLAG_CLEAR(eed, val) \
53 CHECK_TYPE(eed, ScanFillEdge *); \
54 (eed)->user_flag = (eed)->user_flag & ~uint(val); \
59#define VFLAG_SET(eve, val) \
61 CHECK_TYPE(eve, ScanFillVert *); \
62 (eve)->user_flag = (eve)->user_flag | uint(val); \
66# define VFLAG_CLEAR(eve, val) \
68 CHECK_TYPE(eve, ScanFillVert *); \
69 (eve)->user_flags = (eve)->user_flag & ~uint(val); \
75void BLI_scanfill_obj_dump(ScanFillContext *sf_ctx)
77 FILE *f = fopen(
"test.obj",
"w");
83 for (eve = sf_ctx->fillvertbase.first_; eve; eve = eve->next, i++) {
84 fprintf(f,
"v %f %f %f\n",
UNPACK3(eve->co));
87 for (eed = sf_ctx->filledgebase.first_; eed; eed = eed->next) {
88 fprintf(f,
"f %d %d\n", eed->v1->keyindex, eed->v2->keyindex);
106 ListBaseT<LinkData> *e_ls;
110 isect_link->
data = isect;
118 const float *co =
static_cast<const float *
>(thunk);
121 (
static_cast<const LinkData *
>(def_a_ptr))->data);
123 (
static_cast<const LinkData *
>(def_b_ptr))->data);
147 if (
ELEM(v_curr, eed->
v1, eed->
v2) ==
true &&
ELEM(v_prev, eed->
v1, eed->
v2) ==
false) {
153 if (
ELEM(v_curr, eed->
v1, eed->
v2) ==
true &&
ELEM(v_prev, eed->
v1, eed->
v2) ==
false) {
164 ListBaseT<ScanFillEdge> *filledgebase)
168 ListBaseT<ScanFillIsect> isect_lb = {
nullptr};
177 for (eed_other = eed->
next; eed_other;
178 eed_other = (eed_other == pi->
edge_last) ?
nullptr : eed_other->
next)
180 if (!
ELEM(eed->
v1, eed_other->
v1, eed_other->
v2) &&
181 !
ELEM(eed->
v2, eed_other->
v1, eed_other->
v2) && (eed != eed_other))
192 if (isect_hash ==
nullptr) [[unlikely]] {
193 isect_hash = MEM_new<IsectMap>(__func__);
201 isect->
co[2] = eed->
v1->
co[2];
216 if (isect_hash ==
nullptr) {
226 ListBaseT<LinkData> *e_ls = isect_hash->
lookup_default(eed,
nullptr);
228 if (e_ls ==
nullptr) [[unlikely]] {
239 if (e_ls->is_single() ==
false) {
258 for (
LinkData &isect_link : *e_ls) {
273 e_ls->free_no_destruct();
283 isect_lb.free_no_destruct();
284 MEM_delete(isect_hash);
317 if (eed->
v2->
co[0] < min_x) {
318 min_x = eed->
v2->
co[0];
337 v_next = (e_next->
v1 == v_curr) ? e_next->
v2 : e_next->
v1;
353 e_next =
edge_step(poly_info, poly_nr, v_prev, v_curr, e_curr);
355 }
while (e_curr != e_init);
362 ListBaseT<ScanFillVert> *remvertbase,
363 ListBaseT<ScanFillEdge> *remedgebase)
366 bool changed =
false;
382 for (
auto [eed_index, eed] : sf_ctx->
filledgebase.enumerate()) {
386 if ((poly_info[poly_nr].edge_last !=
nullptr) &&
387 (poly_info[poly_nr].edge_last->poly_nr != eed.poly_nr))
392 if (poly_info[poly_nr].edge_first ==
nullptr) {
396 else if (poly_info[poly_nr].edge_last->poly_nr == eed.poly_nr) {
407 for (poly_nr = 0; poly_nr < poly_num; poly_nr++) {
412 MEM_delete(poly_info);
414 if (changed ==
false) {
456 BLI_scanfill_view3d_dump(sf_ctx);
457 BLI_scanfill_obj_dump(sf_ctx);
These structs are the foundation for all linked lists in the library system.
Read Blender memory allocation and freeing.
Value lookup_default(const Key &key, const Value &default_value) const
Value & lookup_or_add_cb(const Key &key, const CreateValueF &create_value)
void * MEM_new_uninitialized(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
static int edge_isect_ls_sort_cb(void *thunk, const void *def_a_ptr, const void *def_b_ptr)
bool BLI_scanfill_calc_self_isect(ScanFillContext *sf_ctx, ListBaseT< ScanFillVert > *remvertbase, ListBaseT< ScanFillEdge > *remedgebase)
MINLINE void copy_v2_v2(float r[2], const float a[2])
static bool scanfill_preprocess_self_isect(ScanFillContext *sf_ctx, PolyInfo *poly_info, const ushort poly_nr, ListBaseT< ScanFillEdge > *filledgebase)
int isect_seg_seg_v2_point(const float v0[2], const float v1[2], const float v2[2], const float v3[2], float r_vi[2])
void * MEM_new_zeroed(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
void void void BLI_listbase_sort_r(ListBase *listbase, int(*cmp)(void *, const void *, const void *), void *thunk) ATTR_NONNULL(1
void BLI_remlink(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
void BLI_insertlinkafter(ListBase *listbase, void *vprevlink, void *vnewlink) ATTR_NONNULL(1)
struct ScanFillVert * BLI_scanfill_vert_add(ScanFillContext *sf_ctx, const float vec[3])
struct ScanFillEdge * BLI_scanfill_edge_add(ScanFillContext *sf_ctx, struct ScanFillVert *v1, struct ScanFillVert *v2)
Map< ScanFillEdge *, ListBaseT< LinkData > * > IsectMap
void BLI_addtail(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
static BMEdge * edge_step(BMVert *v, BMEdge *edge, BMVert **r_next_vertex)
static ListBaseT< LinkData > * edge_isect_ls_ensure(IsectMap *isect_hash, ScanFillEdge *eed)
MINLINE float len_squared_v2v2(const float a[2], const float b[2]) ATTR_WARN_UNUSED_RESULT
void * MEM_new_array_zeroed(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
static ListBaseT< LinkData > * edge_isect_ls_add(IsectMap *isect_hash, ScanFillEdge *eed, ScanFillIsect *isect)
#define EFLAG_SET(eed, val)
#define VFLAG_SET(eve, val)
ScanFillEdge * edge_first
ScanFillVert * vert_outer
ListBaseT< ScanFillEdge > filledgebase
ListBaseT< ScanFillVert > fillvertbase
struct ScanFillEdge * prev
struct ScanFillEdge * next