-
Notifications
You must be signed in to change notification settings - Fork 423
/
FEMTree.LevelSet.3D.inl
2356 lines (2159 loc) · 116 KB
/
FEMTree.LevelSet.3D.inl
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) 2022, Michael Kazhdan
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of
conditions and the following disclaimer. Redistributions in binary form must reproduce
the above copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the distribution.
Neither the name of the Johns Hopkins University nor the names of its contributors
may be used to endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
*/
#include <sstream>
#include <sstream>
#include <iomanip>
#include <unordered_map>
#include "MyMiscellany.h"
#include "MarchingCubes.h"
#include "MAT.h"
#include "FEMTree.LevelSet.inl"
#include "FEMTree.LevelSet.2D.inl"
#include "Reconstructors.h"
// Specialized level-set surface extraction
template< bool HasData , typename Real , typename Data >
struct _LevelSetExtractor< HasData , Real , 3 , Data >
{
static const unsigned int Dim = 3;
// Store the position, the (interpolated) gradient, the weight, and possibly data
typedef typename std::conditional
<
HasData ,
VectorTypeUnion< Real , Point< Real , Dim > , Point< Real , Dim > , Real , Data > ,
VectorTypeUnion< Real , Point< Real , Dim > , Point< Real , Dim > , Real >
>::type Vertex;
protected:
static std::mutex _pointInsertionMutex;
static std::atomic< size_t > _BadRootCount;
public:
typedef typename FEMTree< Dim , Real >::LocalDepth LocalDepth;
typedef typename FEMTree< Dim , Real >::LocalOffset LocalOffset;
typedef typename FEMTree< Dim , Real >::ConstOneRingNeighborKey ConstOneRingNeighborKey;
typedef typename FEMTree< Dim , Real >::ConstOneRingNeighbors ConstOneRingNeighbors;
typedef RegularTreeNode< Dim , FEMTreeNodeData , depth_and_offset_type > TreeNode;
template< unsigned int WeightDegree > using DensityEstimator = typename FEMTree< Dim , Real >::template DensityEstimator< WeightDegree >;
template< typename FEMSigPack , unsigned int PointD > using _Evaluator = typename FEMTree< Dim , Real >::template _Evaluator< FEMSigPack , PointD >;
using Key = LevelSetExtraction::Key< Dim >;
using IsoEdge = LevelSetExtraction::IsoEdge< Dim >;
template< unsigned int D , unsigned int ... Ks >
using HyperCubeTables = LevelSetExtraction::HyperCubeTables< D , Ks ... >;
////////////////
// FaceEdges //
////////////////
struct FaceEdges
{
IsoEdge edges[2];
int count;
FaceEdges( void ) : count(-1){}
};
///////////////
// SliceData //
///////////////
class SliceData
{
public:
template< unsigned int Indices >
struct _Indices
{
node_index_type idx[Indices];
_Indices( void ){ for( unsigned int i=0 ; i<Indices ; i++ ) idx[i] = -1; }
node_index_type& operator[] ( int i ) { return idx[i]; }
const node_index_type& operator[] ( int i ) const { return idx[i]; }
};
// The four corner indices associated with a square face
using SquareCornerIndices = _Indices< HyperCube::Cube< Dim-1 >::template ElementNum< 0 >() >;
// The four edge indices associated with a square face
using SquareEdgeIndices = _Indices< HyperCube::Cube< Dim-1 >::template ElementNum< 1 >() >;
// The one face index associated with a square face
using SquareFaceIndices = _Indices< HyperCube::Cube< Dim-1 >::template ElementNum< 2 >() >;
};
/////////////////
// SliceValues //
/////////////////
struct SliceValues
{
struct Scratch
{
using FKeyValues = std::vector< std::vector< std::pair< Key , std::vector< IsoEdge > > > >;
using EKeyValues = std::vector< std::vector< std::pair< Key , std::pair< node_index_type , Vertex > > > >;
using VKeyValues = std::vector< std::vector< std::pair< Key , Key > > >;
FKeyValues fKeyValues;
EKeyValues eKeyValues;
VKeyValues vKeyValues;
Pointer( char ) cSet;
Pointer( char ) eSet;
Pointer( char ) fSet;
Scratch( void )
{
vKeyValues.resize( ThreadPool::NumThreads() );
eKeyValues.resize( ThreadPool::NumThreads() );
fKeyValues.resize( ThreadPool::NumThreads() );
cSet = NullPointer( char );
eSet = NullPointer( char );
fSet = NullPointer( char );
}
~Scratch( void )
{
FreePointer( cSet );
FreePointer( eSet );
FreePointer( fSet );
}
void reset( const LevelSetExtraction::SliceCellIndexData< Dim > &cellIndices )
{
for( size_t i=0 ; i<vKeyValues.size() ; i++ ) vKeyValues[i].clear();
for( size_t i=0 ; i<eKeyValues.size() ; i++ ) eKeyValues[i].clear();
for( size_t i=0 ; i<fKeyValues.size() ; i++ ) fKeyValues[i].clear();
FreePointer( cSet );
FreePointer( eSet );
FreePointer( fSet );
if( cellIndices.counts[0] )
{
cSet = AllocPointer< char >( cellIndices.counts[0] );
memset( cSet , 0 , sizeof( char ) * cellIndices.counts[0] );
}
if( cellIndices.counts[1] )
{
eSet = AllocPointer< char >( cellIndices.counts[1] );
memset( eSet , 0 , sizeof( char ) * cellIndices.counts[1] );
}
if( cellIndices.counts[2] )
{
fSet = AllocPointer< char >( cellIndices.counts[2] );
memset( fSet , 0 , sizeof( char ) * cellIndices.counts[2] );
}
}
};
LevelSetExtraction::SliceCellIndexData< Dim > cellIndices;
Pointer( Real ) cornerValues ; Pointer( Point< Real , Dim > ) cornerGradients;
Pointer( Key ) edgeKeys;
Pointer( FaceEdges ) faceEdges;
Pointer( char ) mcIndices;
LevelSetExtraction::KeyMap< Dim , std::vector< IsoEdge > > faceEdgeMap;
LevelSetExtraction::KeyMap< Dim , std::pair< node_index_type , Vertex > > edgeVertexMap;
LevelSetExtraction::KeyMap< Dim , Key > vertexPairMap;
SliceValues( void )
{
_slice = -1;
_oldCCount = _oldECount = _oldFCount = 0;
_oldNCount = 0;
cornerValues = NullPointer( Real ) ; cornerGradients = NullPointer( Point< Real , Dim > );
edgeKeys = NullPointer( Key );
faceEdges = NullPointer( FaceEdges );
mcIndices = NullPointer( char );
}
~SliceValues( void )
{
_oldCCount = _oldECount = _oldFCount = 0;
_oldNCount = 0;
FreePointer( cornerValues ) ; FreePointer( cornerGradients );
DeletePointer( edgeKeys );
DeletePointer( faceEdges );
FreePointer( mcIndices );
}
void setFromScratch( typename Scratch::VKeyValues &scratch )
{
for( unsigned int t=0 ; t<scratch.size() ; t++ )
{
for( int i=0 ; i<scratch[t].size() ; i++ )
{
vertexPairMap[ scratch[t][i].first ] = scratch[t][i].second;
vertexPairMap[ scratch[t][i].second ] = scratch[t][i].first;
}
scratch[t].clear();
}
}
void setFromScratch( typename Scratch::EKeyValues &scratch )
{
for( unsigned int t=0 ; t<scratch.size() ; t++ )
{
for( int i=0 ; i<scratch[t].size() ; i++ ) edgeVertexMap[ scratch[t][i].first ] = scratch[t][i].second;
scratch[t].clear();
}
}
void setFromScratch( typename Scratch::FKeyValues &scratch )
{
for( unsigned int t=0 ; t<scratch.size() ; t++ )
{
for( int i=0 ; i<scratch[t].size() ; i++ )
{
std::vector< IsoEdge > &faceEdges = faceEdgeMap[ scratch[t][i].first ];
faceEdges.insert( faceEdges.end() , scratch[t][i].second.begin() , scratch[t][i].second.end() );
}
scratch[t].clear();
}
}
unsigned int slice( void ) const { return _slice; }
void reset( unsigned int slice , bool computeGradients )
{
_slice = slice;
faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
if( _oldNCount<(node_index_type)cellIndices.size() )
{
_oldNCount = (node_index_type)cellIndices.size();
FreePointer( mcIndices );
if( _oldNCount>0 ) mcIndices = AllocPointer< char >( _oldNCount );
}
if( _oldCCount<(node_index_type)cellIndices.counts[0] )
{
_oldCCount = (node_index_type)cellIndices.counts[0];
FreePointer( cornerValues ) ; FreePointer( cornerGradients );
if( cellIndices.counts[0]>0 )
{
cornerValues = AllocPointer< Real >( _oldCCount );
if( computeGradients ) cornerGradients = AllocPointer< Point< Real , Dim > >( _oldCCount );
}
}
if( _oldECount<(node_index_type)cellIndices.counts[1] )
{
_oldECount = (node_index_type)cellIndices.counts[1];
DeletePointer( edgeKeys );
edgeKeys = NewPointer< Key >( _oldECount );
}
if( _oldFCount<(node_index_type)cellIndices.counts[2] )
{
_oldFCount = (node_index_type)cellIndices.counts[2];
DeletePointer( faceEdges );
faceEdges = NewPointer< FaceEdges >( _oldFCount );
}
}
template< typename FaceIndexFunctor /* = std::function< LevelSetExtraction::Key< Dim > ( const TreeNode * , typename HyperCube::Cube< Dim >::template Element< 2 > ) */ >
void addIsoEdges( const LevelSetExtraction::KeyGenerator< Dim > &keyGenerator , FaceIndexFunctor &faceIndexFunctor , const FEMTree< Dim , Real > &tree , const Scratch &scratch , const TreeNode *leaf , unsigned int sliceIndex , std::vector< IsoEdge > &edges , bool isOriented ) const
{
auto _FaceIndex = [&]( const TreeNode *node )
{
int depth , offset[Dim];
tree.depthAndOffset( node , depth , offset );
typename HyperCube::Cube< Dim >::template Element< 2 > f;
if ( offset[Dim-1]+0==sliceIndex ) f = typename HyperCube::Cube< Dim >::template Element< 2 >( HyperCube::BACK , 0 );
else if( offset[Dim-1]+1==sliceIndex ) f = typename HyperCube::Cube< Dim >::template Element< 2 >( HyperCube::FRONT , 0 );
else ERROR_OUT( "Node/slice-index mismatch: " , offset[Dim-1] , " <-> " , sliceIndex );
return faceIndexFunctor( node , f );
};
int flip = isOriented ? 0 : 1;
node_index_type fIdx = cellIndices.template indices<2>(leaf->nodeData.nodeIndex)[0];
if( scratch.fSet[fIdx] )
{
const FaceEdges &fe = faceEdges[ fIdx ];
for( int i=0 ; i<fe.count ; i++ ) edges.push_back( IsoEdge( fe.edges[i][flip] , fe.edges[i][1-flip] ) );
}
else
{
Key key = _FaceIndex( leaf );
typename LevelSetExtraction::KeyMap< Dim , std::vector< IsoEdge > >::const_iterator iter = faceEdgeMap.find( key );
if( iter!=faceEdgeMap.end() )
{
const std::vector< IsoEdge >& _edges = iter->second;
for( size_t i=0 ; i<_edges.size() ; i++ ) edges.push_back( IsoEdge( _edges[i][flip] , _edges[i][1-flip] ) );
}
else
{
LocalDepth d ; LocalOffset off;
tree.depthAndOffset( leaf , d , off );
// [WARNING] Is this right? If the face isn't set, wouldn't it inherit?
WARN( "Invalid face: [" , off[0] , " " , off[1] , " " , off[2] , " @ " , d , " | " , sliceIndex , " : " , leaf->nodeData.nodeIndex , " ( " , keyGenerator.to_string(key) , " | " , key.to_string() , " )" );
}
}
}
bool setVertexPair( Key current , Key &pair ) const
{
typename LevelSetExtraction::KeyMap< Dim , Key >::const_iterator iter;
if( (iter=vertexPairMap.find(current))!=vertexPairMap.end() )
{
pair = iter->second;
return true;
}
else return false;
}
bool setEdgeVertex( Key key , std::pair< node_index_type , Vertex > &edgeVertex ) const
{
typename LevelSetExtraction::KeyMap< Dim , std::pair< node_index_type , Vertex > >::const_iterator iter;
if( ( iter=edgeVertexMap.find( key ) )!=edgeVertexMap.end() )
{
edgeVertex = iter->second;
return true;
}
else return false;
}
protected:
node_index_type _oldCCount , _oldECount , _oldFCount;
node_index_type _oldNCount;
unsigned int _slice;
};
//////////////////
// XSliceValues //
//////////////////
struct XSliceValues
{
struct Scratch
{
using FKeyValues = std::vector< std::vector< std::pair< Key , std::vector< IsoEdge > > > >;
using EKeyValues = std::vector< std::vector< std::pair< Key , std::pair< node_index_type , Vertex > > > >;
using VKeyValues = std::vector< std::vector< std::pair< Key , Key > > >;
FKeyValues fKeyValues;
EKeyValues eKeyValues;
VKeyValues vKeyValues;
Pointer( char ) eSet;
Pointer( char ) fSet;
Scratch( void )
{
vKeyValues.resize( ThreadPool::NumThreads() );
eKeyValues.resize( ThreadPool::NumThreads() );
fKeyValues.resize( ThreadPool::NumThreads() );
eSet = NullPointer( char );
fSet = NullPointer( char );
}
~Scratch( void )
{
FreePointer( eSet );
FreePointer( fSet );
}
void reset( const LevelSetExtraction::SlabCellIndexData< Dim > &cellIndices )
{
for( size_t i=0 ; i<vKeyValues.size() ; i++ ) vKeyValues[i].clear();
for( size_t i=0 ; i<eKeyValues.size() ; i++ ) eKeyValues[i].clear();
for( size_t i=0 ; i<fKeyValues.size() ; i++ ) fKeyValues[i].clear();
FreePointer( eSet );
FreePointer( fSet );
if( cellIndices.counts[0] )
{
eSet = AllocPointer< char >( cellIndices.counts[0] );
memset( eSet , 0 , sizeof( char ) * cellIndices.counts[0] );
}
if( cellIndices.counts[1] )
{
fSet = AllocPointer< char >( cellIndices.counts[1] );
memset( fSet , 0 , sizeof( char ) * cellIndices.counts[1] );
}
}
};
LevelSetExtraction::SlabCellIndexData< Dim > cellIndices;
Pointer( Key ) edgeKeys;
Pointer( FaceEdges ) faceEdges;
LevelSetExtraction::KeyMap< Dim , std::vector< IsoEdge > > faceEdgeMap;
LevelSetExtraction::KeyMap< Dim , std::pair< node_index_type , Vertex > > edgeVertexMap;
LevelSetExtraction::KeyMap< Dim , Key > vertexPairMap;
XSliceValues( void )
{
_slab = -1;
_oldECount = _oldFCount = 0;
edgeKeys = NullPointer( Key );
faceEdges = NullPointer( FaceEdges );
}
~XSliceValues( void )
{
_oldECount = _oldFCount = 0;
DeletePointer( edgeKeys );
DeletePointer( faceEdges );
}
void setFromScratch( typename Scratch::VKeyValues &scratch )
{
for( unsigned int t=0 ; t<scratch.size() ; t++ )
{
for( int i=0 ; i<scratch[t].size() ; i++ )
{
vertexPairMap[ scratch[t][i].first ] = scratch[t][i].second;
vertexPairMap[ scratch[t][i].second ] = scratch[t][i].first;
}
scratch[t].clear();
}
}
void setFromScratch( typename Scratch::EKeyValues &scratch )
{
for( unsigned int t=0 ; t<scratch.size() ; t++ )
{
for( int i=0 ; i<scratch[t].size() ; i++ ) edgeVertexMap[ scratch[t][i].first ] = scratch[t][i].second;
scratch[t].clear();
}
}
void setFromScratch( typename Scratch::FKeyValues &scratch )
{
for( unsigned int t=0 ; t<scratch.size() ; t++ )
{
for( int i=0 ; i<scratch[t].size() ; i++ )
{
auto iter = faceEdgeMap.find( scratch[t][i].first );
if( iter==faceEdgeMap.end() ) faceEdgeMap[ scratch[t][i].first ] = scratch[t][i].second;
else for( int j=0 ; j<scratch[t][i].second.size() ; j++ ) iter->second.push_back( scratch[t][i].second[j] );
}
scratch[t].clear();
}
}
unsigned int slab( void ) const { return _slab; }
void reset( unsigned int slab )
{
_slab = slab;
faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
if( _oldECount<(node_index_type)cellIndices.counts[0] )
{
_oldECount = (node_index_type)cellIndices.counts[0];
DeletePointer( edgeKeys );
edgeKeys = NewPointer< Key >( _oldECount );
}
if( _oldFCount<(node_index_type)cellIndices.counts[1] )
{
_oldFCount = (node_index_type)cellIndices.counts[1];
DeletePointer( faceEdges );
faceEdges = NewPointer< FaceEdges >( _oldFCount );
}
}
protected:
node_index_type _oldECount , _oldFCount;
unsigned int _slab;
};
////////////////
// SlabValues //
////////////////
struct SlabValues
{
protected:
XSliceValues _xSliceValues[2];
SliceValues _sliceValues[2];
typename SliceValues::Scratch _sliceScratch[2];
typename XSliceValues::Scratch _xSliceScratch[2];
public:
SliceValues& sliceValues( int idx ){ return _sliceValues[idx&1]; }
const SliceValues& sliceValues( int idx ) const { return _sliceValues[idx&1]; }
XSliceValues& xSliceValues( int idx ){ return _xSliceValues[idx&1]; }
const XSliceValues& xSliceValues( int idx ) const { return _xSliceValues[idx&1]; }
typename SliceValues::Scratch &sliceScratch ( int idx ) { return _sliceScratch[idx&1]; }
const typename SliceValues::Scratch &sliceScratch ( int idx ) const { return _sliceScratch[idx&1]; }
typename XSliceValues::Scratch &xSliceScratch( int idx ) { return _xSliceScratch[idx&1]; }
const typename XSliceValues::Scratch &xSliceScratch( int idx ) const { return _xSliceScratch[idx&1]; }
bool validSlice( int slice ) const { return _sliceValues[slice&1].slice()==slice; }
bool validXSlice( int slab ) const { return _xSliceValues[slab&1].slab()==slab; }
};
static std::vector< std::pair< node_index_type , node_index_type > > SetIncidence( const FEMTree< Dim , Real > &tree , const FEMTree< Dim-1 , Real > &sliceTree , LocalDepth fullDepth , unsigned int sliceAtMaxDepth , unsigned int maxDepth )
{
using SliceTreeNode = typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::TreeNode;
using SliceLocalDepth = typename FEMTree< Dim-1 , Real >::LocalDepth;
using SliceLocalOffset = typename FEMTree< Dim-1 , Real >::LocalOffset;
std::vector< std::pair< node_index_type , node_index_type > > incidence( sliceTree.nodesSize() , std::pair< node_index_type , node_index_type >( -1 , -1 ) );
// Recursively set the incidence
std::function< void ( const TreeNode * , const SliceTreeNode * ) > SetIncidenceFunctor = [&]( const TreeNode *node , const SliceTreeNode *sliceNode )
{
LocalDepth depth ; LocalOffset offset;
SliceLocalDepth sliceDepth ; SliceLocalOffset sliceOffset;
tree.depthAndOffset( node , depth , offset );
sliceTree.depthAndOffset( sliceNode , sliceDepth , sliceOffset );
if( depth!=sliceDepth ) ERROR_OUT( "Depths do not match: " , depth , " != " , sliceDepth );
for( unsigned int i=0 ; i<Dim-1 ; i++ ) if( offset[i]!=sliceOffset[i] ) ERROR_OUT( "Offsets do not match[ " , i , "]: " , offset[i] , " != " , sliceOffset[i] );
unsigned int beginAtMaxDepth = ( offset[Dim-1] + 0 )<<( maxDepth - depth );
unsigned int endAtMaxDepth = ( offset[Dim-1] + 1 )<<( maxDepth - depth );
unsigned int midAtMaxDepth = ( beginAtMaxDepth + endAtMaxDepth ) / 2;
if( node->nodeData.nodeIndex==-1 ) return;
else if( sliceNode->nodeData.nodeIndex==-1 ) ERROR_OUT( "Expected valid slice node" );
if( sliceAtMaxDepth<beginAtMaxDepth || sliceAtMaxDepth>endAtMaxDepth ) ERROR_OUT( "Bad slice: " , sliceAtMaxDepth , " in [ " , beginAtMaxDepth , " , " , endAtMaxDepth , " ]" );
if( depth>=fullDepth )
{
// Set the incidence
if ( sliceAtMaxDepth==beginAtMaxDepth ) incidence[ sliceNode->nodeData.nodeIndex ].second = node->nodeData.nodeIndex;
else if( sliceAtMaxDepth==endAtMaxDepth ) incidence[ sliceNode->nodeData.nodeIndex ].first = node->nodeData.nodeIndex;
else
{
incidence[ sliceNode->nodeData.nodeIndex ].second = node->nodeData.nodeIndex;
incidence[ sliceNode->nodeData.nodeIndex ].first = node->nodeData.nodeIndex;
}
}
if( !GetGhostFlag( node->children ) )
{
if( !sliceNode->children )
{
int d , off[Dim] , _d , _off[Dim-1];
Point< int , Dim > p;
Point< int , Dim-1 > _p;
for( unsigned int d=0 ; d<Dim ; d++ ) p[d] = off[d];
for( unsigned int d=0 ; d<Dim-1 ; d++ ) _p[d] = _off[d];
tree.depthAndOffset( node , d , off );
sliceTree.depthAndOffset( sliceNode , _d , _off );
ERROR_OUT( "Expected slice children: " , p , " @ " , d , " <-> " , _p , " @ " , _d , " : ", node->nodeData.nodeIndex , " <-> " , sliceNode->nodeData.nodeIndex );
}
if( sliceAtMaxDepth<=midAtMaxDepth ) for( int c=0 ; c<(1<<(Dim-1)) ; c++ ) SetIncidenceFunctor( node->children+(c ) , sliceNode->children + c );
if( sliceAtMaxDepth>=midAtMaxDepth ) for( int c=0 ; c<(1<<(Dim-1)) ; c++ ) SetIncidenceFunctor( node->children+(c|(1<<(Dim-1))) , sliceNode->children + c );
}
};
SetIncidenceFunctor( &tree.spaceRoot() , &sliceTree.spaceRoot() );
return incidence;
}
template< unsigned int WeightDegree , unsigned int DataSig , typename SliceFunctor /* = std::function< SliceValues & ( unsigned int ) > */ , typename ScratchFunctor /* = std::function< typename SliceValues::Scratch & ( unsigned int ) */ >
static void CopyIsoStructure
(
const LevelSetExtraction::KeyGenerator< Dim > &keyGenerator ,
const typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::TreeSliceValuesAndVertexPositions &boundaryInfo ,
const FEMTree< Dim , Real > &tree ,
LocalDepth fullDepth ,
unsigned int sliceAtMaxDepth ,
unsigned int maxDepth ,
SliceFunctor sliceFunctor ,
ScratchFunctor scratchFunctor ,
const std::vector< std::pair< node_index_type , node_index_type > > &incidence ,
OutputDataStream< Vertex > &vertexStream ,
bool gradientNormals ,
typename FEMIntegrator::template PointEvaluator< IsotropicUIntPack< Dim , DataSig > , ZeroUIntPack< Dim > > *pointEvaluator ,
const DensityEstimator< WeightDegree >* densityWeights ,
const SparseNodeData< ProjectiveData< Data , Real > , IsotropicUIntPack< Dim , DataSig > >* data ,
node_index_type& vOffset ,
const Data &zeroData
)
{
using SliceTreeNode = typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::TreeNode;
using SliceSliceValues = typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::SliceValues;
using SliceKey = LevelSetExtraction::Key< Dim-1 >;
using SliceIsoEdge = LevelSetExtraction::IsoEdge< Dim-1 >;
auto PromoteIsoVertex = [&]( SliceKey key )
{
return keyGenerator( maxDepth , sliceAtMaxDepth , key );
};
auto PromoteIsoEdge = [&]( SliceIsoEdge edge )
{
IsoEdge pEdge;
for( unsigned int i=0 ; i<2 ; i++ ) pEdge[i] = keyGenerator( maxDepth , sliceAtMaxDepth , edge[i] );
return pEdge;
};
std::vector< node_index_type > vertexIndices( boundaryInfo.vertexPositions.size() );
std::vector< Vertex > vertices( boundaryInfo.vertexPositions.size() );
// Add the iso-vertices
{
static const unsigned int DataDegree = FEMSignature< DataSig >::Degree;
// A functor returning the finest leaf node containing the iso-vertex
std::function< const TreeNode * ( const TreeNode * , Key ) > FinestLeaf = [&]( const TreeNode *node , Key key )
{
const TreeNode *candidate = node;
if( node->children )
{
LocalDepth depth ; LocalOffset offset;
int start[Dim] , mid[Dim] , end[Dim];
tree.depthAndOffset( node , depth , offset );
for( unsigned int d=0 ; d<Dim ; d++ )
{
start[d] = (offset[d]+0)<<(maxDepth+2-depth);
end [d] = (offset[d]+1)<<(maxDepth+2-depth);
mid [d] = (start[d]+end[d])>>1;
}
for( unsigned int c=0 ; c<(1<<Dim) ; c++ )
{
bool containsKey = true;
for( unsigned int d=0 ; d<Dim ; d++ )
if( c&(1<<d) ) containsKey &= ((int)key[d]>=mid [d] && (int)key[d]<=end[d]);
else containsKey &= ((int)key[d]>=start[d] && (int)key[d]<=mid[d]);
if( containsKey )
{
const TreeNode *_candidate = FinestLeaf( node->children+c , key );
if( tree.depth(_candidate)>tree.depth(candidate) ) candidate = _candidate;
}
}
}
return candidate;
};
std::vector< Key > keys;
{
std::vector< LevelSetExtraction::Key< Dim-1 > > _keys = boundaryInfo.vertexKeys();
keys.resize( _keys.size() );
for( unsigned int i=0 ; i<_keys.size() ; i++ ) keys[i] = PromoteIsoVertex( _keys[i] );
}
for( unsigned int i=0 ; i<boundaryInfo.vertexPositions.size(); i++ )
{
ConstPointSupportKey< IsotropicUIntPack< Dim , WeightDegree > > weightKey;
ConstPointSupportKey< IsotropicUIntPack< Dim , DataDegree > > dataKey;
vertexIndices[i] = vOffset++;
Point< Real , Dim > p;
for( unsigned int d=0 ; d<Dim-1 ; d++ ) p[d] = boundaryInfo.vertexPositions[i][d];
p[Dim-1] = (Real)sliceAtMaxDepth/(Real)(1<<maxDepth);
#ifdef SHOW_WARNINGS
#pragma message( "[WARNING] Not setting normal gradients" )
#endif // SHOW_WARNINGS
Real depth = (Real)1.;
Data dataValue;
const TreeNode *node = NULL;
if( densityWeights || data ) node = FinestLeaf( &tree.spaceRoot() , keys[i] );
if( densityWeights )
{
weightKey.set( node->depth() );
weightKey.getNeighbors( node );
Real weight;
tree._getSampleDepthAndWeight( *densityWeights , node , p , weightKey , depth , weight );
}
if constexpr( HasData ) if( data )
{
dataKey.set( node->depth() );
dataKey.getNeighbors( node );
Point< Real , Dim > start;
Real width;
tree.startAndWidth( node , start , width );
if( DataDegree==0 )
{
Point< Real , Dim > center( start[0] + width/2 , start[1] + width/2 , start[2] + width/2 );
ProjectiveData< Data , Real > pValue( zeroData );
tree.template _addEvaluation< ProjectiveData< Data , Real > , SparseNodeData< ProjectiveData< Data , Real > , IsotropicUIntPack< Dim , DataSig > > , 0 >( *data , center , *pointEvaluator , dataKey , pValue );
dataValue = pValue.weight ? pValue.value() : zeroData;
}
else
{
ProjectiveData< Data , Real > pValue( zeroData );
tree.template _addEvaluation< ProjectiveData< Data , Real > , SparseNodeData< ProjectiveData< Data , Real > , IsotropicUIntPack< Dim , DataSig > > , 0 >( *data , p , *pointEvaluator , dataKey , pValue );
dataValue = pValue.weight ? pValue.value() : zeroData;
}
}
vertices[i].template get<0>() = p;
vertices[i].template get<1>() = Point< Real , Dim >();
vertices[i].template get<2>() = depth;
if constexpr( HasData ) vertices[i].template get<3>() = dataValue;
vertexStream.write( vertices[i] );
}
}
// Copy over the edge/face -> key tables
for( unsigned int depth=fullDepth ; depth<=std::min< unsigned int >( tree._maxDepth , boundaryInfo.sliceTree.depth() ) ; depth++ )
{
SliceValues &sValues = sliceFunctor( depth );
typename SliceValues::Scratch &sScratch = scratchFunctor( depth );
const SliceSliceValues &ssValues = boundaryInfo.sliceValues[depth];
auto CopyEdgeAndFaceInfo = [&]( node_index_type sliceIndex , node_index_type index )
{
if( index==-1 ) return;
const TreeNode *node = tree._sNodes.treeNodes[ index ];
const SliceTreeNode *sliceNode = boundaryInfo.sliceTree._sNodes.treeNodes[ sliceIndex ];
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices<1> &eIndices = sValues.cellIndices.template indices<1>( node );
const typename LevelSetExtraction::FullCellIndexData< Dim-1 >::template CellIndices<1> &sliceEIndices = ssValues.cellIndices.template indices< 1 >( sliceNode );
for( typename HyperCube::Cube< Dim-1 >::template Element< 1 > _e ; _e<HyperCube::Cube< Dim-1 >::template ElementNum< 1 >() ; _e++ )
{
node_index_type eIndex = eIndices[_e.index];
node_index_type sliceEIndex = sliceEIndices[_e.index];
if( ssValues.edgeKeys[sliceEIndex].idx[0]!=-1 )
{
sValues.edgeKeys[eIndex] = keyGenerator( maxDepth , sliceAtMaxDepth , ssValues.edgeKeys[sliceEIndex] );
sScratch.eSet[eIndex] = 1;
}
else sScratch.eSet[eIndex] = 0;
}
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices<2> &fIndices = sValues.cellIndices.template indices<2>( node );
const typename LevelSetExtraction::FullCellIndexData< Dim-1 >::template CellIndices< 2 > &sliceFIndices = ssValues.cellIndices.template indices<2>( sliceNode );
for( typename HyperCube::Cube< Dim-1 >::template Element< 2 > _f ; _f<HyperCube::Cube< Dim-1 >::template ElementNum< 2 >() ; _f++ )
{
node_index_type fIndex = fIndices[_f.index];
node_index_type sliceFIndex = sliceFIndices[_f.index];
sValues.faceEdges[fIndex].count = ssValues.faceEdges[sliceFIndex].count;
for( int c=0 ; c<ssValues.faceEdges[sliceFIndex].count ; c++ ) sValues.faceEdges[fIndex].edges[c] = PromoteIsoEdge( ssValues.faceEdges[sliceFIndex].edges[c] );
sScratch.fSet[fIndex] = sValues.faceEdges[fIndex].count!=-1;
}
};
for( node_index_type i=boundaryInfo.sliceTree.nodesBegin(depth) ; i<boundaryInfo.sliceTree.nodesEnd(depth) ; i++ ) CopyEdgeAndFaceInfo( i , incidence[i].first ) , CopyEdgeAndFaceInfo( i , incidence[i].second );
}
// Copy over the iso-information
for( unsigned int depth=fullDepth ; depth<=std::min< unsigned int >( tree._maxDepth , boundaryInfo.sliceTree.depth() ) ; depth++ )
{
SliceValues &sValues = sliceFunctor( depth );
const SliceSliceValues &ssValues = boundaryInfo.sliceValues[depth];
// Copy the face->edge map
for( auto iter=ssValues.faceEdgeMap.cbegin() ; iter!=ssValues.faceEdgeMap.cend() ; iter++ )
{
Key key = keyGenerator( maxDepth , sliceAtMaxDepth , iter->first );
std::vector< IsoEdge > edges( iter->second.size() );
for( unsigned int i=0 ; i<iter->second.size() ; i++ ) edges[i] = PromoteIsoEdge( iter->second[i] );
sValues.faceEdgeMap[key] = edges;
}
// Copy the edge-vertex map
for( auto iter=ssValues.edgeVertexMap.cbegin() ; iter!=ssValues.edgeVertexMap.cend() ; iter++ )
{
Key key = keyGenerator( maxDepth , sliceAtMaxDepth , iter->first );
node_index_type idx = iter->second;
sValues.edgeVertexMap[key] = std::pair< node_index_type , Vertex >( vertexIndices[idx] , vertices[idx] );
}
// Copy the vertex-vertex map
for( auto iter=ssValues.vertexPairMap.cbegin() ; iter!=ssValues.vertexPairMap.cend() ; iter++ )
{
Key key = keyGenerator( maxDepth , sliceAtMaxDepth , iter->first );
sValues.vertexPairMap[key] = keyGenerator( maxDepth , sliceAtMaxDepth , iter->second );
}
}
}
static void OverwriteCornerValues( const typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::TreeSliceValuesAndVertexPositions &boundaryInfo , const std::vector< Real > &dValues , const FEMTree< Dim , Real > &tree , LocalDepth depth , unsigned int sliceAtMaxDepth , unsigned int maxDepth , bool isBack , std::vector< SlabValues > &slabValues , const std::vector< std::pair< node_index_type , node_index_type > > &incidence )
{
using SliceTreeNode = typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::TreeNode;
using SliceSliceValues = typename LevelSetExtractor< Real , Dim-1 , Point< Real , Dim-1 > >::SliceValues;
unsigned int slice = sliceAtMaxDepth>>( maxDepth - depth );
if( !isBack && sliceAtMaxDepth!=( slice<<(maxDepth-depth ) ) ) slice++;
if( !slabValues[depth].validSlice( slice ) ) ERROR_OUT( "Invalid slice: " , slice , " @ " , depth , " : " , slabValues[depth].sliceValues(slice).slice() );
SliceValues &sValues = slabValues[depth].sliceValues( slice );
const SliceSliceValues &ssValues = boundaryInfo.sliceValues[depth];
if( sValues.cornerGradients && !ssValues.cornerGradients ) ERROR_OUT( "Epxected slice gradients" );
auto CopyCornerInfo = [&]( node_index_type sliceIndex , node_index_type index )
{
if( index==-1 ) return;
const TreeNode *node = tree._sNodes.treeNodes[ index ];
const SliceTreeNode *sliceNode = boundaryInfo.sliceTree._sNodes.treeNodes[ sliceIndex ];
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices< 0 > &cIndices = sValues.cellIndices.template indices<0>( node );
const typename LevelSetExtraction::FullCellIndexData< Dim-1 >::template CellIndices< 0 > &sliceCIndices = ssValues.cellIndices.template indices< 0 >( sliceNode );
for( typename HyperCube::Cube< Dim-1 >::template Element< 0 > _c ; _c<HyperCube::Cube< Dim-1 >::template ElementNum< 0 >() ; _c++ )
{
node_index_type vIndex = cIndices[_c.index];
node_index_type sliceVIndex = sliceCIndices[_c.index];
sValues.cornerValues[vIndex] = ssValues.cornerValues[sliceVIndex];
if( sValues.cornerGradients )
{
for( unsigned int i=0 ; i<Dim-1 ; i++ ) sValues.cornerGradients[vIndex][i] = ssValues.cornerGradients[sliceVIndex][i];
sValues.cornerGradients[vIndex][Dim-1] = dValues[sliceVIndex];
}
}
};
for( node_index_type i=boundaryInfo.sliceTree.nodesBegin(depth) ; i<boundaryInfo.sliceTree.nodesEnd(depth) ; i++ ) CopyCornerInfo( i , incidence[i].first ) , CopyCornerInfo( i , incidence[i].second );
}
template< unsigned int ... FEMSigs >
static void SetSliceCornerValuesAndMCIndices( const FEMTree< Dim , Real >& tree , ConstPointer( Real ) coefficients , ConstPointer( Real ) coarseCoefficients , Real isoValue , LocalDepth depth , LocalDepth fullDepth , int slice , std::vector< SlabValues >& slabValues , const _Evaluator< UIntPack< FEMSigs ... > , 1 >& evaluator )
{
if( slice>0 ) SetSliceCornerValuesAndMCIndices< FEMSigs ... >( tree , coefficients , coarseCoefficients , isoValue , depth , fullDepth , slice , HyperCube::FRONT , slabValues , evaluator );
if( slice<(1<<depth) ) SetSliceCornerValuesAndMCIndices< FEMSigs ... >( tree , coefficients , coarseCoefficients , isoValue , depth , fullDepth , slice , HyperCube::BACK , slabValues , evaluator );
}
template< unsigned int ... FEMSigs >
static void SetSliceCornerValuesAndMCIndices( const FEMTree< Dim , Real >& tree , ConstPointer( Real ) coefficients , ConstPointer( Real ) coarseCoefficients , Real isoValue , LocalDepth depth , LocalDepth fullDepth , int slice , HyperCube::Direction zDir , std::vector< SlabValues >& slabValues , const _Evaluator< UIntPack< FEMSigs ... > , 1 >& evaluator )
{
static const unsigned int FEMDegrees[] = { FEMSignature< FEMSigs >::Degree ... };
SliceValues& sValues = slabValues[depth].sliceValues( slice );
typename SliceValues::Scratch &sScratch = slabValues[depth].sliceScratch( slice );
bool useBoundaryEvaluation = false;
for( int d=0 ; d<Dim ; d++ ) if( FEMDegrees[d]==0 || ( FEMDegrees[d]==1 && sValues.cornerGradients ) ) useBoundaryEvaluation = true;
std::vector< ConstPointSupportKey< UIntPack< FEMSignature< FEMSigs >::Degree ... > > > neighborKeys( ThreadPool::NumThreads() );
std::vector< ConstCornerSupportKey< UIntPack< FEMSignature< FEMSigs >::Degree ... > > > bNeighborKeys( ThreadPool::NumThreads() );
if( useBoundaryEvaluation ) for( size_t i=0 ; i<neighborKeys.size() ; i++ ) bNeighborKeys[i].set( tree._localToGlobal( depth ) );
else for( size_t i=0 ; i<neighborKeys.size() ; i++ ) neighborKeys[i].set( tree._localToGlobal( depth ) );
ThreadPool::Parallel_for( tree._sNodesBegin(depth,slice-(zDir==HyperCube::BACK ? 0 : 1)) , tree._sNodesEnd(depth,slice-(zDir==HyperCube::BACK ? 0 : 1)) , [&]( unsigned int thread , size_t i )
{
if( tree._isValidSpaceNode( tree._sNodes.treeNodes[i] ) )
{
Real squareValues[ HyperCube::Cube< Dim-1 >::template ElementNum< 0 >() ];
ConstPointSupportKey< UIntPack< FEMSignature< FEMSigs >::Degree ... > >& neighborKey = neighborKeys[ thread ];
ConstCornerSupportKey< UIntPack< FEMSignature< FEMSigs >::Degree ... > >& bNeighborKey = bNeighborKeys[ thread ];
TreeNode* leaf = tree._sNodes.treeNodes[i];
if( !IsActiveNode< Dim >( leaf->children ) )
{
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices<0> &cIndices = sValues.cellIndices.template indices<0>( leaf );
bool isInterior = tree._isInteriorlySupported( UIntPack< FEMSignature< FEMSigs >::Degree ... >() , leaf->parent );
if( useBoundaryEvaluation ) bNeighborKey.getNeighbors( leaf );
else neighborKey.getNeighbors( leaf );
for( typename HyperCube::Cube< Dim-1 >::template Element< 0 > _c ; _c<HyperCube::Cube< Dim-1 >::template ElementNum< 0 >() ; _c++ )
{
typename HyperCube::Cube< Dim >::template Element< 0 > c( zDir , _c.index );
node_index_type vIndex = cIndices[_c.index];
if( !sScratch.cSet[vIndex] )
{
if( sValues.cornerGradients )
{
CumulativeDerivativeValues< Real , Dim , 1 > p;
if( useBoundaryEvaluation ) p = tree.template _getCornerValues< Real , 1 >( bNeighborKey , leaf , c.index , coefficients , coarseCoefficients , evaluator , tree._maxDepth , isInterior );
else p = tree.template _getCornerValues< Real , 1 >( neighborKey , leaf , c.index , coefficients , coarseCoefficients , evaluator , tree._maxDepth , isInterior );
sValues.cornerValues[vIndex] = p[0] , sValues.cornerGradients[vIndex] = Point< Real , Dim >( p[1] , p[2] , p[3] );
}
else
{
if( useBoundaryEvaluation ) sValues.cornerValues[vIndex] = tree.template _getCornerValues< Real , 0 >( bNeighborKey , leaf , c.index , coefficients , coarseCoefficients , evaluator , tree._maxDepth , isInterior )[0];
else sValues.cornerValues[vIndex] = tree.template _getCornerValues< Real , 0 >( neighborKey , leaf , c.index , coefficients , coarseCoefficients , evaluator , tree._maxDepth , isInterior )[0];
}
sScratch.cSet[vIndex] = 1;
}
squareValues[_c.index] = sValues.cornerValues[ vIndex ];
TreeNode* node = leaf;
LocalDepth _depth = depth;
int _slice = slice;
while( _depth>fullDepth && tree._isValidSpaceNode( node->parent ) && (node-node->parent->children)==c.index )
{
node = node->parent , _depth-- , _slice >>= 1;
SliceValues &_sValues = slabValues[_depth].sliceValues( _slice );
typename SliceValues::Scratch &_sScratch = slabValues[_depth].sliceScratch( _slice );
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices<0> &_cIndices = _sValues.cellIndices.template indices<0>( node );
node_index_type _vIndex = _cIndices[_c.index];
_sValues.cornerValues[_vIndex] = sValues.cornerValues[vIndex];
if( _sValues.cornerGradients ) _sValues.cornerGradients[_vIndex] = sValues.cornerGradients[vIndex];
_sScratch.cSet[_vIndex] = 1;
}
}
sValues.mcIndices[ i - sValues.cellIndices.nodeOffset ] = HyperCube::Cube< Dim-1 >::MCIndex( squareValues , isoValue );
}
}
}
);
}
static void SetMCIndices( const FEMTree< Dim , Real >& tree , Real isoValue , LocalDepth depth , LocalDepth fullDepth , int slice , std::vector< SlabValues >& slabValues )
{
if( slice>0 ) SetMCIndices( tree , isoValue , depth , fullDepth , slice , HyperCube::FRONT , slabValues );
if( slice<(1<<depth) ) SetMCIndices( tree , isoValue , depth , fullDepth , slice , HyperCube::BACK , slabValues );
}
static void SetMCIndices( const FEMTree< Dim , Real >& tree , Real isoValue , LocalDepth depth , LocalDepth fullDepth , int slice , HyperCube::Direction zDir , std::vector< SlabValues >& slabValues )
{
SliceValues& sValues = slabValues[depth].sliceValues( slice );
bool useBoundaryEvaluation = false;
ThreadPool::Parallel_for( tree._sNodesBegin(depth,slice-(zDir==HyperCube::BACK ? 0 : 1)) , tree._sNodesEnd(depth,slice-(zDir==HyperCube::BACK ? 0 : 1)) , [&]( unsigned int thread , size_t i )
{
Real squareValues[ HyperCube::Cube< Dim-1 >::template ElementNum< 0 >() ];
TreeNode* leaf = tree._sNodes.treeNodes[i];
if( tree._isValidSpaceNode( leaf ) && !IsActiveNode< Dim >( leaf->children ) )
{
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices<0> &cIndices = sValues.cellIndices.template indices<0>( leaf );
for( typename HyperCube::Cube< Dim-1 >::template Element< 0 > _c ; _c<HyperCube::Cube< Dim-1 >::template ElementNum< 0 >() ; _c++ )
{
typename HyperCube::Cube< Dim >::template Element< 0 > c( zDir , _c.index );
node_index_type vIndex = cIndices[_c.index];
squareValues[_c.index] = sValues.cornerValues[ vIndex ];
sValues.mcIndices[ i - sValues.cellIndices.nodeOffset ] = HyperCube::Cube< Dim-1 >::MCIndex( squareValues , isoValue );
}
}
}
);
}
template< unsigned int WeightDegree , unsigned int DataSig >
static void SetSliceIsoVertices( const LevelSetExtraction::KeyGenerator< Dim > &keyGenerator , const FEMTree< Dim , Real >& tree , bool nonLinearFit , bool gradientNormals , typename FEMIntegrator::template PointEvaluator< IsotropicUIntPack< Dim , DataSig > , ZeroUIntPack< Dim > >* pointEvaluator , const DensityEstimator< WeightDegree >* densityWeights , const SparseNodeData< ProjectiveData< Data , Real > , IsotropicUIntPack< Dim , DataSig > >* data , Real isoValue , LocalDepth depth , LocalDepth fullDepth , int slice , node_index_type& vOffset , OutputDataStream< Vertex >& vertices , std::vector< SlabValues >& slabValues , const Data &zeroData )
{
if( slice>0 ) SetSliceIsoVertices< WeightDegree , DataSig >( keyGenerator , tree , nonLinearFit , gradientNormals , pointEvaluator , densityWeights , data , isoValue , depth , fullDepth , slice , HyperCube::FRONT , vOffset , vertices , slabValues , zeroData );
if( slice<(1<<depth) ) SetSliceIsoVertices< WeightDegree , DataSig >( keyGenerator , tree , nonLinearFit , gradientNormals , pointEvaluator , densityWeights , data , isoValue , depth , fullDepth , slice , HyperCube::BACK , vOffset , vertices , slabValues , zeroData );
}
template< unsigned int WeightDegree , unsigned int DataSig >
static void SetSliceIsoVertices( const LevelSetExtraction::KeyGenerator< Dim > &keyGenerator , const FEMTree< Dim , Real >& tree , bool nonLinearFit , bool gradientNormals , typename FEMIntegrator::template PointEvaluator< IsotropicUIntPack< Dim , DataSig > , ZeroUIntPack< Dim > >* pointEvaluator , const DensityEstimator< WeightDegree >* densityWeights , const SparseNodeData< ProjectiveData< Data , Real > , IsotropicUIntPack< Dim , DataSig > >* data , Real isoValue , LocalDepth depth , LocalDepth fullDepth , int slice , HyperCube::Direction zDir , node_index_type& vOffset , OutputDataStream< Vertex >& vertices , std::vector< SlabValues >& slabValues , const Data &zeroData )
{
auto _EdgeIndex = [&]( const TreeNode *node , typename HyperCube::Cube< Dim >::template Element< 1 > e )
{
int depth , offset[Dim];
tree.depthAndOffset( node , depth , offset );
return keyGenerator( depth , offset , e );
};
static const unsigned int DataDegree = FEMSignature< DataSig >::Degree;
SliceValues &sValues = slabValues[depth].sliceValues( slice );
typename SliceValues::Scratch &sScratch = slabValues[depth].sliceScratch( slice );
// [WARNING] In the case Degree=2, these two keys are the same, so we don't have to maintain them separately.
std::vector< ConstOneRingNeighborKey > neighborKeys( ThreadPool::NumThreads() );
std::vector< ConstPointSupportKey< IsotropicUIntPack< Dim , WeightDegree > > > weightKeys( ThreadPool::NumThreads() );
std::vector< ConstPointSupportKey< IsotropicUIntPack< Dim , DataDegree > > > dataKeys( ThreadPool::NumThreads() );
for( size_t i=0 ; i<neighborKeys.size() ; i++ ) neighborKeys[i].set( tree._localToGlobal( depth ) ) , weightKeys[i].set( tree._localToGlobal( depth ) ) , dataKeys[i].set( tree._localToGlobal( depth ) );
ThreadPool::Parallel_for( tree._sNodesBegin(depth,slice-(zDir==HyperCube::BACK ? 0 : 1)) , tree._sNodesEnd(depth,slice-(zDir==HyperCube::BACK ? 0 : 1)) , [&]( unsigned int thread , size_t i )
{
if( tree._isValidSpaceNode( tree._sNodes.treeNodes[i] ) )
{
ConstOneRingNeighborKey& neighborKey = neighborKeys[ thread ];
ConstPointSupportKey< IsotropicUIntPack< Dim , WeightDegree > >& weightKey = weightKeys[ thread ];
ConstPointSupportKey< IsotropicUIntPack< Dim , DataDegree > >& dataKey = dataKeys[ thread ];
TreeNode* leaf = tree._sNodes.treeNodes[i];
if( !IsActiveNode< Dim >( leaf->children ) )
{
node_index_type idx = (node_index_type)i - sValues.cellIndices.nodeOffset;
const typename LevelSetExtraction::SliceCellIndexData< Dim >::template CellIndices<1> &eIndices = sValues.cellIndices.template indices<1>( leaf );
if( HyperCube::Cube< Dim-1 >::HasMCRoots( sValues.mcIndices[idx] ) )
{
neighborKey.getNeighbors( leaf );
if( densityWeights ) weightKey.getNeighbors( leaf );
if constexpr( HasData ) if( data ) dataKey.getNeighbors( leaf );
for( typename HyperCube::Cube< Dim-1 >::template Element< 1 > _e ; _e<HyperCube::Cube< Dim-1 >::template ElementNum< 1 >() ; _e++ )
if( HyperCube::Cube< 1 >::HasMCRoots( HyperCube::Cube< Dim-1 >::ElementMCIndex( _e , sValues.mcIndices[idx] ) ) )
{
typename HyperCube::Cube< Dim >::template Element< 1 > e( zDir , _e.index );
node_index_type vIndex = eIndices[_e.index];
volatile char &edgeSet = sScratch.eSet[vIndex];
if( !edgeSet )
{
Vertex vertex;
Key key = _EdgeIndex( leaf , e );
GetIsoVertex< WeightDegree , DataSig >( tree , nonLinearFit , gradientNormals , pointEvaluator , densityWeights , data , isoValue , weightKey , dataKey , leaf , _e , zDir , sValues , vertex , zeroData );
bool stillOwner = false;
std::pair< node_index_type , Vertex > hashed_vertex;
{
std::lock_guard< std::mutex > lock( _pointInsertionMutex );
if( !edgeSet )
{
vertices.write( vertex );
edgeSet = 1;
hashed_vertex = std::pair< node_index_type , Vertex >( vOffset , vertex );
sValues.edgeKeys[ vIndex ] = key;
vOffset++;
stillOwner = true;
}
}
if( stillOwner )
{
sScratch.eKeyValues[ thread ].push_back( std::pair< Key , std::pair< node_index_type , Vertex > >( key , hashed_vertex ) );
// We only need to pass the iso-vertex down if the edge it lies on is adjacent to a coarser leaf
auto IsNeeded = [&]( unsigned int depth )
{
bool isNeeded = false;
typename HyperCube::Cube< Dim >::template IncidentCubeIndex< 1 > my_ic = HyperCubeTables< Dim , 1 >::IncidentCube[e.index];
for( typename HyperCube::Cube< Dim >::template IncidentCubeIndex< 1 > ic ; ic<HyperCube::Cube< Dim >::template IncidentCubeNum< 1 >() ; ic++ ) if( ic!=my_ic )
{
unsigned int xx = HyperCubeTables< Dim , 1 >::CellOffset[e.index][ic.index];
isNeeded |= !tree._isValidSpaceNode( neighborKey.neighbors[ tree._localToGlobal( depth ) ].neighbors.data[xx] );
}
return isNeeded;
};
if( IsNeeded( depth ) )
{
const typename HyperCube::Cube< Dim >::template Element< Dim-1 > *f = HyperCubeTables< Dim , 1 , Dim-1 >::OverlapElements[e.index];
for( int k=0 ; k<HyperCubeTables< Dim , 1 , Dim-1 >::OverlapElementNum ; k++ )
{
TreeNode* node = leaf;
LocalDepth _depth = depth;
int _slice = slice;
bool _cross = false;
while( tree._isValidSpaceNode( node->parent ) && HyperCubeTables< Dim , Dim-1 , 0 >::Overlap[f[k].index][(unsigned int)(node-node->parent->children) ] )
{
if( _slice&1 ) _cross = true;