File size: 7,291 Bytes
5a600cf | 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 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-2018 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM 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 General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
\*---------------------------------------------------------------------------*/
#include "surfaceIntersection.H"
#include "triSurfaceSearch.H"
#include "labelPairLookup.H"
#include "OFstream.H"
#include "HashSet.H"
#include "triSurface.H"
#include "pointIndexHit.H"
#include "meshTools.H"
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
void Foam::surfaceIntersection::writeOBJ(const point& pt, Ostream& os)
{
os << "v " << pt.x() << ' ' << pt.y() << ' ' << pt.z() << endl;
}
void Foam::surfaceIntersection::writeOBJ
(
const List<point>& pts,
const List<edge>& edges,
Ostream& os
)
{
forAll(pts, i)
{
writeOBJ(pts[i], os);
}
forAll(edges, i)
{
const edge& e = edges[i];
os << "l " << e.start()+1 << ' ' << e.end()+1 << endl;
}
}
// Get minimum length of all edges connected to point
Foam::scalar Foam::surfaceIntersection::minEdgeLen
(
const triSurface& surf,
const label pointi
)
{
const labelList& pEdges = surf.pointEdges()[pointi];
scalar minLen = great;
forAll(pEdges, pEdgeI)
{
const edge& e = surf.edges()[pEdges[pEdgeI]];
minLen = min(minLen, e.mag(surf.localPoints()));
}
return minLen;
}
// Get edge between fp and fp+1 on facei.
Foam::label Foam::surfaceIntersection::getEdge
(
const triSurface& surf,
const label facei,
const label fp
)
{
const edge faceEdge = surf.localFaces()[facei].faceEdge(fp);
const labelList& eLabels = surf.faceEdges()[facei];
forAll(eLabels, eI)
{
const label edgeI = eLabels[eI];
if (surf.edges()[edgeI] == faceEdge)
{
return edgeI;
}
}
FatalErrorInFunction
<< "Problem:: Cannot find edge with vertices " << faceEdge
<< " in face " << facei
<< abort(FatalError);
return -1;
}
// Given a map remove all consecutive duplicate elements.
void Foam::surfaceIntersection::removeDuplicates
(
const labelList& map,
labelList& elems
)
{
bool hasDuplicate = false;
label prevVertI = -1;
forAll(elems, elemI)
{
label newVertI = map[elems[elemI]];
if (newVertI == prevVertI)
{
hasDuplicate = true;
break;
}
prevVertI = newVertI;
}
if (hasDuplicate)
{
// Create copy
labelList oldElems(elems);
label elemI = 0;
// Insert first
elems[elemI++] = map[oldElems[0]];
for (label vertI = 1; vertI < oldElems.size(); vertI++)
{
// Insert others only if they differ from one before
label newVertI = map[oldElems[vertI]];
if (newVertI != elems.last())
{
elems[elemI++] = newVertI;
}
}
elems.setSize(elemI);
}
}
// Remap.
void Foam::surfaceIntersection::inlineRemap
(
const labelList& map,
labelList& elems
)
{
forAll(elems, elemI)
{
elems[elemI] = map[elems[elemI]];
}
}
// Remove all duplicate and degenerate elements. Return unique elements and
// map from old to new.
Foam::edgeList Foam::surfaceIntersection::filterEdges
(
const edgeList& edges,
labelList& map
)
{
HashSet<edge, Hash<edge>> uniqueEdges(10*edges.size());
edgeList newEdges(edges.size());
map.setSize(edges.size());
map = -1;
label newEdgeI = 0;
forAll(edges, edgeI)
{
const edge& e = edges[edgeI];
if
(
(e.start() != e.end())
&& (uniqueEdges.find(e) == uniqueEdges.end())
)
{
// Edge is -non degenerate and -not yet seen.
uniqueEdges.insert(e);
map[edgeI] = newEdgeI;
newEdges[newEdgeI++] = e;
}
}
newEdges.setSize(newEdgeI);
return newEdges;
}
// Remove all duplicate elements.
Foam::labelList Foam::surfaceIntersection::filterLabels
(
const labelList& elems,
labelList& map
)
{
labelHashSet uniqueElems(10*elems.size());
labelList newElems(elems.size());
map.setSize(elems.size());
map = -1;
label newElemI = 0;
forAll(elems, elemI)
{
label elem = elems[elemI];
if (uniqueElems.find(elem) == uniqueElems.end())
{
// First time elem is seen
uniqueElems.insert(elem);
map[elemI] = newElemI;
newElems[newElemI++] = elem;
}
}
newElems.setSize(newElemI);
return newElems;
}
void Foam::surfaceIntersection::writeIntersectedEdges
(
const triSurface& surf,
const labelListList& edgeCutVerts,
Ostream& os
) const
{
// Dump all points (surface followed by cutPoints)
const pointField& pts = surf.localPoints();
forAll(pts, pointi)
{
writeOBJ(pts[pointi], os);
}
forAll(cutPoints(), cutPointi)
{
writeOBJ(cutPoints()[cutPointi], os);
}
forAll(edgeCutVerts, edgeI)
{
const labelList& extraVerts = edgeCutVerts[edgeI];
if (extraVerts.size())
{
const edge& e = surf.edges()[edgeI];
// Start of original edge to first extra point
os << "l " << e.start()+1 << ' '
<< extraVerts[0] + surf.nPoints() + 1 << endl;
for (label i = 1; i < extraVerts.size(); i++)
{
os << "l " << extraVerts[i-1] + surf.nPoints() + 1 << ' '
<< extraVerts[i] + surf.nPoints() + 1 << endl;
}
os << "l " << extraVerts.last() + surf.nPoints() + 1
<< ' ' << e.end()+1 << endl;
}
}
}
// Return 0 (p close to start), 1(close to end) or -1.
Foam::label Foam::surfaceIntersection::classify
(
const scalar startTol,
const scalar endTol,
const point& p,
const edge& e,
const pointField& points
)
{
if (mag(p - points[e.start()]) < startTol)
{
return 0;
}
else if (mag(p - points[e.end()]) < endTol)
{
return 1;
}
else
{
return -1;
}
}
// ************************************************************************* //
|