forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkPruneTreeFilter.cxx
142 lines (121 loc) · 4.43 KB
/
vtkPruneTreeFilter.cxx
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
/*=========================================================================
Program: Visualization Toolkit
Module: vtkPruneTreeFilter.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
#include "vtkPruneTreeFilter.h"
#include "vtkCellData.h"
#include "vtkInformation.h"
#include "vtkMutableDirectedGraph.h"
#include "vtkObjectFactory.h"
#include "vtkOutEdgeIterator.h"
#include "vtkPointData.h"
#include "vtkSmartPointer.h"
#include "vtkStringArray.h"
#include "vtkTree.h"
#include "vtkTreeDFSIterator.h"
#include <utility>
#include <vector>
vtkStandardNewMacro(vtkPruneTreeFilter);
vtkPruneTreeFilter::vtkPruneTreeFilter()
{
this->ParentVertex = 0;
this->ShouldPruneParentVertex = true;
}
vtkPruneTreeFilter::~vtkPruneTreeFilter()
{
}
void vtkPruneTreeFilter::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "Parent: " << this->ParentVertex << endl;
}
int vtkPruneTreeFilter::RequestData(
vtkInformation*,
vtkInformationVector** inputVector,
vtkInformationVector* outputVector)
{
vtkTree* inputTree = vtkTree::GetData(inputVector[0]);
vtkTree* outputTree = vtkTree::GetData(outputVector);
if (this->ParentVertex < 0 || this->ParentVertex >= inputTree->GetNumberOfVertices())
{
vtkErrorMacro("Parent vertex must be part of the tree " << this->ParentVertex
<< " >= " << inputTree->GetNumberOfVertices());
return 0;
}
// Structure for building the tree.
vtkSmartPointer<vtkMutableDirectedGraph> builder =
vtkSmartPointer<vtkMutableDirectedGraph>::New();
// Child iterator.
vtkSmartPointer<vtkOutEdgeIterator> it =
vtkSmartPointer<vtkOutEdgeIterator>::New();
// Get the input and builder vertex and edge data.
vtkDataSetAttributes *inputVertexData = inputTree->GetVertexData();
vtkDataSetAttributes *inputEdgeData = inputTree->GetEdgeData();
vtkDataSetAttributes *builderVertexData = builder->GetVertexData();
vtkDataSetAttributes *builderEdgeData = builder->GetEdgeData();
builderVertexData->CopyAllocate(inputVertexData);
builderEdgeData->CopyAllocate(inputEdgeData);
// Copy field data
builder->GetFieldData()->DeepCopy(inputTree->GetFieldData());
// Build a copy of the tree, skipping the parent vertex to remove.
std::vector< std::pair<vtkIdType, vtkIdType> > vertStack;
if (inputTree->GetRoot() != this->ParentVertex)
{
vertStack.push_back(std::make_pair(inputTree->GetRoot(), builder->AddVertex()));
}
while (!vertStack.empty())
{
vtkIdType tree_v = vertStack.back().first;
vtkIdType v = vertStack.back().second;
builderVertexData->CopyData(inputVertexData, tree_v, v);
vertStack.pop_back();
inputTree->GetOutEdges(tree_v, it);
while (it->HasNext())
{
vtkOutEdgeType tree_e = it->Next();
vtkIdType tree_child = tree_e.Target;
if (this->ShouldPruneParentVertex)
{
if (tree_child != this->ParentVertex)
{
vtkIdType child = builder->AddVertex();
vtkEdgeType e = builder->AddEdge(v, child);
builderEdgeData->CopyData(inputEdgeData, tree_e.Id, e.Id);
vertStack.push_back(std::make_pair(tree_child, child));
}
}
else
{
vtkIdType child = builder->AddVertex();
vtkEdgeType e = builder->AddEdge(v, child);
builderEdgeData->CopyData(inputEdgeData, tree_e.Id, e.Id);
if (tree_child != this->ParentVertex)
{
vertStack.push_back(std::make_pair(tree_child, child));
}
else
{
builderVertexData->CopyData(inputVertexData, tree_child, child);
}
}
}
}
// Copy the structure into the output.
if (!outputTree->CheckedShallowCopy(builder))
{
vtkErrorMacro(<<"Invalid tree structure.");
return 0;
}
return 1;
}