/
itkQuadEdgeMesh.hxx
1483 lines (1300 loc) · 41.4 KB
/
itkQuadEdgeMesh.hxx
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 NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkQuadEdgeMesh_hxx
#define itkQuadEdgeMesh_hxx
#include <limits>
#include <vector>
namespace itk
{
template <typename TPixel, unsigned int VDimension, typename TTraits>
const typename QuadEdgeMesh<TPixel, VDimension, TTraits>::PointIdentifier
QuadEdgeMesh<TPixel, VDimension, TTraits>::m_NoPoint = std::numeric_limits<PointIdentifier>::max();
template <typename TPixel, unsigned int VDimension, typename TTraits>
const typename QuadEdgeMesh<TPixel, VDimension, TTraits>::CellIdentifier
QuadEdgeMesh<TPixel, VDimension, TTraits>::m_NoFace = std::numeric_limits<CellIdentifier>::max();
/**
* Restore the mesh to its initial state. Useful for data pipeline updates
* without memory re-allocation.
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::Initialize()
{
itkDebugMacro("Mesh Initialize method ");
Clear();
Superclass::Initialize();
}
/**
* Clear all this mesh by deleting all contained edges which as
* a side effect deletes adjacent faces
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::Clear()
{
if (this->GetEdgeCells())
{
CellsContainerIterator cellIterator = this->GetEdgeCells()->Begin();
while (!this->GetEdgeCells()->empty())
{
auto * edgeToDelete = dynamic_cast<EdgeCellType *>(cellIterator.Value());
this->LightWeightDeleteEdge(edgeToDelete);
cellIterator = this->GetEdgeCells()->Begin();
}
}
// Clear the points potentially left behind by LightWeightDeleteEdge():
if (this->GetPoints())
{
this->GetPoints()->clear();
}
this->ClearFreePointAndCellIndexesLists(); // to start at index 0
}
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::Graft(const DataObject * data)
{
this->Superclass::Graft(data);
const auto * mesh = dynamic_cast<const Self *>(data);
if (!mesh)
{
// pointer could not be cast back down
itkExceptionMacro(<< "itk::QuadEdgeMesh::CopyInformation() cannot cast " << typeid(data).name() << " to "
<< typeid(Self *).name());
}
this->m_FreePointIndexes = mesh->m_FreePointIndexes;
this->m_FreeCellIndexes = mesh->m_FreeCellIndexes;
this->ClearCellsContainer();
this->m_EdgeCellsContainer = mesh->m_EdgeCellsContainer;
this->m_NumberOfFaces = mesh->m_NumberOfFaces;
this->m_NumberOfEdges = mesh->m_NumberOfEdges;
}
/**
* \brief The one and only method to modify the edge connectivity.
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::Splice(QEPrimal * a, QEPrimal * b) -> PointIdentifier
{
bool SplitingOrigin = a->IsInOnextRing(b);
PointIdentifier resultingOriginId;
if (SplitingOrigin)
{
// see TODO's entry dated 2006-01-24
/* We consider the following situation which depicts the Onext()
* ring around the point Origin (which is both a->GetOrigin() and
* b->GetOrigin():
*
* \ /
* \ /
* e3 e2 counter-clockwise
* \ / Onext() order.
* \ /
* -----b------Org------a----
* / \
* / \
* / \
* / \
* / \
* e5 e6
* / \
* / \
*
* The result of this method is then:
*
* \ /
* \ /
* e3 e2
* \ /
* \ /
* ----b------newOrg
*
* Org------a-----
* / \
* / \
* / \
* / \
* / \
* e5 e7
* / \
* / \
*/
// Handle connectivity at QEQuadEdge level:
a->Splice(b);
////////// Handle the geometrical references:
// Make sure the Origin's edge entry doesn't point to an entry edge
// that isn't any more in the Onext ring:
PointIdentifier orgId = a->GetOrigin();
PointType org = this->GetPoint(orgId);
org.SetEdge(a);
this->SetPoint(orgId, org);
// Create a newOrigin point by duplicating the geometry of Origin...
PointType newOrigin = org;
newOrigin.SetEdge(b);
PointIdentifier newOriginId = this->AddPoint(newOrigin);
// ...and inform Onext ring of b that their Origin() have changed:
typename QEPrimal::IteratorGeom it;
for (it = b->BeginGeomOnext(); it != b->EndGeomOnext(); ++it)
{
it.Value()->SetOrigin(newOriginId);
}
resultingOriginId = newOriginId;
}
else
{
// see TODO's entry dated 2006-01-24
/* We consider the following situation which depicts the Onext()
* rings around the point Origin = a->GetOrigin() and
* oldOrigin = b->GetOrigin():
*
* \ /
* \ /
* e3 e2
* \ /
* \ /
* ----b------oldOrg
*
* Org------a-----
* / \
* / \
* / \
* / \
* / \
* e5 e7
* / \
* / \
*
*
* The result of this method is then:
*
* \ /
* \ /
* e3 e2 counter-clockwise
* \ / Onext() order.
* \ /
* -----b------Org------a----
* / \
* / \
* / \
* / \
* / \
* e5 e6
* / \
* / \
*
* Note: in this case we must handle the geometry first and
* then the connectivity.
*/
// Since this is the geometrical version of Splice() we
// have additional geometrical information that we should use
// to check the correctness of the situation.
/////////////////////////////////////////////////////////////
// First, consider the vertices: Origin and oldOrigin must be different.
PointIdentifier oldOriginId = b->GetOrigin();
PointIdentifier orgId = a->GetOrigin();
if (oldOriginId == orgId)
{
itkDebugMacro("Trying to fuse the same point!");
return (m_NoPoint);
}
/** \todo Compare the geometry of the two points and accept
* splicing when their geometry matches. We could fix
* an epsilon threshold distance above which the two points
* are considered distinct.
* PointType org = this->GetPoint(orgId);
*/
PointType oldOrigin = this->GetPoint(oldOriginId);
/////////////////////////////////////////////////////////////
/* We are done with the vertices and we might need to consider the
* possible initial adjacent face[s]. We shall accept to proceed
* with Splicing if and only if the following conditions are met:
* [1] a and b both share the SAME Left face,
* [2] a and b and in the same Lnext() ring,
* [3] a and b are not too close followers in the Lnext() ring
* [this is to avoid to create a face with only two edges which
* is equivalent to two different edges adjacent to the same two
* vertices].
*
* V ---<-b---- V
* / \
* / \
* / a.Lnext().Lnext()
* / \
* / Face \
* V V
* \ a.Splice(b) /
* \ is OK /
* \ a.Lnext()
* \ /
* \ /
* V ----a->--- V
*
* Basically, we accept to proceed with spliting if there is a
* single face on the left and this face is at least an hexagone
* and the vertices we wish to splice are at least two vertices aside.
*/
FaceRefType aLeftFace = a->GetLeft();
FaceRefType bLeftFace = b->GetLeft();
bool MustReconstructFace = false;
if ((aLeftFace == m_NoFace && bLeftFace != m_NoFace) || (aLeftFace != m_NoFace && bLeftFace == m_NoFace))
{
itkDebugMacro("Face on one side but not the other. Cancel.");
return (m_NoPoint);
}
if (aLeftFace != m_NoFace && bLeftFace != m_NoFace)
{
if ((aLeftFace == bLeftFace) && (a->GetLnext() != b) && (a->GetLnext()->GetLnext() != b) &&
(b->GetLnext() != a) && (b->GetLnext()->GetLnext() != a) && (a->IsInLnextRing(b)) && (b->IsInLnextRing(a)))
{
this->DeleteFace(aLeftFace);
MustReconstructFace = true;
}
else
{
itkDebugMacro("Face is not at least and hexagon.");
return (m_NoPoint);
}
}
// Notice that when aLeftFace == m_NoFace and bLeftFace == m_NoFace
// we simply proceed... (with MustReconstructFace initially set to
// false.
///////////////////////////////////////////////////////////////
// Handle connectivity at QEQuadEdge level:
a->Splice(b);
///////////////////////////////////////////////////////////////
// Back to dealing with the geometrical references. First
// make sure the oldOrigin's edge entry won't be used any more:
oldOrigin.SetEdge((QEPrimal *)nullptr);
this->SetPoint(oldOriginId, oldOrigin);
// We need to inform the edges ranging from a->Onext() to b that
// their Origin() have changed. Let's over do it (read, be lazy) and
// inform the full Onext() ring:
typename QEPrimal::IteratorGeom it;
for (it = a->BeginGeomOnext(); it != a->EndGeomOnext(); ++it)
{
it.Value()->SetOrigin(orgId);
}
resultingOriginId = oldOriginId;
///////////////////////////////////////////////////////////////
// Now that we are done with the handling of the geometry of
// vertices proceed with the geometry of the faces. When we
// are spliting a face (through Splicing) we must construct two
// new faces:
if (MustReconstructFace)
{
this->AddFace(a);
this->AddFace(b);
}
}
this->Modified();
return resultingOriginId;
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::SetCell(CellIdentifier cId, CellAutoPointer & cell)
{
(void)cId;
// NOTE ALEX: should add some checking to be sure everything went fine
EdgeCellType * qe;
PolygonCellType * pe;
// The QuadEdgeMeshCellTypes first
if ((qe = dynamic_cast<EdgeCellType *>(cell.GetPointer())) != nullptr)
{
// NOTE ALEX: here
this->AddEdge(qe->GetQEGeom()->GetOrigin(), qe->GetQEGeom()->GetDestination());
cell.ReleaseOwnership();
delete qe;
}
else if ((pe = dynamic_cast<PolygonCellType *>(cell.GetPointer())) != nullptr)
{
PointIdList points;
PointIdInternalIterator pit = pe->InternalPointIdsBegin();
PointIdInternalIterator pend = pe->InternalPointIdsEnd();
while (pit != pend)
{
points.push_back(*pit);
++pit;
}
// NOTE ALEX: here
this->AddFaceWithSecurePointList(points);
cell.ReleaseOwnership();
delete pe;
}
else // non-QE cell, i.e. original itk cells for example
{
PointIdentifier numPoint = cell->GetNumberOfPoints();
PointIdIterator pointId = cell->PointIdsBegin();
PointIdIterator endId = cell->PointIdsEnd();
// Edge
if (numPoint == 2)
{
if ((pointId) && (endId) && (pointId != endId))
{
PointIdIterator temp = pointId++;
// NOTE ALEX: here
this->AddEdge(*pointId, *temp);
}
}
// polygons
else if (cell->GetDimension() == 2)
{
PointIdList points;
while (pointId != endId)
{
points.push_back(*pointId);
++pointId;
}
// NOTE ALEX: here
this->AddFace(points);
}
cell.ReleaseOwnership();
delete (cell.GetPointer());
}
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::FindFirstUnusedPointIndex() -> PointIdentifier
{
PointIdentifier pid = 0;
PointIdentifier maxpid = this->GetNumberOfPoints();
if (!m_FreePointIndexes.empty())
{
// find the first valid free ID
do
{
pid = m_FreePointIndexes.front();
if (pid < maxpid)
{
m_FreePointIndexes.pop();
return (pid);
}
else
{
m_FreePointIndexes.pop();
}
} while (!m_FreePointIndexes.empty());
}
if (m_FreePointIndexes.empty())
{
pid = this->GetNumberOfPoints();
if (pid != 0)
{
PointsContainerConstIterator last = this->GetPoints()->End();
--last;
pid = last.Index() + 1;
}
}
return (pid);
}
/**
* The point container being a map, after deleting a point
* it is very likely that one index will be missing.
* This method "squeeze" the indexes by relocating the points
* and their data from the end of their respective container
* to the "empty" locations.
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::SqueezePointsIds()
{
// sanity check
if (m_FreePointIndexes.empty())
{
return;
}
// Get hold on the last point in the container
PointsContainerPointer points = this->GetPoints();
PointsContainerConstIterator last = points->End();
--last;
// Check if there is any data
PointDataContainerPointer pointData = this->GetPointData();
bool HasPointData = (pointData->Size() != 0);
// if there is get hold on the last point's data
PointDataContainerIterator lastData = pointData->End();
if (HasPointData)
{
--lastData;
}
// Some Temp var to be used in the while loop
PointIdentifier FilledPointID;
QEType * EdgeRingEntry;
QEType * EdgeRingIter;
// for all the free indexes and while there is any gap
while ((!m_FreePointIndexes.empty()) && (last.Index() >= this->GetNumberOfPoints()))
{
// duplicate last point into the empty slot and pop the id from freeID list
FilledPointID = AddPoint(GetPoint(last.Index()));
// same thing for the data if any
if (HasPointData)
{
pointData->SetElement(FilledPointID, pointData->GetElement(lastData.Index()));
}
// make sure that all the edges/faces now refer to the new ID
// i.e. enforce the integrity at the QE level now.
EdgeRingEntry = GetPoint(last.Index()).GetEdge();
if (EdgeRingEntry)
{
EdgeRingIter = EdgeRingEntry;
do
{
EdgeRingIter->SetOrigin(FilledPointID);
EdgeRingIter = EdgeRingIter->GetOnext();
} while (EdgeRingIter != EdgeRingEntry);
}
// pop the duplicated point from the container, increment iterator
points->DeleteIndex(last.Index());
last = points->End();
--last;
// same thing for data, if any
if (HasPointData)
{
pointData->DeleteIndex(lastData.Index());
lastData = pointData->End();
--lastData;
}
}
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::AddPoint(const PointType & p) -> PointIdentifier
{
PointIdentifier pid = this->FindFirstUnusedPointIndex();
this->SetPoint(pid, p);
return (pid);
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::DeletePoint(const PointIdentifier & pid)
{
// We suppose point index is valid
// otherwise we should test with
// this->GetPoints()->IndexExists( pid );
PointType pointToDelete = this->GetPoint(pid);
// Check that there is no cell that use this point anymore
// i.e. that the o-next-ring is empty
if (pointToDelete.GetEdge())
{
itkDebugMacro("Point is not isolated.");
return;
}
// Remove the point from the points container
this->GetPoints()->DeleteIndex(pid);
// Check if there is associated poindata and eventually delete them
if (this->GetPointData()->Size() > 0)
{
this->GetPointData()->DeleteIndex(pid);
}
// store the delete index to later squeeze the ID list
// needed to write files that expect incremental IDs
// like vtk
m_FreePointIndexes.push(pid);
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::GetPoint(const PointIdentifier & pid) const -> PointType
{
return (this->GetPoints()->GetElement(pid));
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::GetVector(const PointIdentifier & pid) const -> VectorType
{
return (this->GetPoint(pid).GetVectorFromOrigin());
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::FindFirstUnusedCellIndex() -> CellIdentifier
{
CellIdentifier cid;
if (m_FreeCellIndexes.empty())
{
cid = this->GetNumberOfCells();
if (cid != 0)
{
CellsContainerIterator last = this->GetCells()->End();
--last;
cid = last.Index() + 1;
}
}
else
{
cid = m_FreeCellIndexes.front();
m_FreeCellIndexes.pop();
}
return (cid);
}
/**
*\brief Construct a new edge ending at points with identifiers given
* as arguments.
* @param orgPid first endpoint (origin) of the edge to Add.
* @param destPid second endpoint (destination) of the edge to Add.
* @sa \ref GeometricalQuadEdge::InsertAfterNextBorderEdgeWithUnsetLeft
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
auto
QuadEdgeMesh<TPixel, VDimension, TTraits>::AddEdge(const PointIdentifier & orgPid, const PointIdentifier & destPid)
-> QEPrimal *
{
// Make sure the points are different
if (orgPid == destPid)
{
itkDebugMacro("Creating an edge between the same point.");
return ((QEPrimal *)nullptr);
}
// Make sure the points are already in the QuadEdgeMesh container:
if (!(this->GetPoints()->IndexExists(orgPid)) || !(this->GetPoints()->IndexExists(destPid)))
{
itkDebugMacro("One of the points not in the PointSet.");
return ((QEPrimal *)nullptr);
}
// Make sure the edge is not already in the container
QEPrimal * e = this->FindEdge(orgPid, destPid);
if (e != (QEPrimal *)nullptr)
{
itkDebugMacro("Edge already in QuadEdgeMesh.");
return e;
}
// Check if the points have room to receive a new edge
QEPrimal * eOrigin = this->GetPoint(orgPid).GetEdge();
if (eOrigin)
{
if (eOrigin->IsOriginInternal())
{
itkDebugMacro("No room for a new edge in the Origin() ring.");
return ((QEPrimal *)nullptr);
}
}
QEPrimal * eDestination = this->GetPoint(destPid).GetEdge();
if (eDestination)
{
if (eDestination->IsOriginInternal())
{
itkDebugMacro("No room for a new edge in the Destination() ring.");
return ((QEPrimal *)nullptr);
}
}
return AddEdgeWithSecurePointList(orgPid, destPid);
}
template <typename TPixel, unsigned int VDimension, typename TTraits>
typename QuadEdgeMesh<TPixel, VDimension, TTraits>::QEPrimal *
QuadEdgeMesh<TPixel, VDimension, TTraits>::AddEdgeWithSecurePointList(const PointIdentifier & orgPid,
const PointIdentifier & destPid)
{
PointsContainerPointer points = this->GetPoints();
PointType & pOrigin = points->ElementAt(orgPid);
PointType & pDestination = points->ElementAt(destPid);
QEPrimal * eOrigin = pOrigin.GetEdge();
QEPrimal * eDestination = pDestination.GetEdge();
// Ok, there's room and the points exist
auto * newEdge = new EdgeCellType();
QEPrimal * newEdgeGeom = newEdge->GetQEGeom();
newEdgeGeom->SetOrigin(orgPid);
newEdgeGeom->SetDestination(destPid);
if (!eOrigin)
{
pOrigin.SetEdge(newEdgeGeom);
}
else
{
eOrigin->InsertAfterNextBorderEdgeWithUnsetLeft(newEdgeGeom);
}
if (!eDestination)
{
pDestination.SetEdge(newEdgeGeom->GetSym());
}
else
{
eDestination->InsertAfterNextBorderEdgeWithUnsetLeft(newEdgeGeom->GetSym());
}
// Add it to the container
this->PushOnContainer(newEdge);
return (newEdgeGeom);
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::PushOnContainer(EdgeCellType * newEdge)
{
CellIdentifier eid = 0;
if (!this->GetEdgeCells()->empty())
{
CellsContainerConstIterator last = this->GetEdgeCells()->End();
--last;
eid = last.Index() + 1;
}
newEdge->SetIdent(eid);
CellAutoPointer pEdge;
pEdge.TakeOwnership(newEdge);
this->SetEdgeCell(eid, pEdge);
++m_NumberOfEdges;
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::DeleteEdge(const PointIdentifier & orgPid, const PointIdentifier & destPid)
{
// Check if the edge exists
QEPrimal * e = this->FindEdge(orgPid, destPid);
if (e == (QEPrimal *)nullptr)
{
itkDebugMacro("Edge missing in mesh.");
return;
}
this->DeleteEdge(e);
}
/**
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::DeleteEdge(QEPrimal * e)
{
const PointIdentifier & orgPid = e->GetOrigin();
const PointIdentifier & destPid = e->GetDestination();
PointsContainerPointer points = this->GetPoints();
// Check if the Origin point's edge ring entry should be changed
PointType & pOrigin = points->ElementAt(orgPid);
if (pOrigin.GetEdge() == e)
{
if (!e->IsOriginDisconnected())
{
pOrigin.SetEdge(e->GetOprev());
}
else
{
pOrigin.SetEdge((QEPrimal *)nullptr);
}
}
// Same for the Destination point
PointType & pDestination = points->ElementAt(destPid);
if (pDestination.GetEdge() == e->GetSym())
{
if (!e->IsDestinationDisconnected())
{
pDestination.SetEdge(e->GetLnext());
}
else
{
pDestination.SetEdge((QEPrimal *)nullptr);
}
}
// This container serves to avoid the MS .net bug when
// one wants to delete a map element using a map::iterator.
// Normally, if we delete a map element using an iterator,
// it should keep the iterator validity but .net doesn't
// like it, so we delay the cell deletion to a later loop.
using DeleteCellsCont = std::list<CellIdentifier>;
DeleteCellsCont cellsToDelete;
// Delete all references to 'e' in the cell container
CellsContainerIterator cit = this->GetCells()->Begin();
const CellsContainerIterator cend = this->GetCells()->End();
while (cit != cend)
{
auto * pcell = dynamic_cast<PolygonCellType *>(cit.Value());
bool toDelete = false;
if (pcell != (PolygonCellType *)nullptr)
{
QEPrimal * edge = pcell->GetEdgeRingEntry();
typename QEPrimal::IteratorGeom it = edge->BeginGeomLnext();
const typename QEPrimal::IteratorGeom end = edge->EndGeomLnext();
while (it != end && !toDelete)
{
toDelete = ((it.Value() == e) || (it.Value()->GetSym() == e));
++it;
}
if (toDelete)
{
--m_NumberOfFaces;
// handle QE level, i.e. for the polygon, just unset the faces
it = edge->BeginGeomLnext();
while (it != end)
{
it.Value()->UnsetLeft();
++it;
}
}
}
// if the current face is to be deleted,
// put it in the second container
// and keep the Id for next cell insertion
if (toDelete)
{
cellsToDelete.push_back(cit.Index());
m_FreeCellIndexes.push(cit.Index());
}
++cit;
}
// we checked all the cells i nthe container
// now delete the elements in the map
auto dit = cellsToDelete.begin();
const typename DeleteCellsCont::iterator dend = cellsToDelete.end();
while (dit != dend)
{
const CellType * cellToBeDeleted = this->GetCells()->GetElement(*dit);
delete cellToBeDeleted;
this->GetCells()->DeleteIndex(*dit);
++dit;
}
// now delete the edge in the edge container
CellType * edgeCellToDelete = this->GetEdgeCells()->ElementAt(e->GetIdent());
this->GetEdgeCells()->DeleteIndex(e->GetIdent());
delete edgeCellToDelete;
--m_NumberOfEdges;
// Now, disconnect it and let the garbage collector do the rest
this->Modified();
}
/**
* Delete the incoming edge and all LOCAL references to this edge.
* By local we mean the ones we can reasonably be aware of i.e.
* the adjacent faces (that we also delete) and the adjacent points
* (when the incoming edge is their Onext ring entry).
* This is to be opposed to \ref DeleteEdge that searches for ALL
* references to the incoming edge (which is a much heavier process
* because one as to make an exhaustive search in the CellContainer).
* \note: when deleting the adjacent faces we also handle the
* suppression of the references to those faces in the Lnext()
* and Rnext() rings.
* \warning Nothing is done to remove the potential isolated points
* left by this edge deletion (the caller might want to recycle
* them). Hence it is the caller's responsibility to manage the
* clean-up of adjacent points (when necessary).
*/
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::LightWeightDeleteEdge(EdgeCellType * edgeCell)
{
if (!edgeCell)
{
return;
}
QEPrimal * e = edgeCell->GetQEGeom();
if (!e)
{
return;
}
const PointIdentifier & orgPid = e->GetOrigin();
const PointIdentifier & destPid = e->GetDestination();
PointsContainerPointer points = this->GetPoints();
if (orgPid != e->m_NoPoint && destPid != e->m_NoPoint)
{
// ------------------------------------------------------------------
// First make sure the points are not pointing to the edge we are
// trying to delete.
// Check if the Origin point's edge ring entry is the edge we are
// trying to delete. When this is the case shift the Origin edge entry
// to another edge and when no other edge is available leave it
// to nullptr.
PointType & pOrigin = points->ElementAt(orgPid);
if (pOrigin.GetEdge() == e)
{
if (!e->IsOriginDisconnected())
{
pOrigin.SetEdge(e->GetOprev());
}
else
{
pOrigin.SetEdge((QEPrimal *)nullptr);
}
}
// Same thing for the Destination point:
PointType & pDestination = points->ElementAt(destPid);
if (pDestination.GetEdge() == e->GetSym())
{
if (!e->IsDestinationDisconnected())
{
pDestination.SetEdge(e->GetLnext());
}
else
{
pDestination.SetEdge((QEPrimal *)nullptr);
}
}
// ------------------------------------------------------------------
// Second we need to destroy the adjacent faces (both GetLeft()
// and GetRight() when they exist) because their very definition
// makes reference to the edge we are trying to delete:
if (e->IsLeftSet())
{
this->DeleteFace(e->GetLeft());
}
if (e->IsRightSet())
{
this->DeleteFace(e->GetRight());
}
/////////////////////////////////////////////////////////////////
// Third we need to remove from the container the EdgeCell
// representing the edge we are trying to destroy at the itk
// level.
this->GetEdgeCells()->DeleteIndex(edgeCell->GetIdent());
edgeCell->SetIdent(0);
// Eventually, we disconnect (at the QuadEdge level) the edge we
// are trying to delete and we delete it.
e->Disconnect();
}
--m_NumberOfEdges;
delete edgeCell;
this->Modified();
}
template <typename TPixel, unsigned int VDimension, typename TTraits>
void
QuadEdgeMesh<TPixel, VDimension, TTraits>::LightWeightDeleteEdge(QEPrimal * e)
{
if (!e)
{
return;
}
const PointIdentifier & orgPid = e->GetOrigin();
if (orgPid == e->m_NoPoint)
{
// org not set
return;
}
const PointIdentifier & destPid = e->GetDestination();
if (destPid == e->m_NoPoint)
{
// dest not set
return;
}