File: itkQuadEdgeMeshTopologyChecker.hxx

package info (click to toggle)
insighttoolkit5 5.4.3-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 704,384 kB
  • sloc: cpp: 783,592; ansic: 628,724; xml: 44,704; fortran: 34,250; python: 22,874; sh: 4,078; pascal: 2,636; lisp: 2,158; makefile: 464; yacc: 328; asm: 205; perl: 203; lex: 146; tcl: 132; javascript: 98; csh: 81
file content (135 lines) | stat: -rw-r--r-- 4,534 bytes parent folder | download
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
/*=========================================================================
 *
 *  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 itkQuadEdgeMeshTopologyChecker_hxx
#define itkQuadEdgeMeshTopologyChecker_hxx


namespace itk
{
template <typename TMesh>
QuadEdgeMeshTopologyChecker<TMesh>::QuadEdgeMeshTopologyChecker()
{
  m_ExpectedNumberOfPoints = PointIdentifier{};
  m_ExpectedNumberOfEdges = CellIdentifier{};
  m_ExpectedNumberOfFaces = CellIdentifier{};
  m_ExpectedNumberOfBoundaries = CellIdentifier{};
  m_ExpectedGenus = OffsetValueType{};
  m_Mesh = nullptr;
}

template <typename TMesh>
bool
QuadEdgeMeshTopologyChecker<TMesh>::ValidateEulerCharacteristic() const
{
  if (!this->m_Mesh)
  {
    return (false);
  }

  auto boundaryEdges = BoundaryEdges::New();

  // Number of USED points
  PointIdentifier numPoints = m_Mesh->ComputeNumberOfPoints();
  // Number of USED edges
  CellIdentifier numEdges = m_Mesh->ComputeNumberOfEdges();
  // Number of USED faces
  CellIdentifier numFaces = m_Mesh->ComputeNumberOfFaces();
  // Number of Boundaries
  typename BoundaryEdges::OutputType listOfBoundaries = boundaryEdges->Evaluate((*m_Mesh));
  auto                               numBounds = static_cast<CellIdentifier>(listOfBoundaries->size());
  delete listOfBoundaries;

  /**
   * Number of points
   *
   * There are two methods to get the number of points.
   * 1. itk::QuadEdgeMesh::ComputeNumberOfPoints()
   * 2. itk::Mesh::GetNumberOfPoints()
   *
   * As an itk::QuadEdgeMesh is an itk::Mesh by inheritance, the user
   * can use both. 1. will returned the number of points actually
   * used by at least one edge, while 2. will give you the number
   * of points in the container. Number of unused points can be found
   * by making the difference between the two values.
   */
  if (m_Mesh->GetNumberOfPoints() != numPoints)
  {
    // They are isolated vertices:
    return (false);
  }

  // The euler formula states:
  // numFaces - numEdges + numPoints == 2 - 2 * genus - numBounds
  // hence ( 2 - numBounds - numFaces + numEdges - numPoints ) must
  // be an odd number. Let's check it out:
  // Note that genus can take a negative value...
  OffsetValueType twiceGenus = OffsetValueType(2) - OffsetValueType(numBounds) - OffsetValueType(numFaces) +
                               OffsetValueType(numEdges) - OffsetValueType(numPoints);

  if (twiceGenus % 2)
  {
    return (false);
  }

  // Look is they are isolated edges
  CellsContainerConstIterator cellIterator = m_Mesh->GetCells()->Begin();
  CellsContainerConstIterator cellEnd = m_Mesh->GetCells()->End();
  while (cellIterator != cellEnd)
  {
    // Is the cell an Edge ?
    if (auto * cell = dynamic_cast<EdgeCellType *>(cellIterator.Value()))
    {
      if (QEPrimal * edge = cell->GetQEGeom())
      {
        // Is the edge without associated faces ?.
        if (edge->IsWire())
        {
          // Is it an isolated edge ?
          if (edge->IsIsolated() && edge->GetSym()->IsIsolated())
          {
            return (false);
          }
        }
      }
      else // cell->GetQEGeom( ) == nullptr
      {
        // supposedly impossible, throw exception
      }
    }

    ++cellIterator;
  } // end of while

  return (true);
}

template <typename TMesh>
void
QuadEdgeMeshTopologyChecker<TMesh>::PrintSelf(std::ostream & os, Indent indent) const
{
  Superclass::PrintSelf(os, indent);

  os << indent << "ExpectedNumberOfPoints: " << m_ExpectedNumberOfPoints << std::endl;
  os << indent << "ExpectedNumberOfEdges: " << m_ExpectedNumberOfEdges << std::endl;
  os << indent << "ExpectedNumberOfFaces: " << m_ExpectedNumberOfFaces << std::endl;
  os << indent << "ExpectedNumberOfBoundaries: " << m_ExpectedNumberOfBoundaries << std::endl;
  os << indent << "ExpectedGenus: " << m_ExpectedGenus << std::endl;
  os << indent << "Mesh: " << m_Mesh << std::endl;
}
} // namespace itk
#endif