1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
|
/*
* ***** BEGIN GPL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* Contributor(s): Campbell Barton
*
* ***** END GPL LICENSE BLOCK *****
*/
/** \file blender/bmesh/operators/bmo_inset.c
* \ingroup bmesh
*
* Inset face regions.
* Inset individual faces.
*
*/
#include "MEM_guardedalloc.h"
#include "BLI_math.h"
#include "BLI_alloca.h"
#include "BLI_memarena.h"
#include "BKE_customdata.h"
#include "bmesh.h"
#include "intern/bmesh_operators_private.h" /* own include */
#define ELE_NEW 1
/* -------------------------------------------------------------------- */
/* Generic Interp Face (use for both types of inset) */
/**
* Interpolation, this is more complex for regions since we're not creating new faces
* and throwing away old ones, so instead, store face data needed for interpolation.
*
* \note This uses CustomData functions in quite a low-level way which should be
* avoided, but in this case its hard to do without storing a duplicate mesh. */
/* just enough of a face to store interpolation data we can use once the inset is done */
typedef struct InterpFace {
BMFace *f;
void **blocks_l;
void **blocks_v;
float (*cos_2d)[2];
float axis_mat[3][3];
} InterpFace;
/* basically a clone of #BM_vert_interp_from_face */
static void bm_interp_face_store(InterpFace *iface, BMesh *bm, BMFace *f, MemArena *interp_arena)
{
BMLoop *l_iter, *l_first;
void **blocks_l = iface->blocks_l = BLI_memarena_alloc(interp_arena, sizeof(*iface->blocks_l) * f->len);
void **blocks_v = iface->blocks_v = BLI_memarena_alloc(interp_arena, sizeof(*iface->blocks_v) * f->len);
float (*cos_2d)[2] = iface->cos_2d = BLI_memarena_alloc(interp_arena, sizeof(*iface->cos_2d) * f->len);
void *axis_mat = iface->axis_mat;
int i;
BLI_assert(BM_face_is_normal_valid(f));
axis_dominant_v3_to_m3(axis_mat, f->no);
iface->f = f;
i = 0;
l_iter = l_first = BM_FACE_FIRST_LOOP(f);
do {
mul_v2_m3v3(cos_2d[i], axis_mat, l_iter->v->co);
blocks_l[i] = NULL;
CustomData_bmesh_copy_data(&bm->ldata, &bm->ldata, l_iter->head.data, &blocks_l[i]);
/* if we were not modifying the loops later we would do... */
// blocks[i] = l_iter->head.data;
blocks_v[i] = NULL;
CustomData_bmesh_copy_data(&bm->vdata, &bm->vdata, l_iter->v->head.data, &blocks_v[i]);
/* use later for index lookups */
BM_elem_index_set(l_iter, i); /* set_ok */
} while (i++, (l_iter = l_iter->next) != l_first);
}
static void bm_interp_face_free(InterpFace *iface, BMesh *bm)
{
void **blocks_l = iface->blocks_l;
void **blocks_v = iface->blocks_v;
int i;
for (i = 0; i < iface->f->len; i++) {
CustomData_bmesh_free_block(&bm->ldata, &blocks_l[i]);
CustomData_bmesh_free_block(&bm->vdata, &blocks_v[i]);
}
}
/* -------------------------------------------------------------------- */
/* Inset Individual */
static void bmo_face_inset_individual(
BMesh *bm, BMFace *f, MemArena *interp_arena,
const float thickness, const float depth,
const bool use_even_offset, const bool use_relative_offset, const bool use_interpolate)
{
InterpFace *iface = NULL;
/* stores verts split away from the face (aligned with face verts) */
BMVert **verts = BLI_array_alloca(verts, f->len);
/* store edge normals (aligned with face-loop-edges) */
float (*edge_nors)[3] = BLI_array_alloca(edge_nors, f->len);
float (*coords)[3] = BLI_array_alloca(coords, f->len);
BMLoop *l_iter, *l_first;
BMLoop *l_other;
unsigned int i;
float e_length_prev;
l_first = BM_FACE_FIRST_LOOP(f);
/* split off all loops */
l_iter = l_first;
i = 0;
do {
BMVert *v_other = l_iter->v;
BMVert *v_sep = BM_face_loop_separate(bm, l_iter);
if (v_sep == v_other) {
v_other = BM_vert_create(bm, l_iter->v->co, l_iter->v, BM_CREATE_NOP);
}
verts[i] = v_other;
/* unrelated to splitting, but calc here */
BM_edge_calc_face_tangent(l_iter->e, l_iter, edge_nors[i]);
} while (i++, ((l_iter = l_iter->next) != l_first));
/* build rim faces */
l_iter = l_first;
i = 0;
do {
BMFace *f_new_outer;
BMVert *v_other = verts[i];
BMVert *v_other_next = verts[(i + 1) % f->len];
BMEdge *e_other = BM_edge_create(bm, v_other, v_other_next, l_iter->e, BM_CREATE_NO_DOUBLE);
(void)e_other;
f_new_outer = BM_face_create_quad_tri(bm,
v_other,
v_other_next,
l_iter->next->v,
l_iter->v,
f, BM_CREATE_NOP);
BMO_elem_flag_enable(bm, f_new_outer, ELE_NEW);
/* copy loop data */
l_other = l_iter->radial_next;
BM_elem_attrs_copy(bm, bm, l_iter->next, l_other->prev);
BM_elem_attrs_copy(bm, bm, l_iter, l_other->next->next);
if (use_interpolate == false) {
BM_elem_attrs_copy(bm, bm, l_iter->next, l_other);
BM_elem_attrs_copy(bm, bm, l_iter, l_other->next);
}
} while (i++, ((l_iter = l_iter->next) != l_first));
/* hold interpolation values */
if (use_interpolate) {
iface = BLI_memarena_alloc(interp_arena, sizeof(*iface));
bm_interp_face_store(iface, bm, f, interp_arena);
}
/* Calculate translation vector for new */
l_iter = l_first;
i = 0;
if (depth != 0.0f) {
e_length_prev = BM_edge_calc_length(l_iter->prev->e);
}
do {
const float *eno_prev = edge_nors[(i ? i : f->len) - 1];
const float *eno_next = edge_nors[i];
float tvec[3];
float v_new_co[3];
add_v3_v3v3(tvec, eno_prev, eno_next);
normalize_v3(tvec);
copy_v3_v3(v_new_co, l_iter->v->co);
if (use_even_offset) {
mul_v3_fl(tvec, shell_angle_to_dist(angle_normalized_v3v3(eno_prev, eno_next) / 2.0f));
}
/* Modify vertices and their normals */
if (use_relative_offset) {
mul_v3_fl(tvec, (BM_edge_calc_length(l_iter->e) + BM_edge_calc_length(l_iter->prev->e)) / 2.0f);
}
madd_v3_v3fl(v_new_co, tvec, thickness);
/* Set normal, add depth and write new vertex position*/
copy_v3_v3(l_iter->v->no, f->no);
if (depth != 0.0f) {
const float e_length = BM_edge_calc_length(l_iter->e);
const float fac = depth * (use_relative_offset ? ((e_length_prev + e_length) * 0.5f) : 1.0f);
e_length_prev = e_length;
madd_v3_v3fl(v_new_co, f->no, fac);
}
copy_v3_v3(coords[i], v_new_co);
} while (i++, ((l_iter = l_iter->next) != l_first));
/* update the coords */
l_iter = l_first;
i = 0;
do {
copy_v3_v3(l_iter->v->co, coords[i]);
} while (i++, ((l_iter = l_iter->next) != l_first));
if (use_interpolate) {
BM_face_interp_from_face_ex(bm, iface->f, iface->f, true,
iface->blocks_l, iface->blocks_v, iface->cos_2d, iface->axis_mat);
/* build rim faces */
l_iter = l_first;
do {
/* copy loop data */
l_other = l_iter->radial_next;
BM_elem_attrs_copy(bm, bm, l_iter->next, l_other);
BM_elem_attrs_copy(bm, bm, l_iter, l_other->next);
} while ((l_iter = l_iter->next) != l_first);
bm_interp_face_free(iface, bm);
}
}
/**
* Individual Face Inset.
* Find all tagged faces (f), duplicate edges around faces, inset verts of
* created edges, create new faces between old and new edges, fill face
* between connected new edges, kill old face (f).
*/
void bmo_inset_individual_exec(BMesh *bm, BMOperator *op)
{
BMFace *f;
BMOIter oiter;
MemArena *interp_arena = NULL;
const float thickness = BMO_slot_float_get(op->slots_in, "thickness");
const float depth = BMO_slot_float_get(op->slots_in, "depth");
const bool use_even_offset = BMO_slot_bool_get(op->slots_in, "use_even_offset");
const bool use_relative_offset = BMO_slot_bool_get(op->slots_in, "use_relative_offset");
const bool use_interpolate = BMO_slot_bool_get(op->slots_in, "use_interpolate");
/* Only tag faces in slot */
BM_mesh_elem_hflag_disable_all(bm, BM_FACE, BM_ELEM_TAG, false);
BMO_slot_buffer_hflag_enable(bm, op->slots_in, "faces", BM_FACE, BM_ELEM_TAG, false);
if (use_interpolate) {
interp_arena = BLI_memarena_new(BLI_MEMARENA_STD_BUFSIZE, __func__);
}
BMO_ITER (f, &oiter, op->slots_in, "faces", BM_FACE) {
bmo_face_inset_individual(
bm, f, interp_arena,
thickness, depth,
use_even_offset, use_relative_offset, use_interpolate);
if (use_interpolate) {
BLI_memarena_clear(interp_arena);
}
}
/* we could flag new edges/verts too, is it useful? */
BMO_slot_buffer_from_enabled_flag(bm, op, op->slots_out, "faces.out", BM_FACE, ELE_NEW);
if (use_interpolate) {
BLI_memarena_free(interp_arena);
}
}
/* -------------------------------------------------------------------- */
/* Inset Region */
typedef struct SplitEdgeInfo {
float no[3];
float length;
BMEdge *e_old;
BMEdge *e_new;
BMLoop *l;
} SplitEdgeInfo;
/**
* return the tag loop where there is...
* - only 1 tagged face attached to this edge.
* - 1 or more untagged faces.
*
* \note this function looks to be expensive
* but in most cases it will only do 2 iterations.
*/
static BMLoop *bm_edge_is_mixed_face_tag(BMLoop *l)
{
if (LIKELY(l != NULL)) {
int tot_tag = 0;
int tot_untag = 0;
BMLoop *l_iter;
BMLoop *l_tag = NULL;
l_iter = l;
do {
if (BM_elem_flag_test(l_iter->f, BM_ELEM_TAG)) {
/* more than one tagged face - bail out early! */
if (tot_tag == 1) {
return NULL;
}
l_tag = l_iter;
tot_tag++;
}
else {
tot_untag++;
}
} while ((l_iter = l_iter->radial_next) != l);
return ((tot_tag == 1) && (tot_untag >= 1)) ? l_tag : NULL;
}
else {
return NULL;
}
}
static float bm_edge_info_average_length(BMVert *v, SplitEdgeInfo *edge_info)
{
BMIter iter;
BMEdge *e;
float len = 0.0f;
int tot = 0;
BM_ITER_ELEM (e, &iter, v, BM_EDGES_OF_VERT) {
const int i = BM_elem_index_get(e);
if (i != -1) {
len += edge_info[i].length;
tot++;
}
}
BLI_assert(tot != 0);
return len / (float)tot;
}
/**
* implementation is as follows...
*
* - set all faces as tagged/untagged based on selection.
* - find all edges that have 1 tagged, 1 untagged face.
* - separate these edges and tag vertices, set their index to point to the original edge.
* - build faces between old/new edges.
* - inset the new edges into their faces.
*/
void bmo_inset_region_exec(BMesh *bm, BMOperator *op)
{
const bool use_outset = BMO_slot_bool_get(op->slots_in, "use_outset");
const bool use_boundary = BMO_slot_bool_get(op->slots_in, "use_boundary") && (use_outset == false);
const bool use_even_offset = BMO_slot_bool_get(op->slots_in, "use_even_offset");
const bool use_even_boundry = use_even_offset; /* could make own option */
const bool use_relative_offset = BMO_slot_bool_get(op->slots_in, "use_relative_offset");
const bool use_edge_rail = BMO_slot_bool_get(op->slots_in, "use_edge_rail");
const bool use_interpolate = BMO_slot_bool_get(op->slots_in, "use_interpolate");
const float thickness = BMO_slot_float_get(op->slots_in, "thickness");
const float depth = BMO_slot_float_get(op->slots_in, "depth");
int edge_info_len = 0;
BMIter iter;
SplitEdgeInfo *edge_info;
SplitEdgeInfo *es;
/* Interpolation Vars */
/* an array alligned with faces but only fill items which are used. */
InterpFace **iface_array = NULL;
int iface_array_len;
MemArena *interp_arena = NULL;
/* BMVert original location storage */
const bool use_vert_coords_orig = use_edge_rail;
MemArena *vert_coords_orig = NULL;
GHash *vert_coords = NULL;
BMVert *v;
BMEdge *e;
BMFace *f;
int i, j, k;
if (use_interpolate) {
interp_arena = BLI_memarena_new(BLI_MEMARENA_STD_BUFSIZE, __func__);
/* warning, we could be more clever here and not over alloc */
iface_array = MEM_callocN(sizeof(*iface_array) * bm->totface, __func__);
iface_array_len = bm->totface;
}
if (use_outset == false) {
BM_mesh_elem_hflag_disable_all(bm, BM_FACE, BM_ELEM_TAG, false);
BMO_slot_buffer_hflag_enable(bm, op->slots_in, "faces", BM_FACE, BM_ELEM_TAG, false);
}
else {
BM_mesh_elem_hflag_enable_all(bm, BM_FACE, BM_ELEM_TAG, false);
BMO_slot_buffer_hflag_disable(bm, op->slots_in, "faces", BM_FACE, BM_ELEM_TAG, false);
}
/* first count all inset edges we will split */
/* fill in array and initialize tagging */
BM_ITER_MESH (e, &iter, bm, BM_EDGES_OF_MESH) {
if (
/* tag if boundary is enabled */
(use_boundary && BM_edge_is_boundary(e) && BM_elem_flag_test(e->l->f, BM_ELEM_TAG)) ||
/* tag if edge is an interior edge inbetween a tagged and untagged face */
(bm_edge_is_mixed_face_tag(e->l)))
{
/* tag */
BM_elem_flag_enable(e->v1, BM_ELEM_TAG);
BM_elem_flag_enable(e->v2, BM_ELEM_TAG);
BM_elem_flag_enable(e, BM_ELEM_TAG);
BM_elem_index_set(e, edge_info_len); /* set_dirty! */
edge_info_len++;
}
else {
BM_elem_flag_disable(e->v1, BM_ELEM_TAG);
BM_elem_flag_disable(e->v2, BM_ELEM_TAG);
BM_elem_flag_disable(e, BM_ELEM_TAG);
BM_elem_index_set(e, -1); /* set_dirty! */
}
}
bm->elem_index_dirty |= BM_EDGE;
edge_info = MEM_mallocN(edge_info_len * sizeof(SplitEdgeInfo), __func__);
/* fill in array and initialize tagging */
es = edge_info;
BM_ITER_MESH (e, &iter, bm, BM_EDGES_OF_MESH) {
i = BM_elem_index_get(e);
if (i != -1) {
/* calc edge-split info */
es->length = BM_edge_calc_length(e);
es->e_old = e;
es++;
/* initialize no and e_new after */
}
}
if (use_vert_coords_orig) {
vert_coords_orig = BLI_memarena_new(BLI_MEMARENA_STD_BUFSIZE, __func__);
vert_coords = BLI_ghash_ptr_new(__func__);
}
/* util macros */
#define VERT_ORIG_STORE(_v) { \
float *_co = BLI_memarena_alloc(vert_coords_orig, sizeof(float[3])); \
copy_v3_v3(_co, (_v)->co); \
BLI_ghash_insert(vert_coords, _v, _co); \
} (void)0
#define VERT_ORIG_GET(_v) \
(const float *)BLI_ghash_lookup_default(vert_coords, (_v), (_v)->co)
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
if ((es->l = bm_edge_is_mixed_face_tag(es->e_old->l))) {
/* do nothing */
}
else {
es->l = es->e_old->l; /* must be a boundary */
}
/* run the separate arg */
bmesh_edge_separate(bm, es->e_old, es->l, false);
/* calc edge-split info */
es->e_new = es->l->e;
BM_edge_calc_face_tangent(es->e_new, es->l, es->no);
if (es->e_new == es->e_old) { /* happens on boundary edges */
/* take care here, we're creating this double edge which _must_ have its verts replaced later on */
es->e_old = BM_edge_create(bm, es->e_new->v1, es->e_new->v2, es->e_new, BM_CREATE_NOP);
}
/* store index back to original in 'edge_info' */
BM_elem_index_set(es->e_new, i);
BM_elem_flag_enable(es->e_new, BM_ELEM_TAG);
/* important to tag again here */
BM_elem_flag_enable(es->e_new->v1, BM_ELEM_TAG);
BM_elem_flag_enable(es->e_new->v2, BM_ELEM_TAG);
/* initialize interpolation vars */
/* this could go in its own loop,
* only use the 'es->l->f' so we don't store loops for faces which have no mixed selection
*
* note: faces on the other side of the inset will be interpolated too since this is hard to
* detect, just allow it even though it will cause some redundant interpolation */
if (use_interpolate) {
BMIter viter;
BM_ITER_ELEM (v, &viter, es->l->e, BM_VERTS_OF_EDGE) {
BMIter fiter;
BM_ITER_ELEM (f, &fiter, v, BM_FACES_OF_VERT) {
const int j = BM_elem_index_get(f);
if (iface_array[j] == NULL) {
InterpFace *iface = BLI_memarena_alloc(interp_arena, sizeof(*iface));
bm_interp_face_store(iface, bm, f, interp_arena);
iface_array[j] = iface;
}
}
}
}
/* done interpolation */
}
/* show edge normals for debugging */
#if 0
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
float tvec[3];
BMVert *v1, *v2;
mid_v3_v3v3(tvec, es->e_new->v1->co, es->e_new->v2->co);
v1 = BM_vert_create(bm, tvec, NULL, BM_CREATE_NOP);
v2 = BM_vert_create(bm, tvec, NULL, BM_CREATE_NOP);
madd_v3_v3fl(v2->co, es->no, 0.1f);
BM_edge_create(bm, v1, v2, NULL, 0);
}
#endif
/* execute the split and position verts, it would be most obvious to loop over verts
* here but don't do this since we will be splitting them off (iterating stuff you modify is bad juju)
* instead loop over edges then their verts */
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
for (j = 0; j < 2; j++) {
v = (j == 0) ? es->e_new->v1 : es->e_new->v2;
/* end confusing part - just pretend this is a typical loop on verts */
/* only split of tagged verts - used by separated edges */
/* comment the first part because we know this verts in a tagged face */
if (/* v->e && */BM_elem_flag_test(v, BM_ELEM_TAG)) {
BMVert **vout;
int r_vout_len;
BMVert *v_glue = NULL;
/* disable touching twice, this _will_ happen if the flags not disabled */
BM_elem_flag_disable(v, BM_ELEM_TAG);
bmesh_vert_separate(bm, v, &vout, &r_vout_len, false);
v = NULL; /* don't use again */
/* in some cases the edge doesn't split off */
if (r_vout_len == 1) {
if (use_vert_coords_orig) {
VERT_ORIG_STORE(vout[0]);
}
MEM_freeN(vout);
continue;
}
for (k = 0; k < r_vout_len; k++) {
BMVert *v_split = vout[k]; /* only to avoid vout[k] all over */
/* need to check if this vertex is from a */
int vert_edge_tag_tot = 0;
int vecpair[2];
if (use_vert_coords_orig) {
VERT_ORIG_STORE(v_split);
}
/* find adjacent */
BM_ITER_ELEM (e, &iter, v_split, BM_EDGES_OF_VERT) {
if (BM_elem_flag_test(e, BM_ELEM_TAG) &&
e->l && BM_elem_flag_test(e->l->f, BM_ELEM_TAG))
{
if (vert_edge_tag_tot < 2) {
vecpair[vert_edge_tag_tot] = BM_elem_index_get(e);
BLI_assert(vecpair[vert_edge_tag_tot] != -1);
}
vert_edge_tag_tot++;
}
}
if (vert_edge_tag_tot != 0) {
float tvec[3];
if (vert_edge_tag_tot >= 2) { /* 2 edge users - common case */
/* now there are 2 cases to check for,
*
* if both edges use the same face OR both faces have the same normal,
* ...then we can calculate an edge that fits nicely between the 2 edge normals.
*
* Otherwise use the shared edge OR the corner defined by these 2 face normals,
* when both edges faces are adjacent this works best but even when this vertex
* fans out faces it should work ok.
*/
SplitEdgeInfo *e_info_a = &edge_info[vecpair[0]];
SplitEdgeInfo *e_info_b = &edge_info[vecpair[1]];
BMFace *f_a = e_info_a->l->f;
BMFace *f_b = e_info_b->l->f;
/* set to true when we're not in-between (e_info_a->no, e_info_b->no) exactly
* in this case use a check the angle of the tvec when calculating shell thickness */
bool is_mid = true;
/* we use this as either the normal OR to find the right direction for the
* cross product between both face normals */
add_v3_v3v3(tvec, e_info_a->no, e_info_b->no);
if (use_edge_rail == false) {
/* pass */
}
else if (f_a != f_b) {
/* these lookups are very quick */
BMLoop *l_other_a = BM_loop_other_vert_loop(e_info_a->l, v_split);
BMLoop *l_other_b = BM_loop_other_vert_loop(e_info_b->l, v_split);
if (l_other_a->v == l_other_b->v) {
/* both edges faces are adjacent, but we don't need to know the shared edge
* having both verts is enough. */
const float *co_other;
/* note that we can't use 'l_other_a->v' directly since it
* may be inset and give a feedback loop. */
if (use_vert_coords_orig) {
co_other = VERT_ORIG_GET(l_other_a->v);
}
else {
co_other = l_other_a->v->co;
}
sub_v3_v3v3(tvec, co_other, v_split->co);
is_mid = false;
}
/* distable gives odd results at times, see [#39288] */
#if 0
else if (compare_v3v3(f_a->no, f_b->no, 0.001f) == false) {
/* epsilon increased to fix [#32329] */
/* faces don't touch,
* just get cross product of their normals, its *good enough*
*/
float tno[3];
cross_v3_v3v3(tno, f_a->no, f_b->no);
if (dot_v3v3(tvec, tno) < 0.0f) {
negate_v3(tno);
}
copy_v3_v3(tvec, tno);
is_mid = false;
}
#endif
}
normalize_v3(tvec);
/* scale by edge angle */
if (use_even_offset) {
if (is_mid) {
mul_v3_fl(tvec, shell_angle_to_dist(angle_normalized_v3v3(e_info_a->no,
e_info_b->no) / 2.0f));
}
else {
mul_v3_fl(tvec, shell_angle_to_dist(max_ff(angle_normalized_v3v3(tvec,
e_info_a->no),
angle_normalized_v3v3(tvec,
e_info_b->no))));
}
}
/* scale relative to edge lengths */
if (use_relative_offset) {
mul_v3_fl(tvec, (edge_info[vecpair[0]].length + edge_info[vecpair[1]].length) / 2.0f);
}
}
else if (vert_edge_tag_tot == 1) { /* 1 edge user - boundary vert, not so common */
const float *e_no_a = edge_info[vecpair[0]].no;
if (use_even_boundry) {
/* This case where only one edge attached to v_split
* is used - ei - the face to inset is on a boundary.
*
* We want the inset to align flush with the
* boundary edge, not the normal of the interior
* <--- edge which would give an unsightly bump.
* --+-------------------------+---------------+--
* |^v_other ^e_other /^v_split |
* | / |
* | / |
* | / <- tag split edge |
* | / |
* | / |
* | / |
* --+-----------------+-----------------------+--
* | |
* | |
*
* note, the fact we are doing location comparisons on verts that are moved about
* doesn't matter because the direction will remain the same in this case.
*/
BMEdge *e_other;
BMVert *v_other;
/* loop will always be either next of prev */
BMLoop *l = v_split->e->l;
if (l->prev->v == v_split) {
l = l->prev;
}
else if (l->next->v == v_split) {
l = l->next;
}
else if (l->v == v_split) {
/* pass */
}
else {
/* should never happen */
BLI_assert(0);
}
/* find the edge which is _not_ being split here */
if (!BM_elem_flag_test(l->e, BM_ELEM_TAG)) {
e_other = l->e;
}
else if (!BM_elem_flag_test(l->prev->e, BM_ELEM_TAG)) {
e_other = l->prev->e;
}
else {
BLI_assert(0);
e_other = NULL;
}
v_other = BM_edge_other_vert(e_other, v_split);
sub_v3_v3v3(tvec, v_other->co, v_split->co);
normalize_v3(tvec);
if (use_even_offset) {
mul_v3_fl(tvec, shell_v3v3_normalized_to_dist(e_no_a, tvec));
}
}
else {
copy_v3_v3(tvec, e_no_a);
}
/* use_even_offset - doesn't apply here */
/* scale relative to edge length */
if (use_relative_offset) {
mul_v3_fl(tvec, edge_info[vecpair[0]].length);
}
}
else {
/* should never happen */
BLI_assert(0);
zero_v3(tvec);
}
/* apply the offset */
madd_v3_v3fl(v_split->co, tvec, thickness);
}
/* this saves expensive/slow glue check for common cases */
if (r_vout_len > 2) {
bool ok = true;
/* last step, NULL this vertex if has a tagged face */
BM_ITER_ELEM (f, &iter, v_split, BM_FACES_OF_VERT) {
if (BM_elem_flag_test(f, BM_ELEM_TAG)) {
ok = false;
break;
}
}
if (ok) {
if (v_glue == NULL) {
v_glue = v_split;
}
else {
BM_vert_splice(bm, v_split, v_glue);
}
}
}
/* end glue */
}
MEM_freeN(vout);
}
}
}
if (use_vert_coords_orig) {
BLI_memarena_free(vert_coords_orig);
BLI_ghash_free(vert_coords, NULL, NULL);
}
if (use_interpolate) {
for (i = 0; i < iface_array_len; i++) {
if (iface_array[i]) {
InterpFace *iface = iface_array[i];
BM_face_interp_from_face_ex(bm, iface->f, iface->f, true,
iface->blocks_l, iface->blocks_v, iface->cos_2d, iface->axis_mat);
}
}
}
/* create faces */
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
BMVert *varr[4] = {NULL};
/* get the verts in the correct order */
BM_edge_ordered_verts_ex(es->e_new, &varr[1], &varr[0], es->l);
#if 0
if (varr[0] == es->e_new->v1) {
varr[2] = es->e_old->v2;
varr[3] = es->e_old->v1;
}
else {
varr[2] = es->e_old->v1;
varr[3] = es->e_old->v2;
}
j = 4;
#else
/* slightly trickier check - since we can't assume the verts are split */
j = 2; /* 2 edges are set */
if (varr[0] == es->e_new->v1) {
if (es->e_old->v2 != es->e_new->v2) { varr[j++] = es->e_old->v2; }
if (es->e_old->v1 != es->e_new->v1) { varr[j++] = es->e_old->v1; }
}
else {
if (es->e_old->v1 != es->e_new->v1) { varr[j++] = es->e_old->v1; }
if (es->e_old->v2 != es->e_new->v2) { varr[j++] = es->e_old->v2; }
}
if (j == 2) {
/* can't make face! */
continue;
}
#endif
/* no need to check doubles, we KNOW there won't be any */
/* yes - reverse face is correct in this case */
f = BM_face_create_verts(bm, varr, j, es->l->f, BM_CREATE_NOP, true);
BMO_elem_flag_enable(bm, f, ELE_NEW);
/* copy for loop data, otherwise UV's and vcols are no good.
* tiny speedup here we could be more clever and copy from known adjacent data
* also - we could attempt to interpolate the loop data, this would be much slower but more useful too */
#if 0
/* don't use this because face boundaries have no adjacent loops and won't be filled in.
* instead copy from the opposite side with the code below */
BM_face_copy_shared(bm, f, NULL, NULL);
#else
{
/* 2 inner loops on the edge between the new face and the original */
BMLoop *l_a;
BMLoop *l_b;
BMLoop *l_a_other;
BMLoop *l_b_other;
l_a = BM_FACE_FIRST_LOOP(f);
l_b = l_a->next;
/* we know this side has a radial_next because of the order of created verts in the quad */
l_a_other = BM_edge_other_loop(l_a->e, l_a);
l_b_other = BM_edge_other_loop(l_a->e, l_b);
BM_elem_attrs_copy(bm, bm, l_a_other, l_a);
BM_elem_attrs_copy(bm, bm, l_b_other, l_b);
/* step around to the opposite side of the quad - warning, this may have no other edges! */
l_a = l_a->next->next;
l_b = l_a->next;
/* swap a<->b intentionally */
if (use_interpolate) {
InterpFace *iface = iface_array[BM_elem_index_get(es->l->f)];
const int i_a = BM_elem_index_get(l_a_other);
const int i_b = BM_elem_index_get(l_b_other);
CustomData_bmesh_copy_data(&bm->ldata, &bm->ldata, iface->blocks_l[i_a], &l_b->head.data);
CustomData_bmesh_copy_data(&bm->ldata, &bm->ldata, iface->blocks_l[i_b], &l_a->head.data);
}
else {
BM_elem_attrs_copy(bm, bm, l_a_other, l_b);
BM_elem_attrs_copy(bm, bm, l_b_other, l_a);
}
}
}
#endif
if (use_interpolate) {
for (i = 0; i < iface_array_len; i++) {
if (iface_array[i]) {
bm_interp_face_free(iface_array[i], bm);
}
}
BLI_memarena_free(interp_arena);
MEM_freeN(iface_array);
}
/* we could flag new edges/verts too, is it useful? */
BMO_slot_buffer_from_enabled_flag(bm, op, op->slots_out, "faces.out", BM_FACE, ELE_NEW);
/* cheap feature to add depth to the inset */
if (depth != 0.0f) {
float (*varr_co)[3];
BMOIter oiter;
/* we need to re-calculate tagged normals, but for this purpose we can copy tagged verts from the
* faces they inset from, */
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
zero_v3(es->e_new->v1->no);
zero_v3(es->e_new->v2->no);
}
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
float *no = es->l->f->no;
add_v3_v3(es->e_new->v1->no, no);
add_v3_v3(es->e_new->v2->no, no);
}
for (i = 0, es = edge_info; i < edge_info_len; i++, es++) {
/* annoying, avoid normalizing twice */
if (len_squared_v3(es->e_new->v1->no) != 1.0f) {
normalize_v3(es->e_new->v1->no);
}
if (len_squared_v3(es->e_new->v2->no) != 1.0f) {
normalize_v3(es->e_new->v2->no);
}
}
/* done correcting edge verts normals */
/* untag verts */
BM_mesh_elem_hflag_disable_all(bm, BM_VERT, BM_ELEM_TAG, false);
/* tag face verts */
BMO_ITER (f, &oiter, op->slots_in, "faces", BM_FACE) {
BM_ITER_ELEM (v, &iter, f, BM_VERTS_OF_FACE) {
BM_elem_flag_enable(v, BM_ELEM_TAG);
}
}
/* do in 2 passes so moving the verts doesn't feed back into face angle checks
* which BM_vert_calc_shell_factor uses. */
/* over allocate */
varr_co = MEM_callocN(sizeof(*varr_co) * bm->totvert, __func__);
BM_ITER_MESH_INDEX (v, &iter, bm, BM_VERTS_OF_MESH, i) {
if (BM_elem_flag_test(v, BM_ELEM_TAG)) {
const float fac = (depth *
(use_relative_offset ? bm_edge_info_average_length(v, edge_info) : 1.0f) *
(use_even_boundry ? BM_vert_calc_shell_factor(v) : 1.0f));
madd_v3_v3v3fl(varr_co[i], v->co, v->no, fac);
}
}
BM_ITER_MESH_INDEX (v, &iter, bm, BM_VERTS_OF_MESH, i) {
if (BM_elem_flag_test(v, BM_ELEM_TAG)) {
copy_v3_v3(v->co, varr_co[i]);
}
}
MEM_freeN(varr_co);
}
MEM_freeN(edge_info);
}
|