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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkMergePoints.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 "vtkMergePoints.h"
#include "vtkDataArray.h"
#include "vtkIdList.h"
#include "vtkObjectFactory.h"
#include "vtkPoints.h"
#include "vtkFloatArray.h"
vtkStandardNewMacro(vtkMergePoints);
// Determine whether point given by x[3] has been inserted into points list.
// Return id of previously inserted point if this is true, otherwise return
// -1.
vtkIdType vtkMergePoints::IsInsertedPoint(const double x[3])
{
//
// Locate bucket that point is in.
//
vtkIdType idx = this->GetBucketIndex(x);
vtkIdList* bucket = this->HashTable[idx];
if ( ! bucket )
{
return -1;
}
else // see whether we've got duplicate point
{
//
// Check the list of points in that bucket.
//
vtkIdType ptId;
vtkIdType nbOfIds = bucket->GetNumberOfIds ();
// For efficiency reasons, we break the data abstraction for points
// and ids (we are assuming and vtkIdList
// is storing ints).
vtkDataArray *dataArray = this->Points->GetData();
vtkIdType *idArray = bucket->GetPointer(0);
if (dataArray->GetDataType() == VTK_FLOAT)
{
float f[3];
f[0] = static_cast<float>(x[0]);
f[1] = static_cast<float>(x[1]);
f[2] = static_cast<float>(x[2]);
vtkFloatArray *floatArray = static_cast<vtkFloatArray *>(dataArray);
float *pt;
for (vtkIdType i=0; i < nbOfIds; i++)
{
ptId = idArray[i];
pt = floatArray->GetPointer(0) + 3*ptId;
if ( f[0] == pt[0] && f[1] == pt[1] && f[2] == pt[2] )
{
return ptId;
}
}
}
else
{
// Using the double interface
double *pt;
for (vtkIdType i=0; i < nbOfIds; i++)
{
ptId = idArray[i];
pt = dataArray->GetTuple(ptId);
if ( x[0] == pt[0] && x[1] == pt[1] && x[2] == pt[2] )
{
return ptId;
}
}
}
}
return -1;
}
int vtkMergePoints::InsertUniquePoint(const double x[3], vtkIdType &id)
{
//
// Locate bucket that point is in.
//
vtkIdType idx = this->GetBucketIndex(x);
vtkIdList* bucket = this->HashTable[idx];
if (bucket) // see whether we've got duplicate point
{
//
// Check the list of points in that bucket.
//
vtkIdType ptId;
vtkIdType nbOfIds = bucket->GetNumberOfIds ();
// For efficiency reasons, we break the data abstraction for points
// and ids (we are assuming vtkPoints stores a vtkIdList
// is storing ints).
vtkDataArray *dataArray = this->Points->GetData();
vtkIdType *idArray = bucket->GetPointer(0);
if (dataArray->GetDataType() == VTK_FLOAT)
{
float f[3];
f[0] = static_cast<float>(x[0]);
f[1] = static_cast<float>(x[1]);
f[2] = static_cast<float>(x[2]);
vtkFloatArray *floatArray = static_cast<vtkFloatArray *>(dataArray);
float *pt;
for (vtkIdType i=0; i < nbOfIds; i++)
{
ptId = idArray[i];
pt = floatArray->GetPointer(0) + 3*ptId;
if ( f[0] == pt[0] && f[1] == pt[1] && f[2] == pt[2] )
{
// point is already in the list, return 0 and set the id parameter
id = ptId;
return 0;
}
}
}
else
{
// Using the double interface
double *pt;
for (vtkIdType i=0; i < nbOfIds; i++)
{
ptId = idArray[i];
pt = dataArray->GetTuple(ptId);
if ( x[0] == pt[0] && x[1] == pt[1] && x[2] == pt[2] )
{
// point is already in the list, return 0 and set the id parameter
id = ptId;
return 0;
}
}
}
}
else
{
// create a bucket point list and insert the point
bucket = vtkIdList::New();
bucket->Allocate(this->NumberOfPointsPerBucket/2,
this->NumberOfPointsPerBucket/3);
this->HashTable[idx] = bucket;
}
// point has to be added
bucket->InsertNextId(this->InsertionPointId);
this->Points->InsertPoint(this->InsertionPointId,x);
id = this->InsertionPointId++;
return 1;
}
//----------------------------------------------------------------------------
void vtkMergePoints::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
}
|
