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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
|
/*
* Copyright (C) 2008-2012 Thorsten Liebig (Thorsten.Liebig@gmx.de)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <sstream>
#include <iostream>
#include <limits>
#include "tinyxml.h"
#include "stdint.h"
#include "CSPrimMultiBox.h"
#include "CSProperties.h"
#include "CSUseful.h"
CSPrimMultiBox::CSPrimMultiBox(unsigned int ID, ParameterSet* paraSet, CSProperties* prop) : CSPrimitives(ID,paraSet,prop)
{
Type=MULTIBOX;
PrimTypeName = std::string("Multi Box");
}
CSPrimMultiBox::CSPrimMultiBox(CSPrimMultiBox* multiBox, CSProperties *prop) : CSPrimitives(multiBox, prop)
{
Type=MULTIBOX;
for (size_t i=0;i<multiBox->vCoords.size();++i)
vCoords.push_back(new ParameterScalar(multiBox->vCoords.at(i)));
PrimTypeName = std::string("Multi Box");
}
CSPrimMultiBox::CSPrimMultiBox(ParameterSet* paraSet, CSProperties* prop) : CSPrimitives(paraSet,prop)
{
Type=MULTIBOX;
PrimTypeName = std::string("Multi Box");
}
CSPrimMultiBox::~CSPrimMultiBox()
{
}
void CSPrimMultiBox::SetCoord(int index, double val)
{
if ((index>=0) && (index<(int)vCoords.size()))
vCoords.at(index)->SetValue(val);
}
void CSPrimMultiBox::SetCoord(int index, const char* val)
{
if ((index>=0) && (index<(int)vCoords.size()))
vCoords.at(index)->SetValue(val);
}
void CSPrimMultiBox::AddCoord(double val)
{
vCoords.push_back(new ParameterScalar(clParaSet,val));
}
void CSPrimMultiBox::AddCoord(const char* val)
{
vCoords.push_back(new ParameterScalar(clParaSet,val));
}
void CSPrimMultiBox::AddBox(int initBox)
{
ClearOverlap();
if ((initBox<0) || (((initBox+1)*6)>(int)vCoords.size()))
{
for (unsigned int i=0;i<6;++i)
AddCoord(0.0);
}
else for (unsigned int i=0;i<6;++i)
vCoords.push_back(new ParameterScalar(vCoords.at(6*initBox+i)));
}
void CSPrimMultiBox::DeleteBox(size_t box)
{
if ((box+1)*6>vCoords.size()) return;
std::vector<ParameterScalar*>::iterator start=vCoords.begin()+(box*6);
std::vector<ParameterScalar*>::iterator end=vCoords.begin()+(box*6+6);
vCoords.erase(start,end);
}
double CSPrimMultiBox::GetCoord(int index)
{
if ((index>=0) && (index<(int)vCoords.size()))
return vCoords.at(index)->GetValue();
return 0;
}
ParameterScalar* CSPrimMultiBox::GetCoordPS(int index)
{
if ((index>=0) && (index<(int)vCoords.size()))
return vCoords.at(index);
return NULL;
}
double* CSPrimMultiBox::GetAllCoords(size_t &Qty, double* array)
{
Qty=vCoords.size();
delete[] array;
array = new double[Qty];
for (size_t i=0;i<Qty;++i)
array[i]=vCoords.at(i)->GetValue();
return array;
}
void CSPrimMultiBox::ClearOverlap()
{
if (vCoords.size()%6==0) return; //no work to be done
vCoords.resize(vCoords.size()-vCoords.size()%6);
}
bool CSPrimMultiBox::GetBoundBox(double dBoundBox[6], bool PreserveOrientation)
{
UNUSED(PreserveOrientation); //has no orientation or preserved anyways
for (int n=0;n<6;++n) dBoundBox[n] = 0;
//Update();
for (unsigned int i=0;i<vCoords.size()/6;++i)
{
for (unsigned int n=0;n<3;++n)
{
if (vCoords.at(6*i+2*n)->GetValue()<=vCoords.at(6*i+2*n+1)->GetValue())
{
if (i==0)
{
dBoundBox[2*n]=vCoords.at(6*i+2*n)->GetValue();
dBoundBox[2*n+1]=vCoords.at(6*i+2*n+1)->GetValue();
}
else
{
if (vCoords.at(6*i+2*n)->GetValue()<dBoundBox[2*n]) dBoundBox[2*n]=vCoords.at(6*i+2*n)->GetValue();
if (vCoords.at(6*i+2*n+1)->GetValue()>dBoundBox[2*n+1]) dBoundBox[2*n+1]=vCoords.at(6*i+2*n+1)->GetValue();
}
}
else
{
if (i==0)
{
dBoundBox[2*n]=vCoords.at(6*i+2*n+1)->GetValue();
dBoundBox[2*n+1]=vCoords.at(6*i+2*n)->GetValue();
}
else
{
if (vCoords.at(6*i+2*n+1)->GetValue()<dBoundBox[2*n]) dBoundBox[2*n]=vCoords.at(6*i+2*n+1)->GetValue();
if (vCoords.at(6*i+2*n)->GetValue()>dBoundBox[2*n+1]) dBoundBox[2*n+1]=vCoords.at(6*i+2*n)->GetValue();
}
}
}
}
m_Dimension=0;
m_BoundBox_CoordSys = m_MeshType;
for (int n=0;n<3;++n)
{
if (dBoundBox[2*n]!=dBoundBox[2*n+1])
++m_Dimension;
}
return false;
}
bool CSPrimMultiBox::IsInside(const double* Coord, double /*tol*/)
{
if (Coord==NULL) return false;
bool in=false;
double UpVal,DownVal;
double coords[3]={Coord[0],Coord[1],Coord[2]};
TransformCoords(coords, true, m_MeshType);
//fprintf(stderr,"here\n");
for (unsigned int i=0;i<vCoords.size()/6;++i)
{
in=true;
for (unsigned int n=0;n<3;++n)
{
//fprintf(stderr,"%e %e %e \n",vCoords.at(6*i+2*n)->GetValue(),vCoords.at(6*i+2*n+1)->GetValue());
UpVal=vCoords.at(6*i+2*n+1)->GetValue();
DownVal=vCoords.at(6*i+2*n)->GetValue();
if (DownVal<UpVal)
{
if (DownVal>coords[n]) {in=false;break;}
if (UpVal<coords[n]) {in=false;break;}
}
else
{
if (DownVal<coords[n]) {in=false;break;}
if (UpVal>coords[n]) {in=false;break;}
}
}
if (in==true) { return true;}
}
return false;
}
bool CSPrimMultiBox::Update(std::string *ErrStr)
{
int EC=0;
bool bOK=true;
for (size_t i=0;i<vCoords.size();++i)
{
EC=vCoords.at(i)->Evaluate();
if (EC!=ParameterScalar::NO_ERROR) bOK=false;
if ((EC!=0) && (ErrStr!=NULL))
{
bOK=false;
std::stringstream stream;
stream << std::endl << "Error in MultiBox (ID: " << uiID << "): ";
ErrStr->append(stream.str());
PSErrorCode2Msg(EC,ErrStr);
}
}
//update local bounding box
m_BoundBoxValid = GetBoundBox(m_BoundBox);
return bOK;
}
bool CSPrimMultiBox::Write2XML(TiXmlElement &elem, bool parameterised)
{
CSPrimitives::Write2XML(elem,parameterised);
elem.SetAttribute("QtyBox",(int)vCoords.size()/6);
for (size_t i=0;i<vCoords.size()/6;++i)
{
TiXmlElement SP("StartP");
WriteTerm(*vCoords.at(i*6),SP,"X",parameterised);
WriteTerm(*vCoords.at(i*6+2),SP,"Y",parameterised);
WriteTerm(*vCoords.at(i*6+4),SP,"Z",parameterised);
elem.InsertEndChild(SP);
TiXmlElement EP("EndP");
WriteTerm(*vCoords.at(i*6+1),EP,"X",parameterised);
WriteTerm(*vCoords.at(i*6+3),EP,"Y",parameterised);
WriteTerm(*vCoords.at(i*6+5),EP,"Z",parameterised);
elem.InsertEndChild(EP);
}
return true;
}
bool CSPrimMultiBox::ReadFromXML(TiXmlNode &root)
{
if (CSPrimitives::ReadFromXML(root)==false) return false;;
TiXmlElement *SP=root.FirstChildElement("StartP");
TiXmlElement *EP=root.FirstChildElement("EndP");
if (vCoords.size()!=0) return false;
int i=0;
while ((SP!=NULL) && (EP!=NULL))
{
for (int n=0;n<6;++n) this->AddCoord(0.0);
if (ReadTerm(*vCoords.at(i*6),*SP,"X")==false) return false;
if (ReadTerm(*vCoords.at(i*6+2),*SP,"Y")==false) return false;
if (ReadTerm(*vCoords.at(i*6+4),*SP,"Z")==false) return false;
if (ReadTerm(*vCoords.at(i*6+1),*EP,"X")==false) return false;
if (ReadTerm(*vCoords.at(i*6+3),*EP,"Y")==false) return false;
if (ReadTerm(*vCoords.at(i*6+5),*EP,"Z")==false) return false;
// for (int n=0;n<6;++n) fprintf(stderr,"%e ",vCoords.at(i*6+n)->GetValue());
// fprintf(stderr,"\n");
SP=SP->NextSiblingElement("StartP");
EP=EP->NextSiblingElement("EndP");
++i;
};
return true;
}
|
