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
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#include "vtkSpatialRepresentationFilter.h"
#include "vtkGarbageCollector.h"
#include "vtkInformation.h"
#include "vtkLocator.h"
#include "vtkMultiBlockDataSet.h"
#include "vtkNew.h"
#include "vtkObjectFactory.h"
#include "vtkPolyData.h"
#include <set>
VTK_ABI_NAMESPACE_BEGIN
class vtkSpatialRepresentationFilterInternal
{
public:
std::set<int> Levels;
};
vtkStandardNewMacro(vtkSpatialRepresentationFilter);
vtkCxxSetObjectMacro(vtkSpatialRepresentationFilter, SpatialRepresentation, vtkLocator);
vtkSpatialRepresentationFilter::vtkSpatialRepresentationFilter()
{
this->SetNumberOfInputPorts(1);
this->SpatialRepresentation = nullptr;
this->MaximumLevel = 0;
this->GenerateLeaves = false;
this->Internal = new vtkSpatialRepresentationFilterInternal;
}
vtkSpatialRepresentationFilter::~vtkSpatialRepresentationFilter()
{
if (this->SpatialRepresentation)
{
this->SpatialRepresentation->UnRegister(this);
this->SpatialRepresentation = nullptr;
}
delete this->Internal;
}
void vtkSpatialRepresentationFilter::AddLevel(int level)
{
this->Internal->Levels.insert(level);
}
void vtkSpatialRepresentationFilter::ResetLevels()
{
this->Internal->Levels.clear();
}
int vtkSpatialRepresentationFilter::RequestData(
vtkInformation*, vtkInformationVector** inputVector, vtkInformationVector* outputVector)
{
vtkDataSet* input = vtkDataSet::GetData(inputVector[0]);
vtkMultiBlockDataSet* output = vtkMultiBlockDataSet::GetData(outputVector);
if (this->SpatialRepresentation == nullptr)
{
vtkErrorMacro(<< "SpatialRepresentation is nullptr.");
return 0;
}
this->SpatialRepresentation->SetDataSet(input);
this->SpatialRepresentation->Update();
this->MaximumLevel = this->SpatialRepresentation->GetLevel();
//
// Loop over all requested levels generating new levels as necessary
//
std::set<int>::iterator it;
for (it = this->Internal->Levels.begin(); it != this->Internal->Levels.end(); ++it)
{
if (this->CheckAbort())
{
break;
}
if (*it <= this->MaximumLevel)
{
vtkNew<vtkPolyData> level_representation;
output->SetBlock(*it, level_representation);
this->SpatialRepresentation->GenerateRepresentation(*it, level_representation);
}
}
if (this->GenerateLeaves)
{
vtkNew<vtkPolyData> leaf_representation;
output->SetBlock(this->MaximumLevel + 1, leaf_representation);
this->SpatialRepresentation->GenerateRepresentation(-1, leaf_representation);
}
this->CheckAbort();
return 1;
}
void vtkSpatialRepresentationFilter::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "Maximum Level: " << this->MaximumLevel << "\n";
os << indent << "GenerateLeaves: " << this->GenerateLeaves << "\n";
if (this->SpatialRepresentation)
{
os << indent << "Spatial Representation: " << this->SpatialRepresentation << "\n";
}
else
{
os << indent << "Spatial Representation: (none)\n";
}
}
//------------------------------------------------------------------------------
void vtkSpatialRepresentationFilter::ReportReferences(vtkGarbageCollector* collector)
{
this->Superclass::ReportReferences(collector);
// This filter shares our input and is therefore involved in a
// reference loop.
vtkGarbageCollectorReport(collector, this->SpatialRepresentation, "SpatialRepresentation");
}
//------------------------------------------------------------------------------
int vtkSpatialRepresentationFilter::FillInputPortInformation(int port, vtkInformation* info)
{
if (!this->Superclass::FillInputPortInformation(port, info))
{
return 0;
}
info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkDataSet");
return 1;
}
VTK_ABI_NAMESPACE_END
|
