- The bitSet class replaces the old PackedBoolList class. The redesign provides better block-wise access and reduced method calls. This helps both in cases where the bitSet may be relatively sparse, and in cases where advantage of contiguous operations can be made. This makes it easier to work with a bitSet as top-level object. In addition to the previously available count() method to determine if a bitSet is being used, now have simpler queries: - all() - true if all bits in the addressable range are empty - any() - true if any bits are set at all. - none() - true if no bits are set. These are faster than count() and allow early termination. The new test() method tests the value of a single bit position and returns a bool without any ambiguity caused by the return type (like the get() method), nor the const/non-const access (like operator[] has). The name corresponds to what std::bitset uses. The new find_first(), find_last(), find_next() methods provide a faster means of searching for bits that are set. This can be especially useful when using a bitSet to control an conditional: OLD (with macro): forAll(selected, celli) { if (selected[celli]) { sumVol += mesh_.cellVolumes()[celli]; } } NEW (with const_iterator): for (const label celli : selected) { sumVol += mesh_.cellVolumes()[celli]; } or manually for ( label celli = selected.find_first(); celli != -1; celli = selected.find_next() ) { sumVol += mesh_.cellVolumes()[celli]; } - When marking up contiguous parts of a bitset, an interval can be represented more efficiently as a labelRange of start/size. For example, OLD: if (isA<processorPolyPatch>(pp)) { forAll(pp, i) { ignoreFaces.set(i); } } NEW: if (isA<processorPolyPatch>(pp)) { ignoreFaces.set(pp.range()); }
239 lines
6.3 KiB
C
239 lines
6.3 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 2011-2016 OpenFOAM Foundation
|
|
\\/ M anipulation | Copyright (C) 2015 OpenCFD Ltd.
|
|
-------------------------------------------------------------------------------
|
|
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/>.
|
|
|
|
Application
|
|
surfaceLambdaMuSmooth
|
|
|
|
Group
|
|
grpSurfaceUtilities
|
|
|
|
Description
|
|
Smooths a surface using lambda/mu smoothing.
|
|
|
|
To get laplacian smoothing, set lambda to the relaxation factor and mu to
|
|
zero.
|
|
|
|
Provide an edgeMesh file containing points that are not to be moved during
|
|
smoothing in order to preserve features.
|
|
|
|
lambda/mu smoothing: G. Taubin, IBM Research report Rc-19923 (02/01/95)
|
|
"A signal processing approach to fair surface design"
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "argList.H"
|
|
#include "boundBox.H"
|
|
#include "edgeMesh.H"
|
|
#include "matchPoints.H"
|
|
#include "MeshedSurfaces.H"
|
|
|
|
using namespace Foam;
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
tmp<pointField> avg
|
|
(
|
|
const meshedSurface& s,
|
|
const bitSet& fixedPoints
|
|
)
|
|
{
|
|
const labelListList& pointEdges = s.pointEdges();
|
|
|
|
tmp<pointField> tavg(new pointField(s.nPoints(), Zero));
|
|
pointField& avg = tavg.ref();
|
|
|
|
forAll(pointEdges, vertI)
|
|
{
|
|
vector& avgPos = avg[vertI];
|
|
|
|
if (fixedPoints.test(vertI))
|
|
{
|
|
avgPos = s.localPoints()[vertI];
|
|
}
|
|
else
|
|
{
|
|
const labelList& pEdges = pointEdges[vertI];
|
|
|
|
forAll(pEdges, myEdgeI)
|
|
{
|
|
const edge& e = s.edges()[pEdges[myEdgeI]];
|
|
|
|
label otherVertI = e.otherVertex(vertI);
|
|
|
|
avgPos += s.localPoints()[otherVertI];
|
|
}
|
|
|
|
avgPos /= pEdges.size();
|
|
}
|
|
}
|
|
|
|
return tavg;
|
|
}
|
|
|
|
|
|
void getFixedPoints
|
|
(
|
|
const edgeMesh& feMesh,
|
|
const pointField& points,
|
|
bitSet& fixedPoints
|
|
)
|
|
{
|
|
scalarList matchDistance(feMesh.points().size(), 1e-1);
|
|
labelList from0To1;
|
|
|
|
bool matchedAll = matchPoints
|
|
(
|
|
feMesh.points(),
|
|
points,
|
|
matchDistance,
|
|
false,
|
|
from0To1
|
|
);
|
|
|
|
if (!matchedAll)
|
|
{
|
|
WarningInFunction
|
|
<< "Did not match all feature points to points on the surface"
|
|
<< endl;
|
|
}
|
|
|
|
forAll(from0To1, fpI)
|
|
{
|
|
if (from0To1[fpI] != -1)
|
|
{
|
|
fixedPoints.set(from0To1[fpI]);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
// Main program:
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
argList::noParallel();
|
|
argList::validOptions.clear();
|
|
argList::addArgument("surfaceFile");
|
|
argList::addArgument("lambda (0..1)");
|
|
argList::addArgument("mu (0..1)");
|
|
argList::addArgument("iterations");
|
|
argList::addArgument("output surfaceFile");
|
|
argList::addOption
|
|
(
|
|
"featureFile",
|
|
"fix points from a file containing feature points and edges"
|
|
);
|
|
argList args(argc, argv);
|
|
|
|
const fileName surfFileName = args[1];
|
|
const scalar lambda = args.read<scalar>(2);
|
|
const scalar mu = args.read<scalar>(3);
|
|
const label iters = args.read<label>(4);
|
|
const fileName outFileName = args[5];
|
|
|
|
if (lambda < 0 || lambda > 1)
|
|
{
|
|
FatalErrorInFunction
|
|
<< lambda << endl
|
|
<< "0: no change 1: move vertices to average of neighbours"
|
|
<< exit(FatalError);
|
|
}
|
|
if (mu < 0 || mu > 1)
|
|
{
|
|
FatalErrorInFunction
|
|
<< mu << endl
|
|
<< "0: no change 1: move vertices to average of neighbours"
|
|
<< exit(FatalError);
|
|
}
|
|
|
|
Info<< "lambda : " << lambda << nl
|
|
<< "mu : " << mu << nl
|
|
<< "Iters : " << iters << nl
|
|
<< "Reading surface from " << surfFileName << " ..." << endl;
|
|
|
|
meshedSurface surf1(surfFileName);
|
|
|
|
Info<< "Faces : " << surf1.size() << nl
|
|
<< "Vertices : " << surf1.nPoints() << nl
|
|
<< "Bounding Box: " << boundBox(surf1.localPoints()) << endl;
|
|
|
|
bitSet fixedPoints(surf1.localPoints().size(), false);
|
|
|
|
if (args.found("featureFile"))
|
|
{
|
|
const fileName featureFileName(args["featureFile"]);
|
|
Info<< "Reading features from " << featureFileName << " ..." << endl;
|
|
|
|
edgeMesh feMesh(featureFileName);
|
|
|
|
getFixedPoints(feMesh, surf1.localPoints(), fixedPoints);
|
|
|
|
Info<< "Number of fixed points on surface = " << fixedPoints.count()
|
|
<< endl;
|
|
}
|
|
|
|
for (label iter = 0; iter < iters; iter++)
|
|
{
|
|
// Lambda
|
|
{
|
|
pointField newLocalPoints
|
|
(
|
|
(1 - lambda)*surf1.localPoints()
|
|
+ lambda*avg(surf1, fixedPoints)
|
|
);
|
|
|
|
pointField newPoints(surf1.points());
|
|
UIndirectList<point>(newPoints, surf1.meshPoints()) =
|
|
newLocalPoints;
|
|
|
|
surf1.movePoints(newPoints);
|
|
}
|
|
|
|
// Mu
|
|
if (mu != 0)
|
|
{
|
|
pointField newLocalPoints
|
|
(
|
|
(1 + mu)*surf1.localPoints()
|
|
- mu*avg(surf1, fixedPoints)
|
|
);
|
|
|
|
pointField newPoints(surf1.points());
|
|
UIndirectList<point>(newPoints, surf1.meshPoints()) =
|
|
newLocalPoints;
|
|
|
|
surf1.movePoints(newPoints);
|
|
}
|
|
}
|
|
|
|
Info<< "Writing surface to " << outFileName << " ..." << endl;
|
|
surf1.write(outFileName);
|
|
|
|
Info<< "End\n" << endl;
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|