----------------------------------------------------------------------------------------------
| 188 | |
| 189 | //---------------------------------------------------------------------------------------------- |
| 190 | void vtkHyperTreeGridFeatureEdges::RecursivelyProcess2DHTGTree(vtkHyperTreeGrid* input, |
| 191 | vtkPoints* outPoints, vtkCellArray* outCells, |
| 192 | vtkHyperTreeGridNonOrientedVonNeumannSuperCursor* cursor) |
| 193 | { |
| 194 | if (cursor->IsLeaf()) |
| 195 | { |
| 196 | auto points = this->Build2DCellPoints(cursor); |
| 197 | |
| 198 | for (unsigned int edgeId = 0; edgeId < 4; ++edgeId) |
| 199 | { |
| 200 | if (this->ShouldAddEdge2D(cursor, edgeId)) |
| 201 | { |
| 202 | // Add edge |
| 203 | double pt1[3] = { 0.0 }; |
| 204 | double pt2[3] = { 0.0 }; |
| 205 | points->GetPoint(EDGE_PT_IDS_2D[edgeId][0], pt1); |
| 206 | points->GetPoint(EDGE_PT_IDS_2D[edgeId][1], pt2); |
| 207 | this->InsertNewEdge(pt1, pt2, outPoints, outCells, cursor->GetGlobalNodeIndex()); |
| 208 | } |
| 209 | } |
| 210 | |
| 211 | return; |
| 212 | } |
| 213 | |
| 214 | for (unsigned int ichild = 0; ichild < cursor->GetNumberOfChildren(); ++ichild) |
| 215 | { |
| 216 | if (!cursor->IsMasked()) |
| 217 | { |
| 218 | cursor->ToChild(ichild); |
| 219 | this->RecursivelyProcess2DHTGTree(input, outPoints, outCells, cursor); |
| 220 | cursor->ToParent(); |
| 221 | } |
| 222 | } |
| 223 | } |
| 224 | |
| 225 | //---------------------------------------------------------------------------------------------- |
| 226 | void vtkHyperTreeGridFeatureEdges::RecursivelyProcess3DHTGTree(vtkHyperTreeGrid* input, |
no test coverage detected