-
Notifications
You must be signed in to change notification settings - Fork 144
/
Copy pathopennurbs_mesh_tools.cpp
1563 lines (1385 loc) · 41.1 KB
/
opennurbs_mesh_tools.cpp
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
999
1000
//
// Copyright (c) 1993-2022 Robert McNeel & Associates. All rights reserved.
// OpenNURBS, Rhinoceros, and Rhino3D are registered trademarks of Robert
// McNeel & Associates.
//
// THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY.
// ALL IMPLIED WARRANTIES OF FITNESS FOR ANY PARTICULAR PURPOSE AND OF
// MERCHANTABILITY ARE HEREBY DISCLAIMED.
//
// For complete openNURBS copyright information see <http://www.opennurbs.org>.
//
////////////////////////////////////////////////////////////////
#include "opennurbs.h"
#if !defined(ON_COMPILING_OPENNURBS)
// This check is included in all opennurbs source .c and .cpp files to insure
// ON_COMPILING_OPENNURBS is defined when opennurbs source is compiled.
// When opennurbs source is being compiled, ON_COMPILING_OPENNURBS is defined
// and the opennurbs .h files alter what is declared and how it is declared.
#error ON_COMPILING_OPENNURBS must be defined when compiling opennurbs
#endif
/////////////////////////////////////////////////////////////////////////////
// SwapMeshEdge()
//
bool ON_Mesh::SwapEdge_Helper( int topei, bool bTestOnly )
{
ON_Mesh& mesh = *this;
const ON_MeshTopology& top = mesh.Topology();
const int F_count = mesh.FaceCount();
const int V_count = mesh.VertexCount();
const int topv_count = top.m_topv.Count();
//const int tope_count = top.m_tope.Count();
if ( topei < 0 || topei >= top.m_tope.Count() )
{
return false;
}
if ( top.m_topf.Count() != F_count )
return false;
const ON_MeshTopologyEdge& tope = top.m_tope[topei];
if ( tope.m_topf_count != 2
|| tope.m_topvi[0] == tope.m_topvi[1]
|| tope.m_topvi[0] < 0
|| tope.m_topvi[1] < 0
|| tope.m_topvi[0] >= topv_count
|| tope.m_topvi[1] >= topv_count )
{
return false;
}
int fi0 = tope.m_topfi[0];
int fi1 = tope.m_topfi[1];
if ( fi0 < 0 || fi0 >= F_count || fi1 < 0 || fi1 >= F_count || fi0 == fi1 )
return false;
const ON_MeshFace& f0 = mesh.m_F[fi0];
const ON_MeshFace& f1 = mesh.m_F[fi1];
if ( !f0.IsValid(V_count) )
return false;
if ( !f1.IsValid(V_count) )
return false;
if ( !f0.IsTriangle() )
return false;
if ( !f1.IsTriangle() )
return false;
const ON_MeshTopologyFace& topf0 = top.m_topf[fi0];
const ON_MeshTopologyFace& topf1 = top.m_topf[fi1];
int fei0;
for ( fei0 = 0; fei0 < 3; fei0++ )
{
if ( topf0.m_topei[fei0] == topei )
break;
}
if ( fei0 >= 3 )
return false;
int f0_vi0 = f0.vi[(fei0+3)%4];
int f0_vi1 = f0.vi[fei0];
int f0_vi2 = f0.vi[(fei0+1)%3];
int fei1;
for ( fei1 = 0; fei1 < 3; fei1++ )
{
if ( topf1.m_topei[fei1] == topei )
break;
}
if ( fei1 >= 3 )
return false;
int f1_vi0 = f1.vi[(fei1+3)%4];
int f1_vi1 = f1.vi[fei1];
int f1_vi2 = f1.vi[(fei1+1)%3];
if ( topf0.m_reve[fei0] == topf1.m_reve[fei1] )
return false;
if ( f0_vi0 != f1_vi1 )
return false;
if ( f0_vi1 != f1_vi0 )
return false;
const ON_MeshTopologyVertex& topv0 = top.m_topv[tope.m_topvi[0]];
const ON_MeshTopologyVertex& topv1 = top.m_topv[tope.m_topvi[1]];
if ( topv0.m_v_count < 1 || topv1.m_v_count < 1 )
{
return false;
}
if ( topv0.m_vi[0] < 0 || topv0.m_vi[0] >= V_count )
{
return false;
}
if ( topv1.m_vi[0] < 0 || topv1.m_vi[0] >= V_count )
{
return false;
}
if ( bTestOnly )
return true;
ON_MeshFace newf0;
ON_MeshFace newf1;
newf0.vi[0] = f0_vi1;
newf0.vi[1] = f0_vi2;
newf0.vi[2] = f1_vi2;
newf0.vi[3] = newf0.vi[2];
newf1.vi[0] = f1_vi1;
newf1.vi[1] = f1_vi2;
newf1.vi[2] = f0_vi2;
newf1.vi[3] = newf1.vi[2];
mesh.m_F[fi0] = newf0;
mesh.m_F[fi1] = newf1;
mesh.DestroyTopology();
mesh.DestroyPartition();
return true;
}
bool ON_Mesh::IsSwappableEdge(int topei )
{
return const_cast<ON_Mesh*>(this)->SwapEdge_Helper( topei, true );
}
bool ON_Mesh::SwapEdge( int topei )
{
return SwapEdge_Helper( topei, false );
}
/////////////////////////////////////////////////////////////////////////////
// CollapseMeshEdge()
//
// DO NOT PUT THIS CLASS IN A HEADER FILE
class ON__MESHEDGE
{
public:
// ON_Mesh m_V[] indices
int vi0;
int vi1; // always > vi0
// ON_MeshTopology m_topvi[] indices
int topvi0;
int topvi1;
// ON_Mesh m_V[] index of new vertex
int newvi;
// location of vertex that will replace the edge
ON_3dPoint newV;
ON_3fVector newN;
ON_2fPoint newT;
};
// DO NOT PUT THIS CLASS IN A HEADER FILE
class ON__NEWVI
{
public:
// ON_Mesh m_V[] indices
int oldvi;
int newvi;
};
typedef int (*QSORTCMPFUNC)(const void*,const void*);
static int CompareMESHEDGE( const ON__MESHEDGE* a, const ON__MESHEDGE* b )
{
// sort based on "vi0" and vi1" values (vi0 is always < vi1)
int i = (a->vi0 - b->vi0);
if ( 0 == i )
{
i = a->vi1 - b->vi1;
}
return i;
}
static int CompareNEWVI( const ON__NEWVI* a, const ON__NEWVI* b )
{
// sort based on "oldvi" value
return a->oldvi - b->oldvi;
}
static int CompareInt( const void* a, const void* b )
{
return ( *((int*)a) - *((int*)b) );
}
static void RemoveFaceOrVertexFromNgon(ON_Mesh& mesh, const unsigned int faceidx, const int* vertidx = nullptr)
{
unsigned int NgonIdx = mesh.NgonIndexFromFaceIndex(faceidx);
const ON_MeshNgon* pOldNgon = nullptr;
pOldNgon = mesh.Ngon(NgonIdx);
if (nullptr != pOldNgon)
{
// Make a copy of the ngon we need to update.
ON_MeshNgon NewNgon;
NewNgon.m_Vcount = pOldNgon->m_Vcount;
NewNgon.m_Fcount = pOldNgon->m_Fcount;
NewNgon.m_vi = (unsigned int*)onmalloc((NewNgon.m_Vcount+ NewNgon.m_Fcount)*sizeof(unsigned int));
memcpy(NewNgon.m_vi, pOldNgon->m_vi, NewNgon.m_Vcount*sizeof(unsigned int));
NewNgon.m_fi = &NewNgon.m_vi[NewNgon.m_Vcount];
memcpy(NewNgon.m_fi, pOldNgon->m_fi, NewNgon.m_Fcount*sizeof(unsigned int));
if (nullptr != NewNgon.m_vi && nullptr != NewNgon.m_fi)
{
unsigned int ct = 0;
if (nullptr == vertidx)
{
while (NewNgon.m_Fcount > ct)
{
// find the face index in the ngon's list of faces
if (faceidx == NewNgon.m_fi[ct])
break;
ct++;
}
if (NewNgon.m_Fcount > ct)
{
// if ct isn't bogus and is not at the end already, shift the indexes
if (NewNgon.m_Fcount - 1 > ct)
memcpy(&NewNgon.m_fi[ct], &NewNgon.m_fi[ct + 1], (NewNgon.m_Fcount - (ct + 1))*sizeof(NewNgon.m_fi[0]));
NewNgon.m_Fcount--;
}
}
else
{
unsigned int idx = ON_UNSET_UINT_INDEX;
while (NewNgon.m_Vcount > ct)
{
idx = *vertidx;
// find the vertex index in the ngon's list of vertexes
if (idx == NewNgon.m_vi[ct])
break;
ct++;
}
if (NewNgon.m_Vcount > ct)
{
// if vi_idx isn't bogus and is not at the end already, shift the indexes
if (NewNgon.m_Vcount - 1 > ct)
memcpy(&NewNgon.m_vi[ct], &NewNgon.m_vi[ct + 1], (NewNgon.m_Vcount - (ct + 1))*sizeof(NewNgon.m_vi[0]));
NewNgon.m_Vcount--;
}
}
mesh.ModifyNgon(NgonIdx, &NewNgon);
}
if (nullptr != NewNgon.m_vi)
onfree(NewNgon.m_vi);
}
}
bool ON_Mesh::CollapseEdge( int topei )
{
ON_Mesh& mesh = *this;
ON__MESHEDGE me;
memset(&me,0,sizeof(me));
const ON_MeshTopology& top = mesh.Topology();
const int F_count = mesh.FaceCount();
const int V_count = mesh.VertexCount();
const int topv_count = top.m_topv.Count();
//const int tope_count = top.m_tope.Count();
if ( topei < 0 || topei >= top.m_tope.Count() )
{
return false;
}
const ON_MeshTopologyEdge& tope = top.m_tope[topei];
if ( tope.m_topf_count < 1
|| tope.m_topvi[0] == tope.m_topvi[1]
|| tope.m_topvi[0] < 0
|| tope.m_topvi[1] < 0
|| tope.m_topvi[0] >= topv_count
|| tope.m_topvi[1] >= topv_count )
{
return false;
}
const ON_MeshTopologyVertex& topv0 = top.m_topv[tope.m_topvi[0]];
const ON_MeshTopologyVertex& topv1 = top.m_topv[tope.m_topvi[1]];
if ( topv0.m_v_count < 1 || topv1.m_v_count < 1 )
{
return false;
}
if ( topv0.m_vi[0] < 0 || topv0.m_vi[0] >= V_count )
{
return false;
}
if ( topv1.m_vi[0] < 0 || topv1.m_vi[0] >= V_count )
{
return false;
}
// create a ON__MESHEDGE for each face (usually one or two) that uses the edge
ON__MESHEDGE* me_list = (ON__MESHEDGE*)alloca(tope.m_topf_count*sizeof(me_list[0]));
int me_list_count = 0;
int efi;
for ( efi = 0; efi < tope.m_topf_count; efi++ )
{
int fi = tope.m_topfi[efi];
if ( fi < 0 || fi >= F_count )
continue;
const ON_MeshFace& f = mesh.m_F[fi];
if ( !f.IsValid(V_count) )
continue;
me.vi1 = f.vi[3];
me.topvi1 = top.m_topv_map[me.vi1];
int fvi;
for ( fvi = 0; fvi < 4; fvi++ )
{
me.vi0 = me.vi1;
me.topvi0 = me.topvi1;
me.vi1 = f.vi[fvi];
me.topvi1 = top.m_topv_map[me.vi1];
if ( me.vi0 != me.vi1 )
{
if ( (me.topvi0 == tope.m_topvi[0] && me.topvi1 == tope.m_topvi[1])
|| (me.topvi0 == tope.m_topvi[1] && me.topvi1 == tope.m_topvi[0]) )
{
if ( me.vi0 > me.vi1 )
{
int i = me.vi0; me.vi0 = me.vi1; me.vi1 = i;
i = me.topvi0; me.topvi0 = me.topvi1; me.topvi1 = i;
}
me_list[me_list_count++] = me;
break;
}
}
}
}
if (me_list_count<1)
{
return false;
}
// Sort me_list[] so edges using same vertices are adjacent
// to each other in the list. This is needed so that non-manifold
// crease edges will be properly collapsed.
ON_qsort(me_list,me_list_count,sizeof(me_list[0]),(QSORTCMPFUNC)CompareMESHEDGE);
// create new vertex or vertices that edge will be
// collapsed to.
mesh.m_C.Destroy();
mesh.m_K.Destroy();
int mei;
bool bHasVertexNormals = mesh.HasVertexNormals();
bool bHasTextureCoordinates = mesh.HasTextureCoordinates();
bool bHasFaceNormals = mesh.HasFaceNormals();
if ( topv0.m_v_count == 1 || topv1.m_v_count == 1 )
{
// a single new vertex
ON_Line Vline(ON_3dPoint::Origin,ON_3dPoint::Origin);
ON_Line Tline(ON_3dPoint::Origin,ON_3dPoint::Origin);
ON_3dVector N0(0,0,0);
ON_3dVector N1(0,0,0);
ON_3dPoint P;
int vi, tvi, cnt;
int newvi = topv0.m_vi[0];
cnt = 0;
for ( tvi = 0; tvi < topv0.m_v_count; tvi++ )
{
vi = topv0.m_vi[tvi];
if ( vi < 0 || vi > V_count )
continue;
if ( vi < newvi )
newvi = vi;
cnt++;
P = mesh.Vertex(vi);
Vline.from += P;
if ( bHasVertexNormals )
{
N0 += ON_3dVector(mesh.m_N[vi]);
}
if ( bHasTextureCoordinates )
{
P = mesh.m_T[vi];
Tline.from += P;
}
}
if (cnt > 1)
{
double s = 1.0/((double)cnt);
Vline.from.x *= s;
Vline.from.y *= s;
Vline.from.z *= s;
Tline.from.x *= s;
Tline.from.y *= s;
Tline.from.z *= s;
N0 = s*N0;
}
cnt = 0;
for (tvi = 0; tvi < topv1.m_v_count; tvi++)
{
vi = topv1.m_vi[tvi];
if (vi < 0 || vi > V_count)
continue;
if (vi < newvi)
newvi = vi;
cnt++;
P = mesh.Vertex(vi);
Vline.to += P;
if ( bHasVertexNormals )
{
N1 += ON_3dVector(mesh.m_N[vi]);
}
if ( bHasTextureCoordinates )
{
P = mesh.m_T[vi];
Tline.to += P;
}
}
if (cnt > 1)
{
double s = 1.0/((double)cnt);
Vline.to.x *= s;
Vline.to.y *= s;
Vline.to.z *= s;
Tline.to.x *= s;
Tline.to.y *= s;
Tline.to.z *= s;
N1 = s*N1;
}
ON_3fPoint newV(Vline.PointAt(0.5));
ON_3fVector newN(ON_3fVector::ZeroVector);
ON_2fPoint newT(ON_2fPoint::Origin);
if ( bHasVertexNormals )
{
N0.Unitize();
N1.Unitize();
ON_3dVector N = N0+N1;
if ( !N.Unitize() )
{
N = (topv0.m_v_count == 1) ? mesh.m_N[topv0.m_vi[0]] :mesh.m_N[topv1.m_vi[0]];
}
newN = N;
}
if ( bHasTextureCoordinates )
{
newT = Tline.PointAt(0.5);
}
for ( mei = 0; mei < me_list_count; mei++ )
{
me_list[mei].newvi = newvi;
me_list[mei].newV = newV;
me_list[mei].newN = newN;
me_list[mei].newT = newT;
}
}
else
{
// collapsing a "crease" edge - attempt to preserve
// the crease.
memset(&me,0,sizeof(me));
me.vi0 = -1;
me.vi1 = -1;
for ( mei = 0; mei < me_list_count; mei++ )
{
// cook up new vertex
me_list[mei].newvi = mesh.VertexCount();
me = me_list[mei];
ON_Line line;
line.from = mesh.Vertex(me.vi0);
line.to = mesh.Vertex(me.vi1);
me.newV = line.PointAt(0.5);
if ( bHasVertexNormals )
{
ON_3dVector N0(mesh.m_N[me.vi0]);
ON_3dVector N1(mesh.m_N[me.vi1]);
ON_3dVector N = N0 + N1;
if ( !N.Unitize() )
N = N0;
me.newN = N;
}
if ( bHasTextureCoordinates )
{
line.from = mesh.m_T[me.vi0];
line.to = mesh.m_T[me.vi1];
me.newT = line.PointAt(0.5);
}
me.newvi = (me.vi0 < me.vi1) ? me.vi0 : me.vi1;
me_list[mei].newvi = me.newvi;
me_list[mei].newV = me.newV;
me_list[mei].newN = me.newN;
me_list[mei].newT = me.newT;
}
}
// We are done averaging old mesh values.
// Change values in mesh m_V[], m_N[] and m_T[] arrays.
for ( mei = 0; mei < me_list_count; mei++ )
{
// We need to set the vertex location of all mesh vertices associated with the topological
// edge or we risk "tearing apart" vertexes at corners where there are more than 2 mesh vertexes
// associated with the topological vertex. Don't to this for anything but the location.
int i;
for (i = 0; top.m_topv[me_list[mei].topvi0].m_v_count > i; i++)
mesh.SetVertex(top.m_topv[me_list[mei].topvi0].m_vi[i], me_list[mei].newV);
for (i = 0; top.m_topv[me_list[mei].topvi1].m_v_count > i; i++)
mesh.SetVertex(top.m_topv[me_list[mei].topvi1].m_vi[i], me_list[mei].newV);
if ( bHasVertexNormals )
{
mesh.m_N[me_list[mei].vi0] = me_list[mei].newN;
mesh.m_N[me_list[mei].vi1] = me_list[mei].newN;
}
if ( bHasTextureCoordinates )
{
mesh.m_T[me_list[mei].vi0] = me_list[mei].newT;
mesh.m_T[me_list[mei].vi1] = me_list[mei].newT;
}
}
// make a map of old to new
int old2new_map_count = 0;
ON__NEWVI* old2new_map = (ON__NEWVI*)alloca(2*me_list_count*sizeof(old2new_map[0]));
for ( mei = 0; mei < me_list_count; mei++ )
{
old2new_map[old2new_map_count].oldvi = me_list[mei].vi0;
old2new_map[old2new_map_count].newvi = me_list[mei].newvi;
old2new_map_count++;
old2new_map[old2new_map_count].oldvi = me_list[mei].vi1;
old2new_map[old2new_map_count].newvi = me_list[mei].newvi;
old2new_map_count++;
}
// sort old2new_map[] so we can use a fast bsearch() call
// to update faces.
ON_qsort(old2new_map,old2new_map_count,sizeof(old2new_map[0]),(QSORTCMPFUNC)CompareNEWVI);
// count faces that use the vertices that are being changed
int bad_fi_count = 0;
int topv_end, vei, fi, fvi23, fvi;
ON__NEWVI nvi;
for ( topv_end = 0; topv_end < 2; topv_end++ )
{
const ON_MeshTopologyVertex& topv = (topv_end) ? topv1 : topv0;
for ( vei = 0; vei < topv.m_tope_count; vei++ )
{
topei = topv.m_topei[vei];
if ( topei < 0 && topei >= top.m_tope.Count() )
continue;
bad_fi_count += top.m_tope[topei].m_topf_count;
}
}
int* bad_fi = (int*)alloca(bad_fi_count*sizeof(*bad_fi));
bad_fi_count = 0;
// Go through all the faces that use the vertices at the
// ends of the edge and update the vi[] values to use the
// new vertices.
for ( topv_end = 0; topv_end < 2; topv_end++ )
{
const ON_MeshTopologyVertex& topv = (topv_end) ? topv1 : topv0;
for ( vei = 0; vei < topv.m_tope_count; vei++ )
{
topei = topv.m_topei[vei];
if ( topei < 0 && topei >= top.m_tope.Count() )
continue;
const ON_MeshTopologyEdge& e = top.m_tope[topei];
for ( efi = 0; efi < e.m_topf_count; efi++ )
{
fi = e.m_topfi[efi];
if ( fi < 0 || fi >= F_count )
continue;
bool bChangedFace = false;
ON_MeshFace& f = mesh.m_F[fi];
for ( fvi = 0; fvi < 4; fvi++ )
{
nvi.oldvi = f.vi[fvi];
ON__NEWVI* p = (ON__NEWVI*)bsearch(&nvi,old2new_map,old2new_map_count,sizeof(old2new_map[0]),(QSORTCMPFUNC)CompareNEWVI);
if ( 0 != p && p->oldvi != p->newvi)
{
RemoveFaceOrVertexFromNgon(mesh, fi, &p->oldvi);
f.vi[fvi] = p->newvi;
bChangedFace = true;
}
}
if ( bChangedFace )
{
if ( !f.IsValid(V_count) )
{
if ( f.vi[3] == f.vi[0] )
{
f.vi[0] = f.vi[1];
f.vi[1] = f.vi[2];
f.vi[2] = f.vi[3];
}
else if ( f.vi[0] == f.vi[1] )
{
fvi23 = f.vi[0];
f.vi[0] = f.vi[2];
f.vi[1] = f.vi[3];
f.vi[2] = fvi23;
f.vi[3] = fvi23;
}
else if ( f.vi[1] == f.vi[2] )
{
fvi23 = f.vi[1];
f.vi[1] = f.vi[0];
f.vi[0] = f.vi[3];
f.vi[2] = fvi23;
f.vi[3] = fvi23;
}
if ( f.vi[0] == f.vi[1] || f.vi[1] == f.vi[2] || f.vi[2] == f.vi[0] || f.vi[2] != f.vi[3] )
{
bad_fi[bad_fi_count++] = fi;
}
}
if ( bHasFaceNormals )
{
// invalid faces are removed below
ON_3fVector a, b, n;
a = mesh.Vertex(f.vi[2]) - mesh.Vertex(f.vi[0]);
b = mesh.Vertex(f.vi[3]) - mesh.Vertex(f.vi[1]);
n = ON_CrossProduct( a, b );
n.Unitize();
mesh.m_FN[fi] = n;
}
}
}
}
}
if ( bad_fi_count > 0 )
{
// remove collapsed faces from mesh
ON_qsort(bad_fi,bad_fi_count,sizeof(bad_fi[0]),CompareInt);
int bfi = 1;
int dest_fi = bad_fi[0];
unsigned int* face_index_map = nullptr;
ON_SimpleArray<unsigned int> face_index_map_array;
if (mesh.HasNgons())
{
face_index_map_array.Reserve(mesh.m_F.UnsignedCount());
face_index_map = face_index_map_array.Array();
for (fi = 0; fi < dest_fi; fi++)
face_index_map[fi] = fi;
for (fi = dest_fi; fi < mesh.m_F.Count(); fi++)
face_index_map[fi] = ON_UNSET_UINT_INDEX;
}
for ( fi = dest_fi+1; fi < F_count && bfi < bad_fi_count; fi++ )
{
if ( fi == bad_fi[bfi] )
{
bfi++;
if (nullptr != face_index_map)
face_index_map[fi] = ON_UNSET_UINT_INDEX;
}
else
{
// remove collapsed faces from ngons
if (nullptr != face_index_map)
face_index_map[fi] = dest_fi;
mesh.m_F[dest_fi++] = mesh.m_F[fi];
}
}
while (fi<F_count)
{
if (nullptr != face_index_map)
face_index_map[fi] = dest_fi;
mesh.m_F[dest_fi++] = mesh.m_F[fi++];
}
mesh.m_F.SetCount(dest_fi);
const unsigned int new_mesh_F_count = mesh.m_F.UnsignedCount();
bool bUpdateNgonMap = false;
for ( unsigned int ni = 0; ni < mesh.m_Ngon.UnsignedCount(); ni++ )
{
ON_MeshNgon* ngon = m_Ngon[ni];
if (nullptr == ngon)
continue;
unsigned int new_ngon_F_count = 0;
for (unsigned int nfi = 0; nfi < ngon->m_Fcount; nfi++)
{
unsigned int new_fi = face_index_map[ngon->m_fi[nfi]];
if (new_fi >= new_mesh_F_count)
continue;
ngon->m_fi[new_ngon_F_count++] = new_fi;
}
ON_MeshNgon* new_ngon;
if (0 == new_ngon_F_count)
{
new_ngon = nullptr;
}
else if (new_ngon_F_count != ngon->m_Fcount)
{
new_ngon = m_NgonAllocator.AllocateNgon(ngon->m_Vcount, new_ngon_F_count);
// copy old ngon vertex list to new ngon
for (unsigned int nvi_for_loop = 0; nvi_for_loop < new_ngon->m_Vcount; nvi_for_loop++)
new_ngon->m_vi[nvi_for_loop] = ngon->m_vi[nvi_for_loop];
// update new ngon face list
for (unsigned int nfi = 0; nfi < new_ngon->m_Fcount; nfi++)
new_ngon->m_fi[nfi] = ngon->m_fi[nfi];
}
else
{
continue;
}
bUpdateNgonMap = true;
m_Ngon[ni] = new_ngon;
mesh.m_NgonAllocator.DeallocateNgon(ngon);
}
if (bUpdateNgonMap)
{
mesh.m_NgonMap.Destroy();
mesh.CreateNgonMap();
}
if ( bHasFaceNormals )
{
bfi = 1;
dest_fi = bad_fi[0];
for ( fi = dest_fi+1; fi < F_count && bfi < bad_fi_count; fi++ )
{
if ( fi == bad_fi[bfi] )
{
bfi++;
}
else
{
mesh.m_FN[dest_fi++] = mesh.m_FN[fi];
}
}
while (fi<F_count)
{
mesh.m_FN[dest_fi++] = mesh.m_FN[fi++];
}
mesh.m_FN.SetCount(dest_fi);
}
}
mesh.Compact();
mesh.DestroyTopology();
mesh.DestroyPartition();
return true;
}
//static int NewIndex( int old_index, int missing_index_count, const int* missing_index_list )
//{
// // tool to calculate new indices when some elements are deleted from a list
// int delta;
// for ( delta = 0; delta < missing_index_count; delta++ )
// {
// if ( old_index < missing_index_list[delta] )
// break;
// }
// return old_index - delta;
//}
bool ON_Mesh::DeleteFace( int meshfi )
{
// Do NOT add a call Compact() in this function.
// Compact() is slow and this function may be called
// many times in sequence.
// It is the callers responsibility to call Compact()
// when it is needed.
bool rc = false;
if ( meshfi >= 0 && meshfi < m_F.Count() )
{
if ( m_top.m_topf.Count() > 0 )
{
DestroyTopology();
}
DestroyPartition();
DestroyTree();
if ( m_FN.Count() == m_F.Count() )
{
m_FN.Remove(meshfi);
}
m_F.Remove(meshfi);
// 6 Mar 2010 S. Baer
// Invalidate the cached IsClosed flag. This forces the mesh to
// recompute IsClosed the next time it is called
SetClosed(-1);
rc = true;
}
return rc;
}
ON_Mesh* ON_ControlPolygonMesh(
const ON_NurbsSurface& nurbs_surface,
bool bCleanMesh,
ON_Mesh* input_mesh
)
{
int u0 = 0;
int u1 = nurbs_surface.CVCount(0);
int v0 = 0;
int v1 = nurbs_surface.CVCount(1);
if ( 0 == nurbs_surface.m_cv || !nurbs_surface.IsValid() )
{
ON_ERROR("ON_ControlPolygonMesh - surface is not valid");
return nullptr;
}
ON_SimpleArray<double> gu(u1);
ON_SimpleArray<double> gv(v1);
gu.SetCount(u1);
gv.SetCount(v1);
nurbs_surface.GetGrevilleAbcissae(0,gu.Array());
nurbs_surface.GetGrevilleAbcissae(1,gv.Array());
ON_Interval d0 = nurbs_surface.Domain(0);
ON_Interval d1 = nurbs_surface.Domain(1);
bool bPeriodic0 = nurbs_surface.IsPeriodic(0)?true:false;
bool bIsClosed0 = bPeriodic0 ? true : (nurbs_surface.IsClosed(0)?true:false);
bool bPeriodic1 = nurbs_surface.IsPeriodic(1)?true:false;
bool bIsClosed1 = bPeriodic1 ? true : (nurbs_surface.IsClosed(1)?true:false);
if ( bPeriodic0 )
{
u1 -= (nurbs_surface.Degree(0) - 1);
while ( u1 < nurbs_surface.CVCount(0) && gu[u0] < d0[0] && gu[u1-1] <= d0[1] )
{
u0++;
u1++;
}
d0.Set(gu[u0],gu[u1-1]);
}
if ( bPeriodic1 )
{
v1 -= (nurbs_surface.Degree(1) - 1);
while ( v1 < nurbs_surface.CVCount(1) && gv[v0] < d1[0] && gv[v1-1] <= d1[1] )
{
v0++;
v1++;
}
d1.Set(gv[v0],gv[v1-1]);
}
ON_Mesh* mesh = (0 == input_mesh) ? new ON_Mesh() : input_mesh;
int vertex_count = (u1-u0)*(v1-v0);
int face_count = (u1-u0-1)*(v1-v0-1);
ON_3dPointArray& dpv = mesh->DoublePrecisionVertices();
dpv.Reserve(vertex_count);
mesh->m_N.Reserve(vertex_count);
mesh->m_T.Reserve(vertex_count);
mesh->m_S.Reserve(vertex_count);
mesh->m_F.Reserve(face_count);
mesh->m_srf_domain[0] = d0;
mesh->m_srf_domain[1] = d1;
ON_3dPoint V;
ON_3dVector N;
ON_2dPoint S;
ON_2dPoint T;
int hint[2] = {0,0};
int i, j;
int k = -1;
for ( j = v0; j < v1; j++)
{
S.y = gv[j];
T.y = d1.NormalizedParameterAt(S.y);
for ( i = u0; i < u1; i++)
{
nurbs_surface.GetCV( i, j, V);
S.x = gu[i];
T.x = d0.NormalizedParameterAt(S.x);
nurbs_surface.EvNormal(gu[i],gv[j],N,0,hint);
dpv.AppendNew() = V;
mesh->m_N.AppendNew() = N;
mesh->m_S.AppendNew() = S;
mesh->m_T.AppendNew() = T;
if ( i > u0 && j > v0 )
{
ON_MeshFace& f = mesh->m_F.AppendNew();
f.vi[0] = k++;
f.vi[1] = k;
f.vi[2] = dpv.Count()-1;
f.vi[3] = f.vi[2]-1;
}
}
k++;
}
mesh->UpdateSinglePrecisionVertices();
u1 -= u0;
v1 -= v0;
// make sure closed seams are spot on
if ( bIsClosed0 )
{
i = 0;
for ( j = 0; j < v1; j++ )
{
k = i + (u1-1);
mesh->SetVertex(k, mesh->Vertex(i));
if ( bPeriodic0 )
{
mesh->m_N[k] = mesh->m_N[i];
}
i = k+1;
// do NOT synch texture coordinates
}
}
if ( bIsClosed1 )
{
for ( i = 0, k = u1*(v1-1); i < u1; i++, k++ )
{
mesh->SetVertex(k, mesh->Vertex(i));
if ( bPeriodic1 )
{
mesh->m_N[k] = mesh->m_N[i];
}
// do NOT synch texture coordinates
}
}
// make sure singular ends are spot on
i=0;
for ( k = 0; k < 4; k++ )
{
if ( nurbs_surface.IsSingular(k) )
{
switch(k)
{
case 0: // 0 = south
i = 0;
j = 1;
k = u1;
break;
case 1: // 1 = east
i = u1-1;
j = u1;
k = u1*v1;
break;
case 2: // 2 = north
i = u1*(v1-1);
j = 1;