forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkBezierContourLineInterpolator.cxx
230 lines (183 loc) · 6.52 KB
/
vtkBezierContourLineInterpolator.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
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
/*=========================================================================
Program: Visualization Toolkit
Module: vtkBezierContourLineInterpolator.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.
=========================================================================*/
#include "vtkBezierContourLineInterpolator.h"
#include "vtkContourRepresentation.h"
#include "vtkMath.h"
#include "vtkObjectFactory.h"
#include "vtkRenderer.h"
#include "vtkIntArray.h"
vtkStandardNewMacro(vtkBezierContourLineInterpolator);
//----------------------------------------------------------------------
vtkBezierContourLineInterpolator::vtkBezierContourLineInterpolator()
{
this->MaximumCurveError = 0.005;
this->MaximumCurveLineSegments = 100;
}
//----------------------------------------------------------------------
vtkBezierContourLineInterpolator::~vtkBezierContourLineInterpolator()
{
}
//----------------------------------------------------------------------
int vtkBezierContourLineInterpolator::InterpolateLine( vtkRenderer *vtkNotUsed(ren),
vtkContourRepresentation *rep,
int idx1, int idx2 )
{
int maxRecursion = 0;
int tmp = 3;
while ( 2*tmp < this->MaximumCurveLineSegments )
{
tmp *= 2;
maxRecursion++;
}
if ( maxRecursion == 0 )
{
return 1;
}
// There are four control points with 3 components each, plus one
// value for the recursion depth of this point
double *controlPointsStack = new double[(3*4+1)*(maxRecursion+1)];
int stackCount = 0;
double slope1[3];
double slope2[3];
rep->GetNthNodeSlope( idx1, slope1 );
rep->GetNthNodeSlope( idx2, slope2 );
controlPointsStack[0] = 0;
double *p1 = controlPointsStack+1;
double *p2 = controlPointsStack+4;
double *p3 = controlPointsStack+7;
double *p4 = controlPointsStack+10;
rep->GetNthNodeWorldPosition( idx1, p1 );
rep->GetNthNodeWorldPosition( idx2, p4 );
double distance = sqrt( vtkMath::Distance2BetweenPoints( p1, p4 ) );
p2[0] = p1[0] + .333*distance*slope1[0];
p2[1] = p1[1] + .333*distance*slope1[1];
p2[2] = p1[2] + .333*distance*slope1[2];
p3[0] = p4[0] - .333*distance*slope2[0];
p3[1] = p4[1] - .333*distance*slope2[1];
p3[2] = p4[2] - .333*distance*slope2[2];
stackCount++;
while ( stackCount )
{
//process last point on stack
int recursionLevel = static_cast<int>(controlPointsStack[13*(stackCount-1)]);
p1 = controlPointsStack + 13*(stackCount-1)+1;
p2 = controlPointsStack + 13*(stackCount-1)+4;
p3 = controlPointsStack + 13*(stackCount-1)+7;
p4 = controlPointsStack + 13*(stackCount-1)+10;
double totalDist = 0;
totalDist += sqrt(vtkMath::Distance2BetweenPoints(p1,p2));
totalDist += sqrt(vtkMath::Distance2BetweenPoints(p2,p3));
totalDist += sqrt(vtkMath::Distance2BetweenPoints(p3,p4));
distance = sqrt(vtkMath::Distance2BetweenPoints(p1,p4));
if ( recursionLevel >= maxRecursion || distance == 0 ||
(totalDist - distance)/distance < this->MaximumCurveError )
{
rep->AddIntermediatePointWorldPosition( idx1, p2 );
rep->AddIntermediatePointWorldPosition( idx1, p3 );
if ( stackCount > 1 )
{
rep->AddIntermediatePointWorldPosition( idx1, p4 );
}
stackCount--;
}
else
{
double p12[3], p23[3], p34[3], p123[3], p234[3], p1234[3];
this->ComputeMidpoint( p1, p2, p12 );
this->ComputeMidpoint( p2, p3, p23 );
this->ComputeMidpoint( p3, p4, p34 );
this->ComputeMidpoint( p12, p23, p123 );
this->ComputeMidpoint( p23, p34, p234 );
this->ComputeMidpoint( p123, p234, p1234 );
// add these two points to the stack
controlPointsStack[13*(stackCount-1)] = recursionLevel+1;
controlPointsStack[13*(stackCount)] = recursionLevel+1;
double *newp1 = controlPointsStack + 13*(stackCount)+1;
double *newp2 = controlPointsStack + 13*(stackCount)+4;
double *newp3 = controlPointsStack + 13*(stackCount)+7;
double *newp4 = controlPointsStack + 13*(stackCount)+10;
newp1[0] = p1[0];
newp1[1] = p1[1];
newp1[2] = p1[2];
newp2[0] = p12[0];
newp2[1] = p12[1];
newp2[2] = p12[2];
newp3[0] = p123[0];
newp3[1] = p123[1];
newp3[2] = p123[2];
newp4[0] = p1234[0];
newp4[1] = p1234[1];
newp4[2] = p1234[2];
p1[0] = p1234[0];
p1[1] = p1234[1];
p1[2] = p1234[2];
p2[0] = p234[0];
p2[1] = p234[1];
p2[2] = p234[2];
p3[0] = p34[0];
p3[1] = p34[1];
p3[2] = p34[2];
stackCount++;
}
}
delete [] controlPointsStack;
return 1;
}
//----------------------------------------------------------------------
void vtkBezierContourLineInterpolator::GetSpan( int nodeIndex,
vtkIntArray *nodeIndices,
vtkContourRepresentation *rep)
{
int start = nodeIndex - 2;
int end = nodeIndex - 1;
int index[2];
// Clear the array
nodeIndices->Reset();
nodeIndices->Squeeze();
nodeIndices->SetNumberOfComponents(2);
for ( int i = 0; i < 4; i++ )
{
index[0] = start++;
index[1] = end++;
if ( rep->GetClosedLoop() )
{
if ( index[0] < 0 )
{
index[0] += rep->GetNumberOfNodes();
}
if ( index[1] < 0 )
{
index[1] += rep->GetNumberOfNodes();
}
if ( index[0] >= rep->GetNumberOfNodes() )
{
index[0] -= rep->GetNumberOfNodes();
}
if ( index[1] >= rep->GetNumberOfNodes() )
{
index[1] -= rep->GetNumberOfNodes();
}
}
if ( index[0] >= 0 && index[0] < rep->GetNumberOfNodes() &&
index[1] >= 0 && index[1] < rep->GetNumberOfNodes() )
{
nodeIndices->InsertNextTupleValue( index );
}
}
}
//----------------------------------------------------------------------
void vtkBezierContourLineInterpolator::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "Maximum Curve Error: " << this->MaximumCurveError << "\n";
os << indent << "Maximum Curve Line Segments: "
<< this->MaximumCurveLineSegments << "\n";
}