diff --git a/applications/test/findCell-octree/Test-findCell-octree.C b/applications/test/findCell-octree/Test-findCell-octree.C
index 22772a874661cd0a93f59f8e65878b652503661b..e9bbb1fe5fb6957e001abead87ff63480ea27006 100644
--- a/applications/test/findCell-octree/Test-findCell-octree.C
+++ b/applications/test/findCell-octree/Test-findCell-octree.C
@@ -27,8 +27,6 @@ License
#include "Time.H"
#include "fvMesh.H"
#include "IStringStream.H"
-#include "octree.H"
-#include "octreeDataCell.H"
#include "indexedOctree.H"
#include "treeDataCell.H"
#include "OFstream.H"
@@ -46,10 +44,14 @@ int main(int argc, char *argv[])
# include "createTime.H"
# include "createMesh.H"
- label nReps = 100000;
+ //label nReps = 100000;
+ label nReps = 10000;
const point sample = args.argRead<point>(1);
+ //const polyMesh::cellRepresentation decompMode = polyMesh::FACEPLANES;
+ const polyMesh::cellRepresentation decompMode = polyMesh::FACEDIAGTETS;
+
treeBoundBox meshBb(mesh.bounds());
// Calculate typical cell related size to shift bb by.
@@ -69,65 +71,52 @@ int main(int argc, char *argv[])
Info<< "Initialised mesh in "
<< runTime.cpuTimeIncrement() << " s" << endl;
- // Wrap indices and mesh information into helper object
- octreeDataCell shapes(mesh);
-
- octree<octreeDataCell> oc
- (
- shiftedBb, // overall bounding box
- shapes, // all information needed to do checks on cells
- 1, // min. levels
- 10.0, // max. size of leaves
- 10.0 // maximum ratio of cubes v.s. cells
- );
-
- for (label i = 0; i < nReps - 1 ; i++)
{
- oc.find(sample);
+ indexedOctree<treeDataCell> ioc
+ (
+ treeDataCell(true, mesh, decompMode), //FACEDIAGTETS),
+ shiftedBb,
+ 10, // maxLevel
+ 100, // leafsize
+ 10.0 // duplicity
+ );
+
+ for (label i = 0; i < nReps - 1 ; i++)
+ {
+ if ((i % 100) == 0)
+ {
+ Info<< "indexed octree for " << i << endl;
+ }
+ ioc.findInside(sample);
+ }
+
+ Info<< "Point:" << sample << " is in shape "
+ << ioc.findInside(sample)
+ << ", where the possible cells were:" << nl
+ << ioc.findIndices(sample)
+ << endl;
+
+ Info<< "Found in indexedOctree " << nReps << " times in "
+ << runTime.cpuTimeIncrement() << " s" << endl;
}
- Info<< "Point:" << sample << " is in shape "
- << oc.find(sample) << endl;
-
- oc.printStats(Info);
-
- Info<< "Found in octree " << nReps << " times in "
- << runTime.cpuTimeIncrement() << " s" << endl;
-
- indexedOctree<treeDataCell> ioc
- (
- treeDataCell(true, mesh),
- shiftedBb,
- 8, // maxLevel
- 10, // leafsize
- 3.0 // duplicity
- );
-
- for (label i = 0; i < nReps - 1 ; i++)
- {
- ioc.findInside(sample);
- }
-
- Info<< "Point:" << sample << " is in shape "
- << ioc.findInside(sample)
- << ", where the possible cells were:" << nl
- << ioc.findIndices(sample)
- << endl;
-
- Info<< "Found in indexedOctree " << nReps << " times in "
- << runTime.cpuTimeIncrement() << " s" << endl;
-
- for (label i = 0; i < nReps - 1 ; i++)
{
- mesh.findCell(sample);
+ for (label i = 0; i < nReps - 1 ; i++)
+ {
+ if ((i % 100) == 0)
+ {
+ Info<< "linear search for " << i << endl;
+ }
+ mesh.findCell(sample, decompMode);
+ }
+
+ Info<< "Point:" << sample << " is in cell "
+ << mesh.findCell(sample, decompMode) << endl;
+
+ Info<< "Found in mesh.findCell " << nReps << " times in "
+ << runTime.cpuTimeIncrement() << " s" << endl;
}
- Info<< "Point:" << sample << " is in cell "
- << mesh.findCell(sample) << endl;
-
- Info<< "Found in mesh.findCell " << nReps << " times in "
- << runTime.cpuTimeIncrement() << " s" << endl;
-
Info<< "End\n" << endl;
return 0;
diff --git a/etc/controlDict b/etc/controlDict
index 7a14e9036c0c1e10af492423710bf0cf488fdbf0..693a3f4dd21f78a40dacf61cf4fb81f42c636fba 100644
--- a/etc/controlDict
+++ b/etc/controlDict
@@ -656,11 +656,6 @@ DebugSwitches
nutWallFunction 0;
obj 0;
objectRegistry 0;
- octree 0;
- octreeDataEdges 0;
- octreeDataFace 0;
- octreeDataFaceList 0;
- octreeDataTriSurface 0;
off 0;
omegaWallFunction 0;
oneEqEddy 0;
diff --git a/src/meshTools/Make/files b/src/meshTools/Make/files
index 5623d2affe720f0bc74d25002507a4e4e552aca4..4ba28fce083d113984e577fe7afa0762c28732c8 100644
--- a/src/meshTools/Make/files
+++ b/src/meshTools/Make/files
@@ -40,15 +40,6 @@ $(patchWave)/patchEdgeFaceInfo.C
regionSplit/regionSplit.C
-octree/octreeName.C
-octree/octreeDataPoint.C
-octree/octreeDataPointTreeLeaf.C
-octree/octreeDataEdges.C
-octree/octreeDataCell.C
-octree/octreeDataFace.C
-octree/treeNodeName.C
-octree/treeLeafName.C
-
indexedOctree/treeDataEdge.C
indexedOctree/treeDataFace.C
indexedOctree/treeDataPoint.C
@@ -153,8 +144,6 @@ $(intersectedSurface)/intersectedSurface.C
$(intersectedSurface)/edgeSurface.C
triSurface/triSurfaceSearch/triSurfaceSearch.C
-triSurface/octreeData/octreeDataTriSurface.C
-triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.C
triSurface/triangleFuncs/triangleFuncs.C
triSurface/surfaceFeatures/surfaceFeatures.C
triSurface/triSurfaceTools/triSurfaceTools.C
diff --git a/src/meshTools/octree/octree.C b/src/meshTools/octree/octree.C
deleted file mode 100644
index 304931979faafc3ff80d03a108c10ccd36c03eff..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octree.C
+++ /dev/null
@@ -1,925 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octree.H"
-#include "treeLeaf.H"
-#include "treeNode.H"
-#include "long.H"
-#include "cpuTime.H"
-#include "linePointRef.H"
-#include "pointIndexHit.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::string Foam::octree<Type>::volType(const label type)
-{
- if (type == UNKNOWN)
- {
- return "unknown";
- }
- else if (type == MIXED)
- {
- return "mixed";
- }
- else if (type == INSIDE)
- {
- return "inside";
- }
- else if (type == OUTSIDE)
- {
- return "outside";
- }
- else
- {
- FatalErrorIn("volType(const label)") << "type:" << type
- << " unknown." << abort(FatalError);
-
- return "dummy";
- }
-}
-
-
-// Determine inside/outside status of vector compared to geometry-based normal
-template <class Type>
-Foam::label Foam::octree<Type>::getVolType
-(
- const vector& geomNormal,
- const vector& vec
-)
-{
- scalar sign = geomNormal & vec;
-
- if (sign >= 0)
- {
- return octree<Type>::OUTSIDE;
- }
- else
- {
- return octree<Type>::INSIDE;
- }
-}
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::octree<Type>::octree
-(
- const treeBoundBox& octreeBb,
- const Type& shapes,
- const label minNLevels,
- const scalar maxLeafRatio,
- const scalar maxShapeRatio
-)
-:
- topNode_(new treeNode<Type>(octreeBb)),
- shapes_(shapes),
- octreeBb_(octreeBb),
- maxLeafRatio_(maxLeafRatio),
- maxShapeRatio_(maxShapeRatio),
- minNLevels_(minNLevels),
- deepestLevel_(0),
- nEntries_(0),
- nNodes_(0),
- nLeaves_(0),
- endIter_(*this, -1),
- endConstIter_(*this, -1)
-{
- cpuTime timer;
-
- setNodes(nNodes() + 1);
-
- const label nShapes = shapes_.size();
-
- labelList indices(nShapes);
- for (label i = 0; i < nShapes; i++)
- {
- indices[i] = i;
- }
-
- // Create initial level (0) of subLeaves
- if (debug & 1)
- {
- Pout<< "octree : --- Start of Level " << deepestLevel_
- << " ----" << endl;
- }
- topNode_->distribute(0, *this, shapes_, indices);
-
- if (debug & 1)
- {
- printStats(Pout);
- Pout<< "octree : --- End of Level " << deepestLevel_
- << " ----" << endl;
- }
-
- // Breadth first creation of tree
- // Stop if: - level above minlevel and
- // - less than so many cells per endpoint
- // (so bottom level is fine enough)
- // - every shape mentioned in only so many
- // leaves. (if shape bb quite big it will end up
- // in lots of leaves).
- // - no change in number of leaves
- // (happens if leafs fine enough)
- // This guarantees that tree
- // - is fine enough (if minLevel > 0)
- // - has some guaranteed maximum size (maxShapeRatio)
-
- label oldNLeaves = -1; // make test below pass first time.
- label oldNNodes = -1;
- deepestLevel_ = 1;
- while
- (
- (deepestLevel_ <= minNLevels_)
- || (
- (nEntries() > maxLeafRatio * nLeaves()) // shapes per leaf
- && (nEntries() < maxShapeRatio * nShapes) // entries per shape
- )
- )
- {
- if (deepestLevel_ >= maxNLevels)
- {
- if (debug & 1)
- {
- Pout<< "octree : exiting since maxNLevels "
- << maxNLevels << " reached" << endl;
- }
- break;
- }
-
- if ((oldNLeaves == nLeaves()) && (oldNNodes == nNodes()))
- {
- if (debug & 1)
- {
- Pout<< "octree : exiting since nLeaves and nNodes do not change"
- << endl;
- }
- break;
- }
- if (debug & 1)
- {
- Pout<< "octree : --- Start of Level " << deepestLevel_
- << " ----" << endl;
- }
-
- oldNLeaves = nLeaves();
- oldNNodes = nNodes();
-
- topNode_->redistribute
- (
- 1,
- *this,
- shapes_,
- deepestLevel_
- );
-
- if (debug & 1)
- {
- printStats(Pout);
-
- Pout<< "octree : --- End of Level " << deepestLevel_
- << " ----" << endl;
- }
-
- deepestLevel_++;
- }
-
-
- if (debug & 1)
- {
- Pout<< "octree : Constructed octree in = "
- << timer.cpuTimeIncrement()
- << " s\n" << endl << endl;
- }
-
- // Set volume type of non-treeleaf nodes.
- topNode_->setSubNodeType(0, *this, shapes_);
-
- if (debug & 1)
- {
- Pout<< "octree : Added node information to octree in = "
- << timer.cpuTimeIncrement()
- << " s\n" << endl << endl;
- }
-}
-
-
-// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::octree<Type>::~octree()
-{
- delete topNode_;
-}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::label Foam::octree<Type>::getSampleType(const point& sample) const
-{
- return topNode_->getSampleType(0, *this, shapes_, sample);
-}
-
-
-template <class Type>
-Foam::label Foam::octree<Type>::find(const point& sample) const
-{
- return topNode_->find(shapes_, sample);
-}
-
-
-template <class Type>
-bool Foam::octree<Type>::findTightest
-(
- const point& sample,
- treeBoundBox& tightest
-) const
-{
- return topNode_->findTightest
- (
- shapes_,
- sample,
- tightest
- );
-}
-
-
-template <class Type>
-Foam::label Foam::octree<Type>::findNearest
-(
- const point& sample,
- treeBoundBox& tightest,
- scalar& tightestDist
-) const
-{
- label tightestI = -1;
-
- if (debug & 4)
- {
- Pout<< "octree::findNearest : searching for nearest for "
- << "sample:" << sample
- << " tightest:" << tightest << endl;
- }
-
- topNode_->findNearest
- (
- shapes_,
- sample,
- tightest,
- tightestI,
- tightestDist
- );
-
- if (debug & 4)
- {
- Pout<< "octree::findNearest : found nearest for "
- << "sample:" << sample << " with "
- << " tightestI:" << tightestI
- << " tightest:" << tightest
- << " tightestDist:" << tightestDist
- << endl;
- }
-
- return tightestI;
-}
-
-
-template <class Type>
-Foam::label Foam::octree<Type>::findNearest
-(
- const linePointRef& ln,
- treeBoundBox& tightest,
- point& linePoint,
- point& shapePoint
-) const
-{
- // Start off from miss with points at large distance apart.
- label tightestI = -1;
- linePoint = point(-GREAT, -GREAT, -GREAT);
- shapePoint = point(GREAT, GREAT, GREAT);
-
- topNode_->findNearest
- (
- shapes_,
- ln,
- tightest,
- tightestI,
- linePoint,
- shapePoint
- );
-
- return tightestI;
-}
-
-
-template <class Type>
-Foam::labelList Foam::octree<Type>::findBox(const boundBox& bb) const
-{
- // Storage for labels of shapes inside bb. Size estimate.
- labelHashSet elements(100);
-
- topNode_->findBox(shapes_, bb, elements);
-
- return elements.toc();
-}
-
-
-template <class Type>
-Foam::pointIndexHit Foam::octree<Type>::findLine
-(
- const point& treeStart,
- const point& treeEnd
-) const
-{
- // Initialize to a miss
- pointIndexHit hitInfo(false, treeStart, -1);
-
- const vector dir(treeEnd - treeStart);
-
- // Current line segment to search
- point start(treeStart);
- point end(treeEnd);
-
- while (true)
- {
- // Find nearest treeLeaf intersected by line
- point leafIntPoint;
-
- const treeLeaf<Type>* leafPtr = findLeafLine
- (
- start,
- end,
- leafIntPoint
- );
-
- if (!leafPtr)
- {
- // Reached end of string of treeLeaves to be searched. Return
- // whatever we have found so far.
- break;
- }
-
- // Inside treeLeaf find nearest intersection
- scalar minS = GREAT;
-
- const labelList& indices = leafPtr->indices();
-
- forAll(indices, elemI)
- {
- label index = indices[elemI];
-
- point pt;
- bool hit = shapes().intersects(index, start, end, pt);
-
- if (hit)
- {
- // Check whether intersection nearer p
- scalar s = (pt - treeStart) & dir;
-
- if (s < minS)
- {
- minS = s;
-
- // Update hit info
- hitInfo.setHit();
- hitInfo.setPoint(pt);
- hitInfo.setIndex(index);
-
- // Update segment to search
- end = pt;
- }
- }
- }
-
- if (hitInfo.hit())
- {
- // Found intersected shape.
- break;
- }
-
- // Start from end of current leaf
- start = leafIntPoint;
- }
-
- return hitInfo;
-}
-
-
-template <class Type>
-Foam::pointIndexHit Foam::octree<Type>::findLineAny
-(
- const point& start,
- const point& end
-) const
-{
- // Initialize to a miss
- pointIndexHit hitInfo(false, start, -1);
-
- // Start of segment in current treeNode.
- point p(start);
- while (true)
- {
- // Find treeLeaf intersected by line
- point leafIntPoint;
-
- const treeLeaf<Type>* leafPtr = findLeafLine(p, end, leafIntPoint);
-
- if (!leafPtr)
- {
- // Reached end of string of treeLeaves to be searched. Return
- // whatever we have found so far.
- break;
- }
-
- // Inside treeLeaf find any intersection
-
- // Vector from endPoint to entry point of leaf.
- const vector edgeVec(end - p);
-
- const labelList& indices = leafPtr->indices();
-
- forAll(indices, elemI)
- {
- label index = indices[elemI];
-
- point pt;
- bool hit = shapes().intersects
- (
- index,
- p,
- end,
- pt
- );
-
- if (hit)
- {
- hitInfo.setHit();
- hitInfo.setPoint(pt);
- hitInfo.setIndex(index);
-
- break;
- }
- }
-
- if (hitInfo.hit())
- {
- // Found intersected shape.
- break;
- }
-
- // Start from end of current leaf
- p = leafIntPoint;
- }
-
- return hitInfo;
-}
-
-
-template <class Type>
-const Foam::treeLeaf<Type>* Foam::octree<Type>::findLeafLine
-(
- const point& start,
- const point& end,
- point& leafIntPoint
-) const
-{
- // returns first found cube along line
-
- if (debug & 2)
- {
- Pout<< "octree::findLeafLine : searching for shapes on line "
- << "start:" << start
- << " end:" << end << endl;
- }
-
- // If start is outside project onto top cube
- if (octreeBb_.contains(start))
- {
- leafIntPoint = start;
- }
- else
- {
- if (!octreeBb_.intersects(start, end, leafIntPoint))
- {
- if (debug & 2)
- {
- Pout<< "octree::findLeafLine : start outside domain but does"
- << " not intersect : start:"
- << start << endl;
- }
- return NULL;
- }
-
- if (debug & 2)
- {
- Pout<< "octree::findLeafLine : start propagated to inside"
- " domain : "
- << leafIntPoint << endl;
- }
- }
-
- // Normal action: find next intersection along line
- const treeLeaf<Type>* leafPtr = topNode_->findLeafLine
- (
- 0,
- shapes_,
- leafIntPoint,
- end
- );
-
- if (debug & 2)
- {
- Pout<< "returning from octree::findLeafLine with "
- << "leafIntersection:" << leafIntPoint
- << " leafPtr:" << long(leafPtr) << endl;
- }
-
- return leafPtr;
-}
-
-
-template <class Type>
-void Foam::octree<Type>::writeOBJ
-(
- Ostream& os,
- label& vertNo
-) const
-{
- scalar minx = octreeBb_.min().x();
- scalar miny = octreeBb_.min().y();
- scalar minz = octreeBb_.min().z();
-
- scalar maxx = octreeBb_.max().x();
- scalar maxy = octreeBb_.max().y();
- scalar maxz = octreeBb_.max().z();
-
- os << "v " << minx << " " << miny << " " << minz << endl;
- os << "v " << maxx << " " << miny << " " << minz << endl;
- os << "v " << maxx << " " << maxy << " " << minz << endl;
- os << "v " << minx << " " << maxy << " " << minz << endl;
-
- os << "v " << minx << " " << miny << " " << maxz << endl;
- os << "v " << maxx << " " << miny << " " << maxz << endl;
- os << "v " << maxx << " " << maxy << " " << maxz << endl;
- os << "v " << minx << " " << maxy << " " << maxz << endl;
-
- // Bottom face
- os << "l " << vertNo + 1 << " " << vertNo + 2 << endl;
- os << "l " << vertNo + 2 << " " << vertNo + 3 << endl;
- os << "l " << vertNo + 3 << " " << vertNo + 4 << endl;
- os << "l " << vertNo + 4 << " " << vertNo + 1 << endl;
-
- // Top face
- os << "l " << vertNo + 5 << " " << vertNo + 6 << endl;
- os << "l " << vertNo + 6 << " " << vertNo + 7 << endl;
- os << "l " << vertNo + 7 << " " << vertNo + 8 << endl;
- os << "l " << vertNo + 8 << " " << vertNo + 5 << endl;
-
- // Edges from bottom to top face
- os << "l " << vertNo + 1 << " " << vertNo + 5 << endl;
- os << "l " << vertNo + 2 << " " << vertNo + 6 << endl;
- os << "l " << vertNo + 3 << " " << vertNo + 7 << endl;
- os << "l " << vertNo + 4 << " " << vertNo + 8 << endl;
-
- vertNo += 8;
-
- topNode_->writeOBJ(os, 1, vertNo);
-}
-
-
-template <class Type>
-void Foam::octree<Type>::printStats(Ostream& os) const
-{
- os << "Statistics after iteration " << deepestLevel() << ':' << endl
- << " nShapes :" << shapes().size() << endl
- << " nNodes :" << nNodes() << endl
- << " nLeaves :" << nLeaves() << endl
- << " nEntries :" << nEntries() << endl;
-
- if (nLeaves() && shapes().size())
- {
- os
- << " Cells per leaf :"
- << scalar(nEntries())/nLeaves()
- << nl
- << " Every cell in :"
- << scalar(nEntries())/shapes().size() << " cubes"
- << endl;
- }
-}
-
-
-// * * * * * * * * * * * * * * * STL iterator * * * * * * * * * * * * * * * //
-
-// Construct from a octree. Set index at end.
-template <class Type>
-Foam::octree<Type>::iterator::iterator(octree<Type>& oc)
-:
- octree_(oc),
- curLeaf_(oc.nLeaves())
-{
- leaves_.setSize(0);
-}
-
-
-// Construct from octree. Set index.
-template <class Type>
-Foam::octree<Type>::iterator::iterator(octree<Type>& oc, label index)
-:
- octree_(oc),
- curLeaf_(index)
-{
- if (index >= 0)
- {
- leaves_.setSize(oc.nLeaves());
-
- label leafIndex = 0;
- octree_.topNode()->findLeaves(leaves_, leafIndex);
-
- if (leafIndex != oc.nLeaves())
- {
- FatalErrorIn
- (
- "octree::iterator::iterator"
- "(octree&, label)"
- )
- << "Traversal of tree returns : " << leafIndex << endl
- << "Statistics of octree say : " << oc.nLeaves() << endl
- << abort(FatalError);
- }
- }
-}
-
-
-template <class Type>
-void Foam::octree<Type>::iterator::operator=(const iterator& iter)
-{
- if ((curLeaf_ < 0) && (iter.curLeaf_ >= 0))
- {
- FatalErrorIn
- (
- "octree::iterator::operator="
- "(const iterator&)"
- )
- << "lhs : " << curLeaf_ << endl
- << "rhs : " << iter.curLeaf_ << endl
- << abort(FatalError);
- }
- curLeaf_ = iter.curLeaf_;
-}
-
-
-template <class Type>
-bool Foam::octree<Type>::iterator::operator==(const iterator& iter) const
-{
- label index1 =
- (curLeaf_ >= 0 ? curLeaf_ : octree_.nLeaves());
- label index2 =
- (iter.curLeaf_ >= 0 ? iter.curLeaf_ : iter.octree_.nLeaves());
-
- return index1 == index2;
-}
-
-
-template <class Type>
-bool Foam::octree<Type>::iterator::operator!=(const iterator& iter) const
-{
- return !(iterator::operator==(iter));
-}
-
-
-template <class Type>
-Foam::treeLeaf<Type>& Foam::octree<Type>::iterator::operator*()
-{
- return *leaves_[curLeaf_];
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::iterator&
-Foam::octree<Type>::iterator::operator++()
-{
- curLeaf_++;
- return *this;
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::iterator
-Foam::octree<Type>::iterator::operator++(int)
-{
- iterator tmp = *this;
- ++*this;
- return tmp;
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::iterator
-Foam::octree<Type>::begin()
-{
- return iterator(*this, 0);
-}
-
-
-template <class Type>
-const typename Foam::octree<Type>::iterator&
-Foam::octree<Type>::end()
-{
- return octree<Type>::endIter_;
-}
-
-
-// * * * * * * * * * * * * * * STL const_iterator * * * * * * * * * * * * * //
-
-// Construct for a given octree
-template <class Type>
-Foam::octree<Type>::const_iterator::const_iterator(const octree<Type>& oc)
-:
- octree_(oc),
- curLeaf_(oc.nLeaves())
-{
- leaves_.setSize(oc.nLeaves());
-}
-
-
-// Construct for a given octree
-template <class Type>
-Foam::octree<Type>::const_iterator::const_iterator
-(
- const octree<Type>& oc,
- label index
-)
-:
- octree_(oc),
- curLeaf_(index)
-{
- if (index >= 0)
- {
- leaves_.setSize(oc.nLeaves());
-
- label leafIndex = 0;
- octree_.topNode()->findLeaves(leaves_, leafIndex);
-
- if (leafIndex != oc.nLeaves())
- {
- FatalErrorIn
- (
- "octree::const_iterator::const_iterator"
- "(octree&, label)"
- )
- << "Traversal of tree returns : " << leafIndex << endl
- << "Statistics of octree say : " << oc.nLeaves() << endl
- << abort(FatalError);
- }
- }
-}
-
-
-template <class Type>
-void Foam::octree<Type>::const_iterator::operator=(const const_iterator& iter)
-{
- if ((curLeaf_ < 0) && (iter.curLeaf_ >= 0))
- {
- FatalErrorIn
- (
- "octree::const_iterator::operator="
- "(const const_iterator&)"
- )
- << "lhs : " << curLeaf_ << endl
- << "rhs : " << iter.curLeaf_ << endl
- << abort(FatalError);
- }
- curLeaf_ = iter.curLeaf_;
- curLeaf_ = iter.curLeaf_;
-}
-
-
-template <class Type>
-bool Foam::octree<Type>::const_iterator::operator==
-(
- const const_iterator& iter
-) const
-{
- label index1 =
- (curLeaf_ >= 0 ? curLeaf_ : octree_.nLeaves());
- label index2 =
- (iter.curLeaf_ >= 0 ? iter.curLeaf_ : iter.octree_.nLeaves());
-
- return index1 == index2;
-}
-
-
-template <class Type>
-bool Foam::octree<Type>::const_iterator::operator!=
-(
- const const_iterator& iter
-) const
-{
- return !(const_iterator::operator==(iter));
-}
-
-
-template <class Type>
-const Foam::treeLeaf<Type>& Foam::octree<Type>::const_iterator::operator*()
-{
- return *leaves_[curLeaf_];
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::const_iterator&
-Foam::octree<Type>::const_iterator::operator++()
-{
- curLeaf_++;
- return *this;
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::const_iterator
-Foam::octree<Type>::const_iterator::operator++(int)
-{
- const_iterator tmp = *this;
- ++*this;
- return tmp;
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::const_iterator
-Foam::octree<Type>::begin() const
-{
- return const_iterator(*this, 0);
-}
-
-
-template <class Type>
-typename Foam::octree<Type>::const_iterator
-Foam::octree<Type>::cbegin() const
-{
- return const_iterator(*this, 0);
-}
-
-
-template <class Type>
-const typename Foam::octree<Type>::const_iterator&
-Foam::octree<Type>::end() const
-{
- return octree<Type>::endConstIter_;
-}
-
-
-template <class Type>
-const typename Foam::octree<Type>::const_iterator&
-Foam::octree<Type>::cend() const
-{
- return octree<Type>::endConstIter_;
-}
-
-
-// * * * * * * * * * * * * * * * Friend Operators * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::Ostream& Foam::operator<<(Ostream& os, const octree<Type>& oc)
-{
- return os << token::BEGIN_LIST
- //<< token::SPACE << oc.shapes_
- << token::SPACE << oc.octreeBb_
- << token::SPACE << oc.maxLeafRatio_
- << token::SPACE << oc.maxShapeRatio_
- << token::SPACE << oc.minNLevels_
- << token::SPACE << oc.deepestLevel_
- << token::SPACE << oc.nEntries_
- << token::SPACE << oc.nNodes_
- << token::SPACE << oc.nLeaves_
- << token::SPACE << *oc.topNode_
- << token::SPACE << token::END_LIST;
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octree.H b/src/meshTools/octree/octree.H
deleted file mode 100644
index fb84fa2b54b7d95f90aea82c466eae6ac4fefb67..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octree.H
+++ /dev/null
@@ -1,498 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octree
-
-Description
- Octree, templated on type of shapes it refers to.
-
- Uses the octreeData class, which is a list of 1D, 2D or 3D shapes.
- Various implementations of octreeData which know about cell&meshes,
- patches&meshes and points.
-
- The octree can be used to
- - find the "nearest" shape to a point
- - find the shape which contains a point (only sensible for 3D shapes)
- - find intersections of line with shapes
-
- The tree consists of
- - treeNode : holds sub-treeNodes or treeLeaves
- - treeLeaf : is the one that actually holds data
-
- The data is stored purely as a list of indices into octreeData.
-
- The construction on the depth of the tree is:
- - one can specify a minimum depth
- (though the tree will never be refined if all leaves contain <=1
- shapes)
- - after the minimum depth two statistics are used to decide further
- refinement:
- - average number of entries per leaf (leafRatio). Since inside a
- leaf most algorithms are n or n^2 this value has to be small.
- - average number of leaves a shape is in. Because of bounding boxes,
- a single shape can be in multiple leaves. If the bbs are large
- compared to the leaf size this multiplicity can become extremely
- large and will become larger with more levels.
-
- Note: the octree gets constructed with an overall bounding box. If your
- mesh is regular it is a good idea to make this overall bb a bit wider than
- the bb of the shapes itself. Otherwise lots of shapes end up exactly on the
- edge of a bb and hence go into more than one subcube.
-
- E.g. octree of face centres of lid driven cavity.
-
- -# bb exact -> total 1457 leaves (every point in 7.1 leaves)
- -# bb.max incremented by 1% -> total 80 leaves
- (every point in exactly 1 leaf)
-
- \par Ideas for parallel implementation:
-
- The data inserted into the octree (the
- 'octreeData') has to be local to the processor. The data to be looked
- for (usually a sample point) can be global to the domain.
- The algorithm:
- - search for all my points
- - collect results which have to do with a processor patch
- - global sum all these. If 0 exit.
- - exchange data on all processor patches
- - start again
-
- So data transfers one processor per iteration. One could think of having
- an extra search mechanism one level above which does an initial search
- knowing the average shape of a processor distribution (square/cube for
- most decomposition methods) and can assign sample points to the (almost)
- correct processor at once.
-
-SourceFiles
- octree.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octree_H
-#define octree_H
-
-#include "treeBoundBoxList.H"
-#include "treeLeaf.H"
-#include "pointIndexHit.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-template<class Type> class treeNode;
-
-// Forward declaration of friend functions and operators
-
-template<class Type>
-Ostream& operator<<(Ostream&, const octree<Type>&);
-
-
-/*---------------------------------------------------------------------------*\
- Class octreeName Declaration
-\*---------------------------------------------------------------------------*/
-
-TemplateName(octree);
-
-
-
-/*---------------------------------------------------------------------------*\
- Class octree Declaration
-\*---------------------------------------------------------------------------*/
-
-template <class Type>
-class octree
-:
- public octreeName
-{
- // Private data
-
- //- Top treeNode. Modified by lower levels.
- treeNode<Type>* topNode_;
-
- //- all shapes
- const Type shapes_;
-
- //- Overall bb of octree
- const treeBoundBox octreeBb_;
-
- //- Refinement crit: size of leaves. Average number of entries per
- // leaf. Should be fine enough for efficient searching at lowest level.
- const scalar maxLeafRatio_;
-
- //- Refinement crit: multiplicity of entries (so in how many leaves
- // each shape is mentioned)
- const scalar maxShapeRatio_;
-
- //- Refinement crit: min no. of levels
- const label minNLevels_;
-
- //- Actual depth
- label deepestLevel_;
-
- //- Total number of (references to) shapes in octree
- // (shapes can be stored in more than one treeLeaf)
- label nEntries_;
-
- //- Total number of treeNodes
- label nNodes_;
-
- //- Total number of treeLeaves
- label nLeaves_;
-
-
- // Static data members
- //- Refinement crit: max number of level
- static const label maxNLevels = 20;
-
-
-
- // Private Member Functions
-
-public:
-
- // Data types
-
- //- volume types
- enum volumeType
- {
- UNKNOWN,
- MIXED,
- INSIDE,
- OUTSIDE
- };
-
-
- // Static data members
-
- //- for debugging:return printable representation of volumeType
- static string volType(const label);
-
- //- Code the vector with respect to the geometry. geomNormal guaranteed
- // to point outside.
- static label getVolType
- (
- const vector& geomNormal,
- const vector& vec
- );
-
- // Constructors
-
- //- Construct from components
- octree
- (
- const treeBoundBox& octreeBb,
- const Type& shapes,
- const label minNLevels, // minimum number of levels
- const scalar maxLeafRatio, // max avg. size of leaves
- const scalar maxShapeRatio // max avg. duplicity.
- );
-
-
- //- Destructor
- ~octree();
-
-
- // Member Functions
-
- // Access
-
- const Type& shapes() const
- {
- return shapes_;
- }
-
- const treeBoundBox& octreeBb() const
- {
- return octreeBb_;
- }
-
- scalar maxShapeRatio() const
- {
- return maxShapeRatio_;
- }
-
- scalar maxLeafRatio() const
- {
- return maxLeafRatio_;
- }
-
- label minNLevels() const
- {
- return minNLevels_;
- }
-
- // After construction: octree statistics
-
- treeNode<Type>* topNode() const
- {
- return topNode_;
- }
-
- label deepestLevel() const
- {
- return deepestLevel_;
- }
-
- label nEntries() const
- {
- return nEntries_;
- }
-
- label nNodes() const
- {
- return nNodes_;
- }
-
- label nLeaves() const
- {
- return nLeaves_;
- }
-
- void setEntries(const label n)
- {
- nEntries_ = n;
- }
-
- void setNodes(const label n)
- {
- nNodes_ = n;
- }
-
- void setLeaves(const label n)
- {
- nLeaves_ = n;
- }
-
- // Queries
-
- //- Returns type of sample with respect to nearest shape.
- // Meaning of type is determined by shapes.getSampleType().
- // Normally based on outwards pointing normal. For e.g.
- // octreeDataFace returns one of
- // inside : on other side of normal on nearest face
- // outside : on same side as normal on nearest face
- // unknown : not above nearest face; surface probably not
- // closed.
- // mixed : should never happen
- label getSampleType(const point& sample) const;
-
- //- Find shape containing point in tree
- // Returns -1 if not in found. Uses Type::contains.
- label find(const point& sample) const;
-
- //- Calculate tightest fitting bounding box. Uses
- // Type::findTightest.
- bool findTightest
- (
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Find nearest shape. Returns index of shape or -1 if not found.
- // tightestDist is both input and output. Uses Type::calcNearest.
- label findNearest
- (
- const point& sample,
- treeBoundBox& tightest,
- scalar& tightestDist
- ) const;
-
- //- Find nearest to line. Returns -1 or index of shape and
- // sets:
- // - tightest (is both input and output).
- // - linePoint : point on line (-GREAT,-GREAT,-GREAT if not found)
- // - shapePoint : point on shape (GREAT, GREAT, GREAT if not found)
- // Uses Type::calcNearest.
- label findNearest
- (
- const linePointRef& ln,
- treeBoundBox& tightest,
- point& linePoint,
- point& shapePoint
- ) const;
-
- //- Find (in no particular order) indices of all shapes inside or
- // overlapping bounding box (i.e. all shapes not outside box)
- labelList findBox(const boundBox& bb) const;
-
- //- Find intersected shape along line. pointIndexHit contains index
- // of nearest shape intersected and the intersection point. Uses
- // findLeafLine.
- pointIndexHit findLine(const point& start, const point& end) const;
-
- //- Like above but just tests whether line hits anything. So
- // returns first intersection found, not nessecarily nearest.
- pointIndexHit findLineAny(const point& start, const point& end)
- const;
-
- //- Find leaf along line. Set leafIntPoint to leave point of
- // treeLeaf.
- const treeLeaf<Type>* findLeafLine
- (
- const point& start,
- const point& end,
- point& leafIntPoint
- ) const;
-
-
- // Write
-
- //- Dump graphical representation in .obj format
- void writeOBJ(Ostream& os, label& vertNo) const;
-
- //- Print some stats on octree
- void printStats(Ostream& os) const;
-
-
- // STL iterator
-
- class iterator;
- friend class iterator;
-
- //- An STL iterator for octree
- class iterator
- {
- // Private data
-
- //- Reference to the octree this is an iterator for
- octree& octree_;
-
- //- List of pointers to treeLeaves
- List<treeLeaf<Type>*> leaves_;
-
- //- Current treeLeaf index
- label curLeaf_;
-
- public:
-
- //- Construct for a given octree
- iterator(octree&);
-
- //- Contruct for a given octree, at a certain position
- iterator(octree& oc, const label index);
-
-
- // Member operators
-
- void operator=(const iterator&);
-
- bool operator==(const iterator&) const;
- bool operator!=(const iterator&) const;
-
- treeLeaf<Type>& operator*();
-
- iterator& operator++();
- iterator operator++(int);
- };
-
- //- iterator set to the begining of the octree
- iterator begin();
-
- //- iterator set to beyond the end of the octree
- const iterator& end();
-
-
- // STL const_iterator
-
- class const_iterator;
- friend class const_iterator;
-
- //- An STL const_iterator for octree
- class const_iterator
- {
- // Private data
-
- //- Reference to the list this is an iterator for
- const octree& octree_;
-
- //- List of treeLeafs
- List<const treeLeaf<Type>*> leaves_;
-
- //- Current treeLeaf index
- label curLeaf_;
-
- public:
-
- //- Construct for a given octree
- const_iterator(const octree&);
-
- //- Construct for a given octree and index
- const_iterator(const octree&, label);
-
- // Member operators
-
- void operator=(const const_iterator&);
-
- bool operator==(const const_iterator&) const;
- bool operator!=(const const_iterator&) const;
-
- const treeLeaf<Type>& operator*();
-
- const_iterator& operator++();
- const_iterator operator++(int);
- };
-
-
- //- const_iterator set to the begining of the octree
- inline const_iterator begin() const;
- inline const_iterator cbegin() const;
-
- //- const_iterator set to beyond the end of the octree
- inline const const_iterator& end() const;
- inline const const_iterator& cend() const;
-
-
- // IOstream Operators
-
- friend Ostream& operator<< <Type>(Ostream&, const octree<Type>&);
-
-
-private:
-
- //- iterator returned by end()
- iterator endIter_;
-
- //- const_iterator returned by end()
- const_iterator endConstIter_;
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#ifdef NoRepository
-# include "octree.C"
-#endif
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataCell.C b/src/meshTools/octree/octreeDataCell.C
deleted file mode 100644
index 4dcc838a0e58b92ea8b2ce3cbbafec73f7373a86..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataCell.C
+++ /dev/null
@@ -1,237 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataCell.H"
-#include "polyMesh.H"
-#include "primitiveMesh.H"
-#include "treeNode.H"
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct from components
-Foam::octreeDataCell::octreeDataCell
-(
- const polyMesh& mesh,
- const labelList& cellLabels,
- const treeBoundBoxList& bbs
-)
-:
- mesh_(mesh),
- cellLabels_(cellLabels),
- bbs_(bbs)
-{}
-
-
-// Construct from mesh (assumes all cells)
-Foam::octreeDataCell::octreeDataCell
-(
- const polyMesh& mesh
-)
-:
- mesh_(mesh),
- cellLabels_(mesh_.nCells()),
- bbs_
- (
- mesh_.nCells(),
- treeBoundBox::invertedBox
- )
-{
- // Set one-one indexing
- for (label i=0; i < mesh_.nCells(); i++)
- {
- cellLabels_[i] = i;
- }
-
- const pointField& points = mesh_.points();
- const faceList& faces = mesh_.faces();
- const cellList& cells = mesh_.cells();
-
- forAll(cells, celli)
- {
- const labelList& facesi = cells[celli];
-
- forAll(facesi, facei)
- {
- const labelList& pointsi = faces[facesi[facei]];
-
- forAll(pointsi, pointi)
- {
- const point& p = points[pointsi[pointi]];
-
- bbs_[celli].min() = min(bbs_[celli].min(), p);
- bbs_[celli].max() = max(bbs_[celli].max(), p);
- }
- }
- }
-}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-Foam::label Foam::octreeDataCell::getSampleType
-(
- octree<octreeDataCell>&,
- const point&
-) const
-{
- return octree<octreeDataCell>::UNKNOWN;
-}
-
-
-bool Foam::octreeDataCell::overlaps
-(
- const label index,
- const treeBoundBox& cubeBb
-) const
-{
- return cubeBb.overlaps(bbs_[index]);
-}
-
-
-bool Foam::octreeDataCell::contains
-(
- const label index,
- const point& sample
-) const
-{
- return mesh_.pointInCell(sample, cellLabels_[index]);
-}
-
-
-bool Foam::octreeDataCell::intersects
-(
- const label,
- const point&,
- const point&,
- point&
-) const
-{
- //Hack: don't know what to do here.
-
- notImplemented
- (
- "octreeDataCell::intersects(const label, const point&,"
- "const point&, point&)"
- );
-
- return false;
-}
-
-
-bool Foam::octreeDataCell::findTightest
-(
- const label index,
- const point& sample,
- treeBoundBox& tightest
-) const
-{
-
- // get nearest and furthest away vertex
- point myNear, myFar;
- bbs_[index].calcExtremities(sample, myNear, myFar);
-
- const point dist = myFar - sample;
- scalar myFarDist = mag(dist);
-
- point tightestNear, tightestFar;
- tightest.calcExtremities(sample, tightestNear, tightestFar);
-
- scalar tightestFarDist = mag(tightestFar - sample);
-
- if (tightestFarDist < myFarDist)
- {
- // Keep current tightest.
- return false;
- }
- else
- {
- // Construct bb around sample and myFar
- const point dist2(fabs(dist.x()), fabs(dist.y()), fabs(dist.z()));
-
- tightest.min() = sample - dist2;
- tightest.max() = sample + dist2;
-
- return true;
- }
-}
-
-
-// Determine numerical value of sign of sample compared to shape at index
-Foam::scalar Foam::octreeDataCell::calcSign
-(
- const label,
- const point&,
- vector& n
-) const
-{
- n = vector::zero;
-
- return GREAT;
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataCell::calcNearest
-(
- const label index,
- const point& sample,
- point& nearest
-) const
-{
- nearest = mesh_.cellCentres()[cellLabels_[index]];
-
- return mag(nearest - sample);
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataCell::calcNearest
-(
- const label index,
- const linePointRef& ln,
- point& linePt,
- point& shapePt
-) const
-{
- notImplemented
- (
- "octreeDataCell::calcNearest(const label, const linePointRef&"
- ", point& linePt, point&)"
- );
- return GREAT;
-}
-
-
-void Foam::octreeDataCell::write
-(
- Ostream& os,
- const label index
-) const
-{
- os << cellLabels_[index] << " " << bbs_[index];
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataCell.H b/src/meshTools/octree/octreeDataCell.H
deleted file mode 100644
index f39ad2c3cc27c76fada1d52c4f2060d39aa9359a..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataCell.H
+++ /dev/null
@@ -1,196 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataCell
-
-Description
- Encapsulation of data needed to search in/for cells.
-
- Used to find the cell containing a point (e.g. cell-cell mapping).
-
-SourceFiles
- octreeDataCell.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataCell_H
-#define octreeDataCell_H
-
-#include "treeBoundBoxList.H"
-#include "labelList.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-class polyMesh;
-template<class Type> class octree;
-
-/*---------------------------------------------------------------------------*\
- Class octreeDataCell Declaration
-\*---------------------------------------------------------------------------*/
-
-class octreeDataCell
-{
- // Private data
-
- const polyMesh& mesh_;
-
- labelList cellLabels_;
-
- treeBoundBoxList bbs_;
-
-
-public:
-
- // Constructors
-
- //- Construct from components.
- octreeDataCell
- (
- const polyMesh&,
- const labelList& cellLabels,
- const treeBoundBoxList& bbs
- );
-
- //- Construct from mesh. Uses all cells in mesh.
- octreeDataCell(const polyMesh&);
-
-
- // Member Functions
-
- // Access
-
- const labelList& cellLabels() const
- {
- return cellLabels_;
- }
-
- const polyMesh& mesh() const
- {
- return mesh_;
- }
-
- const treeBoundBoxList& allBb() const
- {
- return bbs_;
- }
-
- label size() const
- {
- return bbs_.size();
- }
-
- // Search
-
- //- Get type of sample
- label getSampleType(octree<octreeDataCell>&, const point&) const;
-
- //- Does (bb of) shape at index overlap bb
- bool overlaps
- (
- const label index,
- const treeBoundBox& sampleBb
- ) const;
-
- //- Does shape at index contain sample
- bool contains
- (
- const label index,
- const point& sample
- ) const;
-
- //- Segment (from start to end) intersection with shape
- // at index. If intersects returns true and sets intersectionPoint
- // BUG: not yet done.
- bool intersects
- (
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
- ) const;
-
- //- Sets newTightest to bounding box (and returns true) if
- // nearer to sample than tightest bounding box. Otherwise
- // returns false
- bool findTightest
- (
- const label index,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Given index get unit normal and calculate (numerical) sign
- // of sample.
- // Used to determine accuracy of calcNearest or inside/outside.
- // Note: always returns GREAT since no inside/outside.
- scalar calcSign
- (
- const label index,
- const point& sample,
- vector& n
- ) const;
-
- //- Calculates nearest (to sample) point in shape.
- // Returns point and mag(nearest - sample)
- scalar calcNearest
- (
- const Foam::label index,
- const Foam::point& sample,
- point& nearest
- ) const;
-
- //- Calculates nearest (to line segment) point in shape.
- // Returns distance and both point.
- scalar calcNearest
- (
- const label index,
- const linePointRef& ln,
- point& linePt, // nearest point on line
- point& shapePt // nearest point on shape
- ) const;
-
-
-
- // Write
-
- // Write shape at index
- void write(Ostream& os, const label index) const;
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataEdges.C b/src/meshTools/octree/octreeDataEdges.C
deleted file mode 100644
index 55bc8e27235fb60f66901701714d6e3733ac763f..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataEdges.C
+++ /dev/null
@@ -1,240 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataEdges.H"
-
-#include "line.H"
-#include "labelList.H"
-#include "octree.H"
-#include "linePointRef.H"
-#include "pointHit.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-defineTypeNameAndDebug(Foam::octreeDataEdges, 0);
-
-Foam::scalar Foam::octreeDataEdges::tol(1E-6);
-
-
-// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct from selected edges. Bounding box calculated.
-Foam::octreeDataEdges::octreeDataEdges
-(
- const edgeList& edges,
- const pointField& points,
- const labelList& edgeLabels
-)
-:
- edges_(edges),
- points_(points),
- edgeLabels_(edgeLabels),
- allBb_(edgeLabels_.size())
-{
- // Generate tight fitting bounding box
- forAll(edgeLabels_, i)
- {
- label edgeI = edgeLabels_[i];
-
- const edge& e = edges_[edgeI];
-
- const point& a = points_[e.start()];
- const point& b = points_[e.end()];
-
- allBb_[i].min() = min(a, b);
- allBb_[i].max() = max(a, b);
- }
-}
-
-
-// Construct as copy
-Foam::octreeDataEdges::octreeDataEdges(const octreeDataEdges& shapes)
-:
- edges_(shapes.edges()),
- points_(shapes.points()),
- edgeLabels_(shapes.edgeLabels()),
- allBb_(shapes.allBb())
-{}
-
-
-// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
-
-Foam::octreeDataEdges::~octreeDataEdges()
-{}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-Foam::label Foam::octreeDataEdges::getSampleType
-(
- const octree<octreeDataEdges>&,
- const point&
-) const
-{
- return octree<octreeDataEdges>::UNKNOWN;
-}
-
-
-bool Foam::octreeDataEdges::overlaps
-(
- const label index,
- const treeBoundBox& sampleBb
-) const
-{
- return sampleBb.overlaps(allBb_[index]);
-}
-
-
-bool Foam::octreeDataEdges::contains
-(
- const label,
- const point&
-) const
-{
- notImplemented
- (
- "octreeDataEdges::contains(const label, const point&)"
- );
- return false;
-}
-
-
-bool Foam::octreeDataEdges::intersects
-(
- const label,
- const point&,
- const point&,
- point&
-) const
-{
- notImplemented
- (
- "octreeDataEdges::intersects(const label, const point&"
- ", const point&, point&)"
- );
- return false;
-}
-
-
-bool Foam::octreeDataEdges::findTightest
-(
- const label index,
- const point& sample,
- treeBoundBox& tightest
-) const
-{
- // Get nearest and furthest away vertex
- point myNear, myFar;
- allBb_[index].calcExtremities(sample, myNear, myFar);
-
- const point dist = myFar - sample;
- scalar myFarDist = mag(dist);
-
- point tightestNear, tightestFar;
- tightest.calcExtremities(sample, tightestNear, tightestFar);
-
- scalar tightestFarDist = mag(tightestFar - sample);
-
- if (tightestFarDist < myFarDist)
- {
- // Keep current tightest.
- return false;
- }
- else
- {
- // Construct bb around sample and myFar
- const point dist2(fabs(dist.x()), fabs(dist.y()), fabs(dist.z()));
-
- tightest.min() = sample - dist2;
- tightest.max() = sample + dist2;
-
- return true;
- }
-}
-
-
-// Determine numerical value of sign of sample compared to shape at index
-Foam::scalar Foam::octreeDataEdges::calcSign
-(
- const label,
- const point&,
- point& n
-) const
-{
- n = vector::zero;
-
- return 1;
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataEdges::calcNearest
-(
- const label index,
- const point& sample,
- point& nearest
-) const
-{
- const edge& e = edges_[edgeLabels_[index]];
-
- pointHit nearHit = e.line(points_).nearestDist(sample);
-
- nearest = nearHit.rawPoint();
-
- return nearHit.distance();
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataEdges::calcNearest
-(
- const label index,
- const linePointRef& sampleLine,
- point& sampleLinePt,
- point& shapePt
-) const
-{
- const edge& e = edges_[edgeLabels_[index]];
-
- linePointRef edgeLine(e.line(points_));
-
- return edgeLine.nearestDist(sampleLine, shapePt, sampleLinePt);
-}
-
-
-void Foam::octreeDataEdges::write
-(
- Ostream& os,
- const label index
-) const
-{
- os << edgeLabels_[index] << " " << allBb_[index];
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataEdges.H b/src/meshTools/octree/octreeDataEdges.H
deleted file mode 100644
index 3f89b94ca0691f0d9eb61c61255ec09d46f5e4e5..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataEdges.H
+++ /dev/null
@@ -1,221 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataEdges
-
-Description
- Holds data for octree to work on an edges subset.
-
-SourceFiles
- octreeDataEdges.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataEdges_H
-#define octreeDataEdges_H
-
-#include "line.H"
-#include "linePointRef.H"
-#include "treeBoundBoxList.H"
-#include "labelList.H"
-#include "className.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-template<class Type> class octree;
-
-/*---------------------------------------------------------------------------*\
- Class octreeDataEdges Declaration
-\*---------------------------------------------------------------------------*/
-
-class octreeDataEdges
-{
- // Static data
-
- //- tolerance on linear dimensions
- static scalar tol;
-
-
- // Private data
-
- //- Reference to edgeList
- const edgeList& edges_;
-
- //- Reference to points
- const pointField& points_;
-
- //- labels of edges
- labelList edgeLabels_;
-
- //- bbs for all above edges
- treeBoundBoxList allBb_;
-
-
-public:
-
- // Declare name of the class and its debug switch
- ClassName("octreeDataEdges");
-
- // Constructors
-
- //- Construct from selected edges. !Holds references to edges and points
- octreeDataEdges
- (
- const edgeList& edges,
- const pointField& points,
- const labelList& edgeLabels
- );
-
- //- Construct as copy
- octreeDataEdges(const octreeDataEdges&);
-
-
- //- Destructor
- ~octreeDataEdges();
-
-
- // Member Functions
-
- // Access
-
- const edgeList& edges() const
- {
- return edges_;
- }
-
- const pointField& points() const
- {
- return points_;
- }
-
- const labelList& edgeLabels() const
- {
- return edgeLabels_;
- }
-
- const treeBoundBoxList& allBb() const
- {
- return allBb_;
- }
-
- label size() const
- {
- return allBb_.size();
- }
-
-
- // Search
-
- //- Get type of sample
- label getSampleType
- (
- const octree<octreeDataEdges>&,
- const point&
- ) const;
-
- //- Does (bb of) shape at index overlap bb
- bool overlaps
- (
- const label index,
- const treeBoundBox& sampleBb
- ) const;
-
- //- Does shape at index contain sample
- bool contains
- (
- const label index,
- const point& sample
- ) const;
-
- //- Segment (from start to end) intersection with shape at index.
- // If intersects returns true and sets intersectionPoint
- bool intersects
- (
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
- ) const;
-
- //- Sets newTightest to bounding box (and returns true) if
- // nearer to sample than tightest bounding box. Otherwise
- // returns false.
- bool findTightest
- (
- const label index,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Given index get unit normal and calculate (numerical) sign
- // of sample.
- // Used to determine accuracy of calcNearest or inside/outside.
- scalar calcSign
- (
- const label index,
- const point& sample,
- vector& n
- ) const;
-
- //- Calculates nearest (to sample) point in shape.
- // Returns point and mag(nearest - sample).
- scalar calcNearest
- (
- const label index,
- const point& sample,
- point& nearest
- ) const;
-
- //- Calculates nearest (to line segment) point in shape.
- // Returns distance and both point.
- scalar calcNearest
- (
- const label index,
- const linePointRef& ln,
- point& linePt, // nearest point on line
- point& shapePt // nearest point on shape
- ) const;
-
-
- // Write
-
- //- Write shape at index
- void write(Ostream& os, const label index) const;
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataFace.C b/src/meshTools/octree/octreeDataFace.C
deleted file mode 100644
index aae9ce34a2bada028f33aeef141e86fad6ea78ae..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataFace.C
+++ /dev/null
@@ -1,717 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataFace.H"
-#include "labelList.H"
-#include "polyMesh.H"
-#include "octree.H"
-#include "polyPatch.H"
-#include "triangleFuncs.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-defineTypeNameAndDebug(Foam::octreeDataFace, 0);
-
-Foam::scalar Foam::octreeDataFace::tol(1E-6);
-
-
-// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
-
-void Foam::octreeDataFace::calcBb()
-{
- allBb_.setSize(meshFaces_.size());
- allBb_ = treeBoundBox::invertedBox;
-
- forAll(meshFaces_, i)
- {
- // Update bb of face
- treeBoundBox& myBb = allBb_[i];
-
- const face& f = mesh_.faces()[meshFaces_[i]];
-
- forAll(f, faceVertexI)
- {
- const point& coord = mesh_.points()[f[faceVertexI]];
-
- myBb.min() = min(myBb.min(), coord);
- myBb.max() = max(myBb.max(), coord);
- }
- }
-}
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct from selected mesh faces
-Foam::octreeDataFace::octreeDataFace
-(
- const primitiveMesh& mesh,
- const labelList& meshFaces,
- const treeBoundBoxList& allBb
-)
-:
- mesh_(mesh),
- meshFaces_(meshFaces),
- allBb_(allBb)
-{}
-
-
-// Construct from selected mesh faces. Bounding box calculated.
-Foam::octreeDataFace::octreeDataFace
-(
- const primitiveMesh& mesh,
- const labelList& meshFaces
-)
-:
- mesh_(mesh),
- meshFaces_(meshFaces),
- allBb_(meshFaces_.size())
-{
- // Generate tight fitting bounding box
- calcBb();
-}
-
-
-// Construct from selected mesh faces
-Foam::octreeDataFace::octreeDataFace
-(
- const primitiveMesh& mesh,
- const UList<const labelList*>& meshFaceListPtrs,
- const UList<const treeBoundBoxList*>& bbListPtrs
-)
-:
- mesh_(mesh),
- meshFaces_(0),
- allBb_(0)
-{
- label faceI = 0;
-
- forAll(meshFaceListPtrs, listI)
- {
- faceI += meshFaceListPtrs[listI]->size();
- }
-
- meshFaces_.setSize(faceI);
- allBb_.setSize(faceI);
-
- faceI = 0;
-
- forAll(meshFaceListPtrs, listI)
- {
- const labelList& meshFaces = *meshFaceListPtrs[listI];
- const treeBoundBoxList& allBb = *bbListPtrs[listI];
-
- forAll(meshFaces, meshFaceI)
- {
- meshFaces_[faceI] = meshFaces[meshFaceI];
- allBb_[faceI] = allBb[meshFaceI];
- faceI++;
- }
- }
-}
-
-
-// Construct from selected mesh faces. Bounding box calculated.
-Foam::octreeDataFace::octreeDataFace
-(
- const primitiveMesh& mesh,
- const UList<const labelList*>& meshFaceListPtrs
-)
-:
- mesh_(mesh),
- meshFaces_(0)
-{
- label faceI = 0;
-
- forAll(meshFaceListPtrs, listI)
- {
- faceI += meshFaceListPtrs[listI]->size();
- }
-
- meshFaces_.setSize(faceI);
-
- faceI = 0;
-
- forAll(meshFaceListPtrs, listI)
- {
- const labelList& meshFaces = *meshFaceListPtrs[listI];
-
- forAll(meshFaces, meshFaceI)
- {
- meshFaces_[faceI++] = meshFaces[meshFaceI];
- }
- }
-
- // Generate tight fitting bounding box
- calcBb();
-}
-
-
-// Construct from all faces in polyPatch. Bounding box calculated.
-Foam::octreeDataFace::octreeDataFace(const polyPatch& patch)
-:
- mesh_(patch.boundaryMesh().mesh()),
- meshFaces_(patch.size())
-{
- forAll(patch, patchFaceI)
- {
- meshFaces_[patchFaceI] = patch.start() + patchFaceI;
- }
-
- // Generate tight fitting bounding box
- calcBb();
-}
-
-
-// Construct from primitiveMesh. Inserts all boundary faces.
-Foam::octreeDataFace::octreeDataFace(const primitiveMesh& mesh)
-:
- mesh_(mesh),
- meshFaces_(0),
- allBb_(0)
-{
- // Size storage
- meshFaces_.setSize(mesh_.nFaces() - mesh_.nInternalFaces());
-
- // Set info for all boundary faces.
- label boundaryFaceI = 0;
-
- for (label faceI = mesh_.nInternalFaces(); faceI < mesh_.nFaces(); faceI++)
- {
- meshFaces_[boundaryFaceI++] = faceI;
- }
-
- // Generate tight fitting bounding box
- calcBb();
-}
-
-
-// Construct as copy
-Foam::octreeDataFace::octreeDataFace(const octreeDataFace& shapes)
-:
- mesh_(shapes.mesh()),
- meshFaces_(shapes.meshFaces()),
- allBb_(shapes.allBb())
-{}
-
-
-// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
-
-Foam::octreeDataFace::~octreeDataFace()
-{}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-Foam::label Foam::octreeDataFace::getSampleType
-(
- const octree<octreeDataFace>& oc,
- const point& sample
-) const
-{
- // Need to determine whether sample is 'inside' or 'outside'
- // Done by finding nearest face. This gives back a face which is
- // guaranteed to contain nearest point. This point can be
- // - in interior of face: compare to face normal
- // - on edge of face: compare to edge normal
- // - on point of face: compare to point normal
- // Unfortunately the octree does not give us back the intersection point
- // or where on the face it has hit so we have to recreate all that
- // information.
-
- treeBoundBox tightest(treeBoundBox::greatBox);
- scalar tightestDist(treeBoundBox::great);
- // Find nearest face to sample
- label index = oc.findNearest(sample, tightest, tightestDist);
-
- if (index == -1)
- {
- FatalErrorIn
- (
- "octreeDataFace::getSampleType"
- "(octree<octreeDataFace>&, const point&)"
- ) << "Could not find " << sample << " in octree."
- << abort(FatalError);
- }
-
-
- // Get actual intersection point on face
- label faceI = meshFaces_[index];
-
- if (debug & 2)
- {
- Pout<< "getSampleType : sample:" << sample
- << " nearest face:" << faceI;
- }
-
- const face& f = mesh_.faces()[faceI];
-
- const pointField& points = mesh_.points();
-
- pointHit curHit = f.nearestPoint(sample, points);
-
- //
- // 1] Check whether sample is above face
- //
-
- if (curHit.hit())
- {
- // Simple case. Compare to face normal.
-
- if (debug & 2)
- {
- Pout<< " -> face hit:" << curHit.hitPoint()
- << " comparing to face normal " << mesh_.faceAreas()[faceI]
- << endl;
- }
- return octree<octreeDataFace>::getVolType
- (
- mesh_.faceAreas()[faceI],
- sample - curHit.hitPoint()
- );
- }
-
- if (debug & 2)
- {
- Pout<< " -> face miss:" << curHit.missPoint();
- }
-
- //
- // 2] Check whether intersection is on one of the face vertices or
- // face centre
- //
-
- scalar typDim = sqrt(mag(mesh_.faceAreas()[faceI])) + VSMALL;
-
- forAll(f, fp)
- {
- if ((mag(points[f[fp]] - curHit.missPoint())/typDim) < tol)
- {
- // Face intersection point equals face vertex fp
-
- // Calculate point normal (wrong: uses face normals instead of
- // triangle normals)
- const labelList& myFaces = mesh_.pointFaces()[f[fp]];
-
- vector pointNormal(vector::zero);
-
- forAll(myFaces, myFaceI)
- {
- if (myFaces[myFaceI] >= mesh_.nInternalFaces())
- {
- vector n = mesh_.faceAreas()[myFaces[myFaceI]];
- n /= mag(n) + VSMALL;
-
- pointNormal += n;
- }
- }
-
- if (debug & 2)
- {
- Pout<< " -> face point hit :" << points[f[fp]]
- << " point normal:" << pointNormal
- << " distance:"
- << mag(points[f[fp]] - curHit.missPoint())/typDim
- << endl;
- }
- return octree<octreeDataFace>::getVolType
- (
- pointNormal,
- sample - curHit.missPoint()
- );
- }
- }
- if ((mag(mesh_.faceCentres()[faceI] - curHit.missPoint())/typDim) < tol)
- {
- // Face intersection point equals face centre. Normal at face centre
- // is already average of face normals
-
- if (debug & 2)
- {
- Pout<< " -> centre hit:" << mesh_.faceCentres()[faceI]
- << " distance:"
- << mag(mesh_.faceCentres()[faceI] - curHit.missPoint())/typDim
- << endl;
- }
-
- return octree<octreeDataFace>::getVolType
- (
- mesh_.faceAreas()[faceI],
- sample - curHit.missPoint()
- );
- }
-
-
- //
- // 3] Get the 'real' edge the face intersection is on
- //
-
- const labelList& myEdges = mesh_.faceEdges()[faceI];
-
- forAll(myEdges, myEdgeI)
- {
- const edge& e = mesh_.edges()[myEdges[myEdgeI]];
-
- pointHit edgeHit = line<point, const point&>
- (
- points[e.start()],
- points[e.end()]
- ).nearestDist(sample);
-
-
- if ((mag(edgeHit.rawPoint() - curHit.missPoint())/typDim) < tol)
- {
- // Face intersection point lies on edge e
-
- // Calculate edge normal (wrong: uses face normals instead of
- // triangle normals)
- const labelList& myFaces = mesh_.edgeFaces()[myEdges[myEdgeI]];
-
- vector edgeNormal(vector::zero);
-
- forAll(myFaces, myFaceI)
- {
- if (myFaces[myFaceI] >= mesh_.nInternalFaces())
- {
- vector n = mesh_.faceAreas()[myFaces[myFaceI]];
- n /= mag(n) + VSMALL;
-
- edgeNormal += n;
- }
- }
-
- if (debug & 2)
- {
- Pout<< " -> real edge hit point:" << edgeHit.rawPoint()
- << " comparing to edge normal:" << edgeNormal
- << endl;
- }
-
- // Found face intersection point on this edge. Compare to edge
- // normal
- return octree<octreeDataFace>::getVolType
- (
- edgeNormal,
- sample - curHit.missPoint()
- );
- }
- }
-
-
- //
- // 4] Get the internal edge the face intersection is on
- //
-
- forAll(f, fp)
- {
- pointHit edgeHit =
- line<point, const point&>
- (
- points[f[fp]],
- mesh_.faceCentres()[faceI]
- ).nearestDist(sample);
-
- if ((mag(edgeHit.rawPoint() - curHit.missPoint())/typDim) < tol)
- {
- // Face intersection point lies on edge between two face triangles
-
- // Calculate edge normal as average of the two triangle normals
- const label fpPrev = f.rcIndex(fp);
- const label fpNext = f.fcIndex(fp);
-
- vector e = points[f[fp]] - mesh_.faceCentres()[faceI];
- vector ePrev = points[f[fpPrev]] - mesh_.faceCentres()[faceI];
- vector eNext = points[f[fpNext]] - mesh_.faceCentres()[faceI];
-
- vector nLeft = ePrev ^ e;
- nLeft /= mag(nLeft) + VSMALL;
-
- vector nRight = e ^ eNext;
- nRight /= mag(nRight) + VSMALL;
-
- if (debug & 2)
- {
- Pout<< " -> internal edge hit point:" << edgeHit.rawPoint()
- << " comparing to edge normal "
- << 0.5*(nLeft + nRight)
- << endl;
- }
-
- // Found face intersection point on this edge. Compare to edge
- // normal
- return octree<octreeDataFace>::getVolType
- (
- 0.5*(nLeft + nRight),
- sample - curHit.missPoint()
- );
- }
- }
-
- if (debug & 2)
- {
- Pout<< "Did not find sample " << sample
- << " anywhere related to nearest face " << faceI << endl
- << "Face:";
-
- forAll(f, fp)
- {
- Pout<< " vertex:" << f[fp] << " coord:" << points[f[fp]]
- << endl;
- }
- }
-
- // Can't determine status of sample with respect to nearest face.
- // Either
- // - tolerances are wrong. (if e.g. face has zero area)
- // - or (more likely) surface is not closed.
-
- return octree<octreeDataFace>::UNKNOWN;
-}
-
-
-bool Foam::octreeDataFace::overlaps
-(
- const label index,
- const treeBoundBox& sampleBb
-) const
-{
- //return sampleBb.overlaps(allBb_[index]);
-
- //- Exact test of face intersecting bb
-
- // 1. Quick rejection: bb does not intersect face bb at all
- if (!sampleBb.overlaps(allBb_[index]))
- {
- return false;
- }
-
- // 2. Check if one or more face points inside
- label faceI = meshFaces_[index];
-
- const face& f = mesh_.faces()[faceI];
-
- const pointField& points = mesh_.points();
- if (sampleBb.containsAny(points, f))
- {
- return true;
- }
-
- // 3. Difficult case: all points are outside but connecting edges might
- // go through cube. Use triangle-bounding box intersection.
- const point& fc = mesh_.faceCentres()[faceI];
-
- forAll(f, fp)
- {
- const label fp1 = f.fcIndex(fp);
-
- bool triIntersects = triangleFuncs::intersectBb
- (
- points[f[fp]],
- points[f[fp1]],
- fc,
- sampleBb
- );
-
- if (triIntersects)
- {
- return true;
- }
- }
- return false;
-}
-
-
-bool Foam::octreeDataFace::contains(const label, const point&) const
-{
- notImplemented
- (
- "octreeDataFace::contains(const label, const point&)"
- );
- return false;
-}
-
-
-bool Foam::octreeDataFace::intersects
-(
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
-) const
-{
- label faceI = meshFaces_[index];
-
- const face& f = mesh_.faces()[faceI];
-
- const vector dir(end - start);
-
- // Disable picking up intersections behind us.
- scalar oldTol = intersection::setPlanarTol(0.0);
-
- pointHit inter = f.ray
- (
- start,
- dir,
- mesh_.points(),
- intersection::HALF_RAY,
- intersection::VECTOR
- );
-
- intersection::setPlanarTol(oldTol);
-
- if (inter.hit() && inter.distance() <= mag(dir))
- {
- intersectionPoint = inter.hitPoint();
-
- return true;
- }
- else
- {
- return false;
- }
-}
-
-
-bool Foam::octreeDataFace::findTightest
-(
- const label index,
- const point& sample,
- treeBoundBox& tightest
-) const
-{
- // Get furthest away vertex
- point myNear, myFar;
- allBb_[index].calcExtremities(sample, myNear, myFar);
-
- const point dist = myFar - sample;
- scalar myFarDist = mag(dist);
-
- point tightestNear, tightestFar;
- tightest.calcExtremities(sample, tightestNear, tightestFar);
-
- scalar tightestFarDist = mag(tightestFar - sample);
-
- if (tightestFarDist < myFarDist)
- {
- // Keep current tightest.
- return false;
- }
- else
- {
- // Construct bb around sample and myFar
- const point dist2(fabs(dist.x()), fabs(dist.y()), fabs(dist.z()));
-
- tightest.min() = sample - dist2;
- tightest.max() = sample + dist2;
-
- return true;
- }
-}
-
-
-// Determine numerical value of sign of sample compared to shape at index
-Foam::scalar Foam::octreeDataFace::calcSign
-(
- const label index,
- const point& sample,
- point& n
-) const
-{
- label faceI = meshFaces_[index];
-
- n = mesh_.faceAreas()[faceI];
-
- n /= mag(n) + VSMALL;
-
- vector vec = sample - mesh_.faceCentres()[faceI];
-
- vec /= mag(vec) + VSMALL;
-
- return n & vec;
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataFace::calcNearest
-(
- const label index,
- const point& sample,
- point& nearest
-) const
-{
- label faceI = meshFaces_[index];
-
- const face& f = mesh_.faces()[faceI];
-
- pointHit nearHit = f.nearestPoint(sample, mesh_.points());
-
- nearest = nearHit.rawPoint();
-
- if (debug & 1)
- {
- const point& ctr = mesh_.faceCentres()[faceI];
-
- scalar sign = mesh_.faceAreas()[faceI] & (sample - nearest);
-
- Pout<< "octreeDataFace::calcNearest : "
- << "sample:" << sample
- << " index:" << index
- << " faceI:" << faceI
- << " ctr:" << ctr
- << " sign:" << sign
- << " nearest point:" << nearest
- << " distance to face:" << nearHit.distance()
- << endl;
- }
- return nearHit.distance();
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataFace::calcNearest
-(
- const label index,
- const linePointRef& ln,
- point& linePt,
- point& shapePt
-) const
-{
- notImplemented
- (
- "octreeDataFace::calcNearest(const label, const linePointRef&"
- ", point&, point&)"
- );
- return GREAT;
-}
-
-
-void Foam::octreeDataFace::write(Ostream& os, const label index) const
-{
- os << meshFaces_[index] << " " << allBb_[index];
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataFace.H b/src/meshTools/octree/octreeDataFace.H
deleted file mode 100644
index 6eaeb0e86e9f504ad45de0918bcf301857ef4a04..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataFace.H
+++ /dev/null
@@ -1,248 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataFace
-
-Description
- Holds data for octree to work on mesh faces.
-
- For example, calculate (in calcNearest) the correct intersection point
- with a face.
-
-SourceFiles
- octreeDataFace.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataFace_H
-#define octreeDataFace_H
-
-#include "treeBoundBoxList.H"
-#include "faceList.H"
-#include "point.H"
-#include "className.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-class primitiveMesh;
-template<class Type> class octree;
-class polyPatch;
-
-/*---------------------------------------------------------------------------*\
- Class octreeDataFace Declaration
-\*---------------------------------------------------------------------------*/
-
-class octreeDataFace
-{
- // Static data
-
- //- tolerance on linear dimensions
- static scalar tol;
-
-
- // Private data
-
- //- the mesh
- const primitiveMesh& mesh_;
-
- //- labels (in mesh indexing) of faces
- labelList meshFaces_;
-
- //- bbs for all above faces
- treeBoundBoxList allBb_;
-
-
- // Private Member Functions
-
- //- Set allBb to tight fitting bounding box
- void calcBb();
-
-public:
-
- // Declare name of the class and its debug switch
- ClassName("octreeDataFace");
-
- // Constructors
-
- //- Construct from selected mesh faces.
- octreeDataFace
- (
- const primitiveMesh&,
- const labelList& meshFaces,
- const treeBoundBoxList&
- );
-
- //- Construct from selected mesh faces. Tight fitting bounding boxes
- // generated internally.
- octreeDataFace
- (
- const primitiveMesh&,
- const labelList& meshFaces
- );
-
- //- Construct from selected mesh faces.
- octreeDataFace
- (
- const primitiveMesh&,
- const UList<const labelList*>&,
- const UList<const treeBoundBoxList*>&
- );
-
- //- Construct from selected mesh faces.
- // Tight-fitting bounding boxes generated internally.
- octreeDataFace(const primitiveMesh&, const UList<const labelList*>&);
-
- //- Construct from all faces in patch.
- // Tight-fitting bounding boxes generated internally.
- octreeDataFace(const polyPatch&);
-
- //- Construct from all boundary faces.
- // Tight-fitting bounding boxes generated internally.
- octreeDataFace(const primitiveMesh&);
-
- //- Construct as copy
- octreeDataFace(const octreeDataFace&);
-
-
- //- Destructor
- ~octreeDataFace();
-
-
- // Member Functions
-
- // Access
-
- const primitiveMesh& mesh() const
- {
- return mesh_;
- }
-
- const labelList& meshFaces() const
- {
- return meshFaces_;
- }
-
- const treeBoundBoxList& allBb() const
- {
- return allBb_;
- }
-
- label size() const
- {
- return allBb_.size();
- }
-
-
- // Search
-
- //- Get type of sample
- label getSampleType
- (
- const octree<octreeDataFace>&,
- const point&
- ) const;
-
- //- Does (bb of) shape at index overlap bb
- bool overlaps
- (
- const label index,
- const treeBoundBox& sampleBb
- ) const;
-
- //- Does shape at index contain sample
- bool contains(const label index, const point& sample) const;
-
- //- Segment (from start to end) intersection with shape
- // at index. If intersects returns true and sets intersectionPoint
- bool intersects
- (
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
- ) const;
-
- //- Sets newTightest to bounding box (and returns true) if
- // nearer to sample than tightest bounding box. Otherwise
- // returns false.
- bool findTightest
- (
- const label index,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Given index get unit normal and calculate (numerical) sign
- // of sample.
- // Used to determine accuracy of calcNearest or inside/outside.
- scalar calcSign
- (
- const label index,
- const point& sample,
- vector& n
- ) const;
-
- //- Calculates nearest (to sample) point in shape.
- // Returns point and mag(nearest - sample). Returns GREAT if
- // sample does not project onto (triangle decomposition) of face.
- scalar calcNearest
- (
- const label index,
- const point& sample,
- point& nearest
- ) const;
-
- //- Calculates nearest (to line segment) point in shape.
- // Returns distance and both point.
- scalar calcNearest
- (
- const label index,
- const linePointRef& ln,
- point& linePt, // nearest point on line
- point& shapePt // nearest point on shape
- ) const;
-
-
- // Write
-
- //- Write shape at index
- void write(Ostream& os, const label index) const;
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataPoint.C b/src/meshTools/octree/octreeDataPoint.C
deleted file mode 100644
index de700f28acfa742b1c771c3d5283c678f95d659c..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataPoint.C
+++ /dev/null
@@ -1,191 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataPoint.H"
-
-#include "labelList.H"
-#include "treeBoundBox.H"
-#include "octree.H"
-#include "linePointRef.H"
-#include "pointHit.H"
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct from components
-Foam::octreeDataPoint::octreeDataPoint(const pointField& points)
-:
- points_(points)
-{}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-//- Get type of volume
-Foam::label Foam::octreeDataPoint::getSampleType
-(
- const octree<octreeDataPoint>&,
- const point&
-) const
-{
- return octree<octreeDataPoint>::UNKNOWN;
-}
-
-
-bool Foam::octreeDataPoint::overlaps
-(
- const label index,
- const treeBoundBox& sampleBb
-) const
-{
- return sampleBb.contains(points_[index]);
-}
-
-
-bool Foam::octreeDataPoint::contains
-(
- const label,
- const point&
-) const
-{
- notImplemented
- (
- "octreeDataPoint::contains(const label, const point&)"
- );
-
- return false;
-}
-
-
-bool Foam::octreeDataPoint::intersects
-(
- const label,
- const point&,
- const point&,
- point&
-) const
-{
- notImplemented
- (
- "octreeDataPoint::intersects(const label, const point&,"
- "const point&, point&)"
- );
-
- return false;
-}
-
-
-bool Foam::octreeDataPoint::findTightest
-(
- const label,
- const point&,
- treeBoundBox&
-) const
-{
- notImplemented
- (
- "octreeDataPoint::findTightest(const label, const point&,"
- "treeBoundBox&)"
- );
-
- return false;
-}
-
-
-Foam::scalar Foam::octreeDataPoint::calcSign
-(
- const label,
- const point&,
- vector& n
-) const
-{
- n = vector::zero;
-
- return 1;
-}
-
-
-// Calculate nearest point on/in shapei
-inline Foam::scalar Foam::octreeDataPoint::calcNearest
-(
- const label index,
- const point& sample,
- point& nearest
-) const
-{
- nearest = points_[index];
- return magSqr(points_[index] - sample);
-}
-
-
-void Foam::octreeDataPoint::write
-(
- Ostream& os,
- const label index
-) const
-{
- if ((index < 0) || (index > points().size()))
- {
- FatalErrorIn("octreeDataPoint::write(Ostream&, const label)")
- << "Index " << index << " outside 0.." << points().size()
- << abort(FatalError);
- }
- os << ' ' << points()[index];
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataPoint::calcNearest
-(
- const label index,
- const linePointRef& ln,
- point& linePt,
- point& shapePt
-) const
-{
- // Nearest point on shape
- shapePt = points_[index];
-
- // Nearest point on line
- pointHit pHit = ln.nearestDist(shapePt);
-
- linePt = pHit.rawPoint();
-
- return pHit.distance();
-}
-
-
-// * * * * * * * * * * * * * * * Friend Operators * * * * * * * * * * * * * //
-
-Foam::Ostream& Foam::operator<<
-(
- Foam::Ostream& os,
- const Foam::octreeDataPoint& ocPts
-)
-{
- return os << ocPts.points();
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataPoint.H b/src/meshTools/octree/octreeDataPoint.H
deleted file mode 100644
index 2ea8cfb50b73a38bef3d6c393e4901be089b39ea..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataPoint.H
+++ /dev/null
@@ -1,184 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataPoint
-
-Description
- Encapsulation of data needed for octree searches.
-
- Used for searching for nearest point. No bounding boxes around points.
- Only overlaps and calcNearest are implemented, rest makes little sense.
- Holds (reference to) pointField.
-
-SourceFiles
- octreeDataPoint.C
- octreeDataPointTreaLeaf.H (template specialization of treeleaf)
- octreeDataPointTreeLeaf.C (template specialization of treeleaf)
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataPoint_H
-#define octreeDataPoint_H
-
-#include "point.H"
-#include "pointField.H"
-#include "treeBoundBox.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-template<class Type> class octree;
-
-/*---------------------------------------------------------------------------*\
- Class octreeDataPoint Declaration
-\*---------------------------------------------------------------------------*/
-
-class octreeDataPoint
-{
- // Private data
-
- const pointField& points_;
-
-public:
-
- // Constructors
-
- //- Construct from components. Holds reference to points!
- explicit octreeDataPoint(const pointField&);
-
-
- // Member Functions
-
- // Access
-
- const pointField& points() const
- {
- return points_;
- }
-
- label size() const
- {
- return points_.size();
- }
-
- // Search
-
- //- Get type of sample
- label getSampleType
- (
- const octree<octreeDataPoint>&,
- const point&
- ) const;
-
- //- Does (bb of) shape at index overlap bb
- bool overlaps
- (
- const label index,
- const treeBoundBox& sampleBb
- ) const;
-
- //- Does shape at index contain sample
- bool contains
- (
- const label index,
- const point& sample
- ) const;
-
- //- Segment (from start to end) intersection with shape
- // at index. If intersects returns true and sets intersectionPoint
- bool intersects
- (
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
- ) const;
-
- //- Sets newTightest to bounding box (and returns true) if
- // nearer to sample than tightest bounding box. Otherwise
- // returns false.
- bool findTightest
- (
- const label index,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Given index get unit normal and calculate (numerical) sign
- // of sample.
- // Used to determine accuracy of calcNearest or inside/outside.
- // Note: always returns GREAT since no inside/outside.
- scalar calcSign
- (
- const label index,
- const point& sample,
- vector& n
- ) const;
-
-
- //- Calculates nearest (to sample) point on/in shape.
- // Returns point and mag(nearest - sample)
- scalar calcNearest
- (
- const label index,
- const point& sample,
- point& nearest
- ) const;
-
- //- Calculates nearest (to line segment) point in shape.
- // Returns distance and both point.
- scalar calcNearest
- (
- const label index,
- const linePointRef& ln,
- point& linePt, // nearest point on line
- point& shapePt // nearest point on shape
- ) const;
-
-
-
- // Write
-
- //- Write shape at index
- void write(Ostream& os, const label index) const;
-
-
- // IOstream Operators
-
- friend Ostream& operator<<(Ostream&, const octreeDataPoint&);
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataPointTreeLeaf.C b/src/meshTools/octree/octreeDataPointTreeLeaf.C
deleted file mode 100644
index 753811722d0e03be2c235ae57499d43fac1bcff2..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataPointTreeLeaf.C
+++ /dev/null
@@ -1,105 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataPointTreeLeaf.H"
-#include "octreeDataPoint.H"
-#include "treeLeaf.H"
-
-// * * * * * * * * * * * * * Template Specialisations * * * * * * * * * * * //
-
-template<>
-Foam::label Foam::treeLeaf<Foam::octreeDataPoint>::find
-(
- const octreeDataPoint& shapes,
- const point& sample
-) const
-{
- notImplemented
- (
- "Foam::treeLeaf<Foam::octreeDataPoint>::find("
- "const octreeDataPoint& shapes,"
- "const point& sample"
- );
-
- return false;
-}
-
-
-template<>
-bool Foam::treeLeaf<Foam::octreeDataPoint>::findNearest
-(
- const octreeDataPoint& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
-) const
-{
- // Some aliases
- const pointField& points = shapes.points();
- point& tMin = tightest.min();
- point& tMax = tightest.max();
-
- scalar minDist2 = sqr(tightestDist);
-
- label minIndex = -1;
- forAll(indices_, i)
- {
- label pointi = indices_[i];
- scalar dist = magSqr(points[pointi] - sample);
-
- if (dist < minDist2)
- {
- minDist2 = dist;
- minIndex = pointi;
- }
- }
-
- if (minIndex != -1)
- {
- tightestDist = sqrt(minDist2);
-
- // New nearer. Update 'tightest' bounding box
- tMin.x() = sample.x() - tightestDist;
- tMin.y() = sample.y() - tightestDist;
- tMin.z() = sample.z() - tightestDist;
-
- tMax.x() = sample.x() + tightestDist;
- tMax.y() = sample.y() + tightestDist;
- tMax.z() = sample.z() + tightestDist;
-
- tightestI = minIndex;
-
- return true;
- }
- else
- {
- // New no nearer so nothing changed
- return false;
- }
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeDataPointTreeLeaf.H b/src/meshTools/octree/octreeDataPointTreeLeaf.H
deleted file mode 100644
index c0e3903292b1bad2617ed05dcf93ff32ec8883b6..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeDataPointTreeLeaf.H
+++ /dev/null
@@ -1,75 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataPointTreeLeaf
-
-Description
- Template specialisation for octreeDataPoint
-
-SourceFiles
- octreeDataPointTreeLeaf.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataPointTreeLeaf_H
-#define octreeDataPointTreeLeaf_H
-
-#include "treeLeaf.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-class octreeDataPoint;
-
-template<>
-label treeLeaf<octreeDataPoint>::find
-(
- const octreeDataPoint& shapes,
- const point& sample
-) const;
-
-
-template<>
-bool treeLeaf<octreeDataPoint>::findNearest
-(
- const octreeDataPoint& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
-) const;
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeLine.C b/src/meshTools/octree/octreeLine.C
deleted file mode 100644
index 6497858f60ed574cee4c21d44588079cc8e1b9c9..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeLine.C
+++ /dev/null
@@ -1,180 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeLine.H"
-#include "octree.H"
-
-// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
-
-// Calculate sorted list of intersections
-template <class Type>
-void Foam::octreeLine<Type>::calcSortedIntersections()
-{
- // Determine intersections and sort acc. to distance to start
-
- const labelList& indices = currentLeaf_->indices();
-
- sortedIntersections_.setSize(indices.size());
-
- const vector direction = endPoint_ - realStartPoint_;
-
- label nHits = 0;
-
- forAll(indices, elemI)
- {
- point pt;
- bool hit = tree_.shapes().intersects
- (
- indices[elemI],
- realStartPoint_,
- direction,
- pt
- );
-
- if (hit && (indices[elemI] != lastElem_))
- {
- sortedIntersections_[nHits++] = pointHitSort
- (
- pointHit
- (
- true,
- pt,
- Foam::magSqr(pt - leafExitPoint_),
- false
- ),
- indices[elemI]
- );
- }
- }
-
- sortedIntersections_.setSize(nHits);
-
- Foam::sort(sortedIntersections_);
-
- //// After sorting
- //forAll(sortedIntersections_, i)
- //{
- // Pout<< "calcSortedIntersections: After sorting:"
- // << i << " distance:"
- // << sortedIntersections_[i].inter().distance()
- // << " index:" << sortedIntersections_[i].index()
- // << endl;
- //}
-
- lastElem_ = -1;
-
- if (nHits > 0)
- {
- lastElem_ = sortedIntersections_[nHits - 1].index();
-
- //Pout<< "Storing lastElem_:" << lastElem_ << endl;
- }
-
- // Reset index into sortedIntersections_
- sortedI_ = -1;
-}
-
-
-// Searches for leaf with intersected elements. Return true if found; false
-// otherwise. Sets currentLeaf_ and sortedIntersections_.
-template <class Type>
-bool Foam::octreeLine<Type>::getNextLeaf()
-{
- do
- {
- // No current leaf. Find first one.
- // Note: search starts from top every time
-
- point start(leafExitPoint_);
- currentLeaf_ = tree_.findLeafLine(start, endPoint_, leafExitPoint_);
-
- if (!currentLeaf_)
- {
- // No leaf found. Give up.
- return false;
- }
-
- // Get intersections and sort.
- calcSortedIntersections();
- }
- while (sortedIntersections_.empty());
-
- return true;
-}
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::octreeLine<Type>::octreeLine
-(
- const octree<Type>& tree,
- const point& startPoint,
- const point& endPoint
-)
-:
- tree_(tree),
- startPoint_(startPoint),
- endPoint_(endPoint),
- realStartPoint_(startPoint),
- leafExitPoint_(startPoint_),
- currentLeaf_(NULL),
- sortedIntersections_(0),
- lastElem_(-1),
- sortedI_(-1)
-{}
-
-
-// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::octreeLine<Type>::~octreeLine()
-{}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-template <class Type>
-bool Foam::octreeLine<Type>::getIntersection()
-{
- // Go to next element in sortedIntersections
-
- sortedI_++;
-
- if (sortedI_ >= sortedIntersections_.size())
- {
- // Past all sortedIntersections in current leaf. Go to next one.
- if (!getNextLeaf())
- {
- // No valid leaf found
- return false;
- }
- sortedI_ = 0;
- }
-
- return true;
-}
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeLine.H b/src/meshTools/octree/octreeLine.H
deleted file mode 100644
index cec8fd30d0993159a7f445135724b81aa8b7907d..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeLine.H
+++ /dev/null
@@ -1,193 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeLine
-
-Description
- Iterates over intersections of line with octree leaf elements.
-
- Used as in
- \code
- octree<octreeDataFace> oc( .. );
-
- octreeLine<octreeDataFace> lineSearch(oc, pStart, pEnd);
-
- while (lineSearch.getIntersection())
- {
- const point& pt = lineSearch.hitInfo().hitPoint();
- ..
- }
- \endcode
-
-SourceFiles
- octreeLine.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeLine_H
-#define octreeLine_H
-
-#include "boolList.H"
-#include "point.H"
-#include "pointHitSort.H"
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-template<class Type> class octree;
-template<class Type> class treeLeaf;
-
-
-/*---------------------------------------------------------------------------*\
- Class octreeLine Declaration
-\*---------------------------------------------------------------------------*/
-
-template <class Type>
-class octreeLine
-{
- // Private data
-
- //- Octree reference
- const octree<Type>& tree_;
-
- //- Start of segment
- const point startPoint_;
-
- //- End of segment
- const point endPoint_;
-
- //- Start moved into bb
- point realStartPoint_;
-
- //- Exit point of intersection with current treeLeaf
- point leafExitPoint_;
-
- //- Current treeLeaf to be searched in.
- const treeLeaf<Type>* currentLeaf_;
-
- //- Sorted list of intersections
- List<pointHitSort> sortedIntersections_;
-
- //- index of last hit in previous treeLeaf. Used so if shape double
- // it does not get counted twice. Note is not ok for concave shapes
- label lastElem_;
-
- //- Current hit: index in sortedIntersections_
- label sortedI_;
-
- // Private Member Functions
-
- //- Calculate sorted list of intersections
- void calcSortedIntersections();
-
- //- Searches for leaf with intersected elements.
- // Return true if found; false otherwise.
- // Sets currentLeaf_ and sortedIntersections_
- bool getNextLeaf();
-
-public:
-
- // Constructors
-
- //- Construct from components
- octreeLine
- (
- const octree<Type>& tree,
- const point& startPoint,
- const point& endPoint
- );
-
-
- //- Destructor
- ~octreeLine();
-
-
- // Member Functions
-
- const octree<Type>& tree() const
- {
- return tree_;
- }
-
- const point& leafExitPoint() const
- {
- return leafExitPoint_;
- }
-
- const point& endPoint() const
- {
- return endPoint_;
- }
-
- const point& startPoint() const
- {
- return startPoint_;
- }
-
- const treeLeaf<Type>* currentLeaf() const
- {
- return currentLeaf_;
- }
-
- const List<pointHitSort>& sortedIntersections() const
- {
- return sortedIntersections_;
- }
-
- label hitIndex() const
- {
- return sortedIntersections_[sortedI_].index();
- }
-
- const pointHit& hitInfo() const
- {
- return sortedIntersections_[sortedI_].inter();
- }
-
-
- //- go to next intersection. Return false if no intersections.
- bool getIntersection();
-
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#ifdef NoRepository
-# include "octreeLine.C"
-#endif
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/octreeName.C b/src/meshTools/octree/octreeName.C
deleted file mode 100644
index 7564f96bd8ca87c0d665aa7ada4e94faa3d20d43..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/octreeName.C
+++ /dev/null
@@ -1,32 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octree.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-defineTypeNameAndDebug(Foam::octreeName, 0);
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeElem.H b/src/meshTools/octree/treeElem.H
deleted file mode 100644
index 6f205348b9a12eef65cce1c4da417ee1b7f1d511..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeElem.H
+++ /dev/null
@@ -1,95 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::treeElem
-
-Description
- Common functionality of treeNode and treeLeaf.
-
-SourceFiles
- treeElem.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef treeElem_H
-#define treeElem_H
-
-#include "treeBoundBox.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-/*---------------------------------------------------------------------------*\
- Class treeElem Declaration
-\*---------------------------------------------------------------------------*/
-
-template <class Type>
-class treeElem
-{
- // Private data
-
- //- Bounding box of this node
- treeBoundBox bb_;
-
-public:
-
- // Constructors
-
- //- Construct from bounding box
- treeElem(const treeBoundBox& bb)
- :
- bb_(bb)
- {}
-
-
- // Member Functions
-
- // Access
-
- //- Bounding box of this node
- const treeBoundBox& bb() const
- {
- return bb_;
- }
-
- //- Bounding box of this node
- treeBoundBox& bb()
- {
- return bb_;
- }
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeLeaf.C b/src/meshTools/octree/treeLeaf.C
deleted file mode 100644
index 8dc6694710c1e7432363cd066cb58aab22a99351..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeLeaf.C
+++ /dev/null
@@ -1,466 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "treeLeaf.H"
-#include "treeNode.H"
-#include "treeBoundBox.H"
-#include "octree.H"
-#include "HashSet.H"
-
-// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
-
-template <class Type>
-void Foam::treeLeaf<Type>::space(Ostream& os, const label n)
-{
- for (label i=0; i<n; i++)
- {
- os << ' ';
- }
-}
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct with given size
-template <class Type>
-Foam::treeLeaf<Type>::treeLeaf(const treeBoundBox& bb, const label size)
-:
- treeElem<Type>(bb), size_(0), indices_(size)
-{}
-
-
-// Construct from list
-template <class Type>
-Foam::treeLeaf<Type>::treeLeaf(const treeBoundBox& bb, const labelList& indices)
-:
- treeElem<Type>(bb), size_(indices.size()), indices_(indices)
-{
-}
-
-
-// Construct from Istream
-template <class Type>
-Foam::treeLeaf<Type>::treeLeaf(Istream& is)
-{
- is >> *this;
-}
-
-
-// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::treeLeaf<Type>::~treeLeaf()
-{}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-// Take cells at this level and distribute them to lower levels
-template <class Type>
-Foam::treeLeaf<Type>* Foam::treeLeaf<Type>::redistribute
-(
- const label level,
- octree<Type>& top,
- const Type& shapes
-)
-{
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "treeLeaf::redistribute with bb:" << this->bb() << endl;
- }
-
- if (size_ <= top.maxLeafRatio())
- {
- // leaf small enough
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "end of treeLeaf::redistribute : small enough" << endl;
- }
- return this;
- }
- else
- {
- // create treeNode for this level
- treeNode<Type>* treeNodePtr = new treeNode<Type>(this->bb());
-
- top.setNodes(top.nNodes() + 1);
-
- treeNodePtr->distribute
- (
- level,
- top,
- shapes,
- indices_
- );
-
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "end of treeLeaf::redistribute : done creating node"
- << this->bb() << endl;
- }
-
- // return pointer to let level above know.
- return reinterpret_cast<treeLeaf<Type>*>(treeNodePtr);
- }
-}
-
-
-// Set type of subnodes. Since contains elements return mixed type always.
-template <class Type>
-Foam::label Foam::treeLeaf<Type>::setSubNodeType
-(
- const label level,
- octree<Type>& top,
- const Type& shapes
-) const
-{
- if (size() == 0)
- {
- FatalErrorIn
- (
- "treeLeaf<Type>::setSubNodeType(const label, octree<Type>&, "
- "const Type&)"
- ) << "empty leaf. bb:" << this->bb()
- << abort(FatalError);
- }
- return octree<Type>::MIXED;
-}
-
-
-template <class Type>
-Foam::label Foam::treeLeaf<Type>::getSampleType
-(
- const label level,
- const octree<Type>& top,
- const Type& shapes,
- const point& sample
-) const
-{
- return shapes.getSampleType(top, sample);
-}
-
-
-template <class Type>
-Foam::label Foam::treeLeaf<Type>::find
-(
- const Type& shapes,
- const point& sample
-) const
-{
- forAll(indices_, i)
- {
- if (shapes.contains(indices_[i], sample))
- {
- return indices_[i];
- }
- }
-
- return -1;
-}
-
-
-template <class Type>
-bool Foam::treeLeaf<Type>::findTightest
-(
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest
-) const
-{
- bool changed = false;
-
- forAll(indices_, i)
- {
- changed |= shapes.findTightest
- (
- indices_[i],
- sample,
- tightest
- );
- }
-
- return changed;
-}
-
-
-template <class Type>
-bool Foam::treeLeaf<Type>::findNearest
-(
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
-) const
-{
- bool changed = false;
-
- forAll(indices_, i)
- {
- if (shapes.overlaps(indices_[i], tightest))
- {
- if (debug & 8)
- {
- //space(Pout, level);
- Pout<< "treeLeaf<Type>::findNearest : sample:" << sample
- << " shape:" << indices_[i] << " overlaps:" << tightest
- << endl;
- }
- point nearest;
- scalar thisDist = shapes.calcNearest(indices_[i], sample, nearest);
-
- if (thisDist < tightestDist)
- {
- // Construct new tightest Bb
- point dist(thisDist, thisDist, thisDist);
-
- tightest.min() = sample - dist;
- tightest.max() = sample + dist;
-
- // Update other return values
- tightestI = indices_[i];
-
- tightestDist = thisDist;
-
- changed = true;
-
- if (debug & 8)
- {
- //space(Pout, level);
- Pout<< "treeLeaf<Type>::findNearest : Found nearer : shape:"
- << tightestI << " distance:" << tightestDist
- << " to sample:" << sample << endl;
- }
- }
- }
- }
-
- if (changed)
- {
- if (debug & 8)
- {
- //space(Pout, level);
- Pout<< "treeLeaf<Type>::findNearest : sample:" << sample
- << " new nearer:" << tightestDist
- << endl;
- }
- }
- return changed;
-}
-
-
-template <class Type>
-bool Foam::treeLeaf<Type>::findNearest
-(
- const Type& shapes,
- const linePointRef& ln,
- treeBoundBox& tightest,
- label& tightestI,
- point& linePoint, // nearest point on line
- point& shapePoint // nearest point on shape
-) const
-{
- // Initial smallest distance
- scalar tightestDist = mag(linePoint - shapePoint);
-
- bool changed = false;
-
- forAll(indices_, i)
- {
- if (shapes.overlaps(indices_[i], tightest))
- {
- // Calculate nearest point on line and on shape.
- point linePt, shapePt;
- scalar thisDist = shapes.calcNearest
- (
- indices_[i],
- ln,
- linePt,
- shapePt
- );
-
- if (thisDist < tightestDist)
- {
- // Found nearer. Use.
- tightestDist = thisDist;
- tightestI = indices_[i];
- linePoint = linePt;
- shapePoint = shapePt;
- // Construct new tightest Bb. Nearest point can never be further
- // away than bounding box of line + margin equal to the distance
- vector span(thisDist, thisDist, thisDist);
-
- tightest.min() = min(ln.start(), ln.end()) - span;
- tightest.max() = max(ln.start(), ln.end()) + span;
-
- changed = true;
- }
- }
- }
-
- return changed;
-}
-
-
-template <class Type>
-bool Foam::treeLeaf<Type>::findBox
-(
- const Type& shapes,
- const boundBox& box,
- labelHashSet& elements
-) const
-{
- bool changed = false;
-
- forAll(indices_, i)
- {
- if (shapes.overlaps(indices_[i], box))
- {
- elements.insert(indices_[i]);
-
- changed = true;
- }
- }
-
- return changed;
-}
-
-
-template <class Type>
-void Foam::treeLeaf<Type>::printLeaf
-(
- Ostream& os,
- const label level
-) const
-{
- space(os, level);
-
- os << "leaf:" << this->bb()
- << " number of entries:" << indices().size() << endl;
-
- space(os, level);
-
- os << indices() << endl;
-}
-
-
-// Dump cube coordinates in OBJ format
-template <class Type>
-void Foam::treeLeaf<Type>::writeOBJ
-(
- Ostream& os,
- const label level,
- label& vertNo
-) const
-{
- point min = this->bb().min();
- point max = this->bb().max();
-
- os << "v " << min.x() << " " << min.y() << " " << min.z() << endl;
- os << "v " << max.x() << " " << min.y() << " " << min.z() << endl;
- os << "v " << max.x() << " " << max.y() << " " << min.z() << endl;
- os << "v " << min.x() << " " << max.y() << " " << min.z() << endl;
-
- os << "v " << min.x() << " " << min.y() << " " << max.z() << endl;
- os << "v " << max.x() << " " << min.y() << " " << max.z() << endl;
- os << "v " << max.x() << " " << max.y() << " " << max.z() << endl;
- os << "v " << min.x() << " " << max.y() << " " << max.z() << endl;
-
- os << "l " << vertNo << " " << vertNo+1 << endl;
- os << "l " << vertNo+1 << " " << vertNo+2 << endl;
- os << "l " << vertNo+2 << " " << vertNo+3 << endl;
- os << "l " << vertNo+3 << " " << vertNo << endl;
-
- os << "l " << vertNo+4 << " " << vertNo+5 << endl;
- os << "l " << vertNo+5 << " " << vertNo+6 << endl;
- os << "l " << vertNo+6 << " " << vertNo+7 << endl;
- os << "l " << vertNo+7 << " " << vertNo << endl;
-
- os << "l " << vertNo << " " << vertNo+4 << endl;
- os << "l " << vertNo+1 << " " << vertNo+5 << endl;
- os << "l " << vertNo+2 << " " << vertNo+6 << endl;
- os << "l " << vertNo+3 << " " << vertNo+7 << endl;
-
- vertNo += 8;
-}
-
-
-template <class Type>
-Foam::label Foam::treeLeaf<Type>::countLeaf
-(
- Ostream& os,
- const label level
-) const
-{
- label nItems = size();
-
- space(os, level);
-
- os << "leaf:" << this->bb() << " has size:" << nItems << endl;
-
- return nItems;
-}
-
-
-// * * * * * * * * * * * * * * * Friend Operators * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::Istream& Foam::operator>> (Istream& is, treeLeaf<Type>& leaf)
-{
- is >> leaf.bb() >> leaf.indices_;
-
- // Was written trimmed
- leaf.size_ = leaf.indices_.size();
- return is;
-}
-
-
-template <class Type>
-Foam::Ostream& Foam::operator<< (Ostream& os, const treeLeaf<Type>& leaf)
-{
- os << leaf.bb();
-
- if (leaf.indices().size() == leaf.size())
- {
- os << leaf.indices();
- }
- else
- {
- // Storage not trimmed
- os << token::SPACE << leaf.size() << token::SPACE << token::BEGIN_LIST;
- forAll(leaf, i)
- {
- os << token::SPACE << leaf.indices()[i];
- }
- os << token::END_LIST;
- }
- return os;
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeLeaf.H b/src/meshTools/octree/treeLeaf.H
deleted file mode 100644
index 3de280a4568c22a8404f6656c12931efdb8e0ab9..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeLeaf.H
+++ /dev/null
@@ -1,283 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::treeLeaf
-
-Description
- An octree treeLeaf.
-
-SourceFiles
- treeLeaf.C
- octreeDataPointTreaLeaf.H (specialization for points)
- octreeDataPointTreeLeaf.C
- octreeDataTriSurfaceTreeLeaf.H (specialization for triSurface)
- octreeDataTriSurfaceTreeLeaf.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef treeLeaf_H
-#define treeLeaf_H
-
-#include "labelList.H"
-#include "treeElem.H"
-#include "boolList.H"
-#include "linePointRef.H"
-#include "HashSet.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-class treeBoundBox;
-class Ostream;
-
-template<class Type> class octree;
-template<class Type> class treeLeaf;
-
-// Forward declaration of friend functions and operators
-
-template<class Type> Istream& operator>>(Istream&, treeLeaf<Type>&);
-template<class Type> Ostream& operator<<(Ostream&, const treeLeaf<Type>&);
-
-
-/*---------------------------------------------------------------------------*\
- Class treeLeafName Declaration
-\*---------------------------------------------------------------------------*/
-
-TemplateName(treeLeaf);
-
-
-/*---------------------------------------------------------------------------*\
- Class treeLeaf Declaration
-\*---------------------------------------------------------------------------*/
-
-template <class Type>
-class treeLeaf
-:
- public treeElem<Type>,
- public treeLeafName
-{
- // Private data
-
- // Keeps real size (at construction time indices_ might be untrimmed)
- label size_;
-
- // Indices of 'things' whose bb overlaps leaf bb.
- labelList indices_;
-
-
- // Private Member Functions
-
- static void space(Ostream&, const label);
-
- //- Disallow default bitwise copy construct
- treeLeaf(const treeLeaf&);
-
- //- Disallow default bitwise assignment
- void operator=(const treeLeaf&);
-
-
-public:
-
- // Constructors
-
- //- Construct with size
- treeLeaf(const treeBoundBox& bb, const label size);
-
- //- Construct from list
- treeLeaf(const treeBoundBox& bb, const labelList& indices);
-
- //- Construct from Istream
- treeLeaf(Istream&);
-
-
- //- Destructor
- ~treeLeaf();
-
-
- // Member Functions
-
- // Access
-
- label size() const
- {
- return size_;
- }
-
- const labelList& indices() const
- {
- return indices_;
- }
-
- // Edit
-
- void insert(const label index)
- {
- if (size_ >= indices_.size())
- {
- FatalErrorIn
- (
- "treeLeaf<Type>::insert(index)"
- )
- << "overflow"
- << " size_ :" << size_
- << " size():" << indices_.size()
- << abort(FatalError);
- }
- indices_[size_++] = index;
- }
-
- void trim()
- {
- if (size_ == 0)
- {
- FatalErrorIn
- (
- "treeLeaf<Type>::trim()"
- )
- << "Trying to trim empty leaf: " << endl
- << " size_ :" << size_
- << " size():" << indices_.size()
- << abort(FatalError);
- }
- indices_.setSize(size_);
- }
-
- //- Take indices at refineLevel and distribute them to lower levels
- treeLeaf<Type>* redistribute
- (
- const label,
- octree<Type>&,
- const Type&
- );
-
- label setSubNodeType
- (
- const label level,
- octree<Type>& top,
- const Type& shapes
- ) const;
-
- // Search
-
- //- Get type of sample
- label getSampleType
- (
- const label level,
- const octree<Type>& top,
- const Type& shapes,
- const point& sample
- ) const;
-
- //- Find index of shape containing sample
- label find
- (
- const Type& shapes,
- const point& sample
- ) const;
-
- //- Find tightest fitting bounding box in leaf
- bool findTightest
- (
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Find nearest point.
- bool findNearest
- (
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
- ) const;
-
- //- Find nearest shape to line
- // Returns true if found nearer shape and updates nearest and
- // tightest
- bool findNearest
- (
- const Type& shapes,
- const linePointRef& ln,
- treeBoundBox& tightest,
- label& tightestI, // index of nearest shape
- point& linePoint, // nearest point on line
- point& shapePoint // nearest point on shape
- ) const;
-
- //- Find shapes not outside box. Return true if anything found.
- bool findBox
- (
- const Type& shapes,
- const boundBox& bb,
- labelHashSet& elements
- ) const;
-
- // Write
-
- //- Debug: print a leaf
- void printLeaf(Ostream&, const label) const;
-
- //- Debug: Write bb in OBJ format
- void writeOBJ
- (
- Ostream& os,
- const label level,
- label& vertNo
- ) const;
-
- //- debug:
- label countLeaf(Ostream&, const label) const;
-
-
- // IOstream Operators
-
- friend Istream& operator>> <Type>(Istream&, treeLeaf<Type>&);
- friend Ostream& operator<< <Type>(Ostream&, const treeLeaf<Type>&);
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#ifdef NoRepository
-# include "treeLeaf.C"
-#endif
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#include "octreeDataPointTreeLeaf.H"
-#include "octreeDataTriSurfaceTreeLeaf.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeLeafName.C b/src/meshTools/octree/treeLeafName.C
deleted file mode 100644
index c4c41b240b6a5a19ba1a88a1ded6a794533c261e..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeLeafName.C
+++ /dev/null
@@ -1,32 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "treeLeaf.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-defineTypeNameAndDebug(Foam::treeLeafName, 0);
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeNode.C b/src/meshTools/octree/treeNode.C
deleted file mode 100644
index 7fa925a4f57f3d4afa761306f5cac35a1eeb337e..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeNode.C
+++ /dev/null
@@ -1,1423 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "treeNode.H"
-#include "octree.H"
-#include "treeLeaf.H"
-#include "treeBoundBox.H"
-#include "long.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-template <class Type>
-const Foam::label Foam::treeNode<Type>::leafOffset(100);
-
-
-// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
-
-template <class Type>
-void Foam::treeNode<Type>::setAsNode(const label octant)
-{
- subNodeTypes_ |= (0x1 << octant);
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::setAsLeaf(const label octant)
-{
- subNodeTypes_ &= ~(0x1 << octant);
-}
-
-
-// Set pointer to sub node
-template <class Type>
-void Foam::treeNode<Type>::setNodePtr
-(
- const label octant,
- treeElem<Type>* treeNodePtr
-)
-{
- setAsNode(octant);
- subNodes_[octant] = treeNodePtr;
-}
-
-
-// Set pointer to sub leaf
-template <class Type>
-void Foam::treeNode<Type>::setLeafPtr
-(
- const label octant,
- treeElem<Type>* treeLeafPtr
-)
-{
- setAsLeaf(octant);
- subNodes_[octant] = treeLeafPtr;
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::setVolType
-(
- const label octant,
- const label type
-)
-{
- if ((type < 0) || (type > 3))
- {
- FatalErrorIn("treeNode<Type>::setVolType(const label, const label)")
- << "Type " << type << " not within range 0..3" << endl;
- }
-
- // Clear out two bits at position 2*octant
- volType_ &= ~(0x3 << 2*octant);
-
- // Add the two bits of type
- volType_ |= (type << 2*octant);
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::space(Ostream& os, const label n)
-{
- for (label i=0; i<n; i++)
- {
- os << ' ';
- }
-}
-
-
-// look in single octant starting from <start>
-template <class Type>
-const Foam::treeLeaf<Type>* Foam::treeNode<Type>::findLeafLineOctant
-(
- const int level,
- const Type& shapes,
- const label octant,
- const vector& direction,
- point& start,
- const point& end
-) const
-{
- static const char* functionName =
- "treeNode<Type>::findLeafLineOctant"
- "(const int, const Type&, const label, const vector&,"
- " point&, const point&)";
-
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLineOctant : bb:" << this->bb()
- << " start:" << start
- << " end:" << end
- << " mid:" << midpoint()
- << " Searching octant:" << octant
- << endl;
- }
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node: recurse into subnodes
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
-
- if (subNodePtr->bb().contains(direction, start))
- {
- // Search on lower level
- const treeLeaf<Type>* subLeafPtr = subNodePtr->findLeafLine
- (
- level + 1,
- shapes,
- start,
- end
- );
-
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLineOctant : bb:" << this->bb()
- << " returning from sub treeNode"
- << " with start:" << start << " subLeaf:"
- << long(subLeafPtr) << endl;
- }
-
- return subLeafPtr;
- }
- else
- {
- FatalErrorIn(functionName)
- << "Sub node " << subNodePtr->bb()
- << " at octant " << octant
- << " does not contain start " << start
- << abort(FatalError);
- }
- }
- else
- {
- // Leaf
- const treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
-
- if (subLeafPtr->bb().contains(direction, start))
- {
- // Step to end of subleaf bb
- point tmp;
- if
- (
- !subLeafPtr->bb().intersects
- (
- end,
- start,
- tmp
- )
- )
- {
- FatalErrorIn(functionName)
- << "Sub leaf contains start " << start
- << " but line does not intersect its bb "
- << subLeafPtr->bb()
- << abort(FatalError);
- }
- start = tmp;
-
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLineOctant : returning from intersecting"
- << " treeLeaf " << subLeafPtr->bb()
- << " with start:" << start << " subLeaf:"
- << long(subLeafPtr) << endl;
- }
-
- return subLeafPtr;
- }
- else
- {
- FatalErrorIn(functionName)
- << "Sub leaf " << subLeafPtr->bb()
- << " at octant " << octant
- << " does not contain start " << start
- << abort(FatalError);
- }
- }
- }
- else
- {
- // Empty subNode. Transfer across.
- const treeBoundBox emptyBb = this->bb().subBbox(midpoint(), octant);
-
- if (emptyBb.contains(direction, start))
- {
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLineOctant : Empty node. Octant:" << octant
- << " start:" << start
- << " bb:" << this->bb()
- << " emptyBb:" << emptyBb << endl;
- }
-
- // Update start by clipping to emptyBb
- point tmp;
- if
- (
- !emptyBb.intersects
- (
- end,
- start,
- tmp
- )
- )
- {
- FatalErrorIn(functionName)
- << "Empty node contains start " << start
- << " but line does not intersect its (calculated)"
- << " bb " << emptyBb
- << endl << "This might be due to truncation error"
- << abort(FatalError);
- }
- start = tmp;
-
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLineOctant : returning from intersecting with"
- << " empty " << emptyBb
- << " with start:" << start << " subLeaf:" << 0 << endl;
- }
-
- return NULL;
- }
- else
- {
- FatalErrorIn(functionName)
- << "Empty node " << emptyBb
- << " at octant " << octant
- << " does not contain start " << start
- << abort(FatalError);
- }
- }
-
- FatalErrorIn(functionName)
- << "Octant " << octant << " of cube " << this->bb()
- << " does not contain start " << start
- << abort(FatalError);
-
- return NULL;
-}
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct from components
-template <class Type>
-Foam::treeNode<Type>::treeNode(const treeBoundBox& bb)
-:
- treeElem<Type>(bb),
- treeNodeName(),
- mid_(bb.midpoint()),
- subNodeTypes_(0),
- volType_(0)
-{
- for (label octantI=0; octantI<8; octantI++)
- {
- subNodes_[octantI] = NULL;
- setVolType(octantI, octree<Type>::UNKNOWN);
- }
-}
-
-
-// Construct from Istream
-template <class Type>
-Foam::treeNode<Type>::treeNode(Istream& is)
-{
- is >> *this;
-}
-
-
-// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::treeNode<Type>::~treeNode()
-{
- for (int octant=0; octant<8; octant++)
- {
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- delete getNodePtr(octant);
- }
- else
- {
- delete getLeafPtr(octant);
- }
- }
- }
-}
-
-
-// * * * * * * * * * * * * * * * Member Operators * * * * * * * * * * * * * //
-
-// Distributes cells to subLeaves
-template <class Type>
-void Foam::treeNode<Type>::distribute
-(
- const label level,
- octree<Type>& top,
- const Type& shapes,
- const labelList& indices
-)
-{
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "treeNode::distributing " << indices.size() << endl;
- }
-
- // Create subLeaves if necessary
- for (label octant=0; octant<8; octant++)
- {
- if (subNodes()[octant])
- {
- printNode(Pout, level);
- FatalErrorIn
- (
- "treeNode<Type>::distribute(const label, octree<Type>&, "
- "const Type&, const labelList&)"
- ) << "subNode already available at octant:" << octant
- << abort(FatalError);
- }
- else
- {
- treeLeaf<Type>* subLeafPtr = new treeLeaf<Type>
- (
- this->bb().subBbox(midpoint(), octant),
- indices.size()
- );
-
- top.setLeaves(top.nLeaves() + 1);
- setLeafPtr(octant, subLeafPtr);
- }
- }
-
-
- // add cells to correct sub leaf
- forAll(indices, i)
- {
- const label shapei = indices[i];
-
- for (label octant=0; octant<8; octant++)
- {
- treeLeaf<Type>* leafPtr = getLeafPtr(octant);
-
- if (shapes.overlaps(shapei, leafPtr->bb()))
- {
- if (debug == 1)
- {
- space(Pout, level);
- Pout<< "inserting " << shapei;
- shapes.write(Pout, shapei);
- Pout<< " into " << leafPtr->bb() << endl;
- }
- leafPtr->insert(shapei);
- top.setEntries(top.nEntries() + 1);
- }
- }
- }
-
- // Trim size of subLeaves
- for (label octant=0; octant<8; octant++)
- {
- treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
-
- if (subLeafPtr->size() == 0)
- {
- // Contains no data. Delete.
- setLeafPtr(octant, NULL);
- delete subLeafPtr;
- top.setLeaves(top.nLeaves() - 1);
- }
- else
- {
- // Trim to actual size.
- subLeafPtr->trim();
- }
- }
-
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "end of treeNode::distribute" << endl;
- }
-}
-
-
-// Descends to refineLevel and checks the subLeaves for redistribution
-template <class Type>
-void Foam::treeNode<Type>::redistribute
-(
- const label level,
- octree<Type>& top,
- const Type& shapes,
- const label refineLevel
-)
-{
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "treeNode::redistribute with level:" << level
- << " refineLevel:" << refineLevel << endl;
- }
-
- // Descend to correct level
- if (level < refineLevel)
- {
- for (label octant=0; octant<8; octant++)
- {
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- getNodePtr(octant)->redistribute
- (
- level+1,
- top,
- shapes,
- refineLevel
- );
- }
- }
- }
- }
- else
- {
- // Reached correct (should also be deepest) level of treeNode
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "treeNode::redistribute : now at correct level" << endl;
- }
-
- // handle redistribution of sub leaves
- for (label octant=0; octant<8; octant++)
- {
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- FatalErrorIn
- (
- "treeNode<Type>::redistribute(const int, octree& top,"
- "const int, const treeBoundBox&)"
- ) << "found treeNode instead of treeLeaf" << endl
- << abort(FatalError);
- }
- else
- {
- treeLeaf<Type>* leafPtr = getLeafPtr(octant);
-
- treeLeaf<Type>* newSubPtr = leafPtr->redistribute
- (
- level,
- top,
- shapes
- );
-
- if (newSubPtr && (newSubPtr != leafPtr))
- {
- // redistribute has created nodePtr
- // so delete no longer used subPtr and update info
- if (debug & 1)
- {
- Pout<< "deleting "
- << top.nEntries() - leafPtr->size()
- << " entries" << endl;
- }
- top.setEntries(top.nEntries() - leafPtr->size());
-
- delete leafPtr;
-
- top.setLeaves(top.nLeaves() - 1);
-
- setNodePtr(octant, newSubPtr);
- }
- }
- }
- }
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "end of treeNode::redistribute for correct level" << endl;
- }
- }
-
- if (debug & 1)
- {
- space(Pout, level);
- Pout<< "return from treeNode::redistribute with bb:" << this->bb()
- << endl;
- }
-}
-
-
-// Set type of node.
-template <class Type>
-Foam::label Foam::treeNode<Type>::setSubNodeType
-(
- const label level,
- octree<Type>& top,
- const Type& shapes
-)
-{
- if (debug & 4)
- {
- space(Pout, level);
- Pout<< "treeNode::setSubNodeType with level:" << level
- << " bb:" << this->bb() << endl;
- }
-
- label myType = -1;
-
- for (label octant=0; octant<8; octant++)
- {
- label subType = -1;
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- subType = getNodePtr(octant)->setSubNodeType
- (
- level+1,
- top,
- shapes
- );
- }
- else
- {
- subType = getLeafPtr(octant)->setSubNodeType
- (
- level+1,
- top,
- shapes
- );
- }
- }
- else
- {
- // No data in this one. Set type for octant acc. to its bounding
- // box.
- const treeBoundBox subBb = this->bb().subBbox(midpoint(), octant);
-
- subType = shapes.getSampleType(top, subBb.midpoint());
- }
-
- if (debug & 4)
- {
- space(Pout, level);
- Pout<< "treeNode::setSubNodeType : setting octant with bb:"
- << this->bb().subBbox(midpoint(), octant)
- << " to type:" << octree<Type>::volType(subType) << endl;
- }
- setVolType(octant, subType);
-
- // Combine sub node types into type for treeNode. Result is 'mixed' if
- // types differ among subnodes.
- if (myType == -1)
- {
- myType = subType;
- }
- else if (subType != myType)
- {
- myType = octree<Type>::MIXED;
- }
- }
-
- if (debug & 4)
- {
- space(Pout, level);
- Pout<< "return from treeNode::setSubNodeType with type:"
- << octree<Type>::volType(myType)
- << " bb:" << this->bb() << endl;
- }
-
- return myType;
-}
-
-
-// Get type of node.
-template <class Type>
-Foam::label Foam::treeNode<Type>::getSampleType
-(
- const label level,
- const octree<Type>& top,
- const Type& shapes,
- const point& sample
-) const
-{
- if (debug & 4)
- {
- space(Pout, level);
- Pout<< "treeNode::getSampleType with level:" << level
- << " bb:" << this->bb() << " sample:" << sample << endl;
- }
-
- // Determine octant of bb. If on edge just use whichever octant.
- bool onEdge = false;
-
- label octant = this->bb().subOctant(midpoint(), sample, onEdge);
-
- label type = getVolType(octant);
-
- if (type == octree<Type>::MIXED)
- {
- // At this level multiple sub types. Recurse to resolve.
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node: recurse into subnodes
- type = getNodePtr(octant)->getSampleType
- (
- level + 1,
- top,
- shapes,
- sample
- );
- }
- else
- {
- // Leaf
- type = getLeafPtr(octant)->getSampleType
- (
- level + 1,
- top,
- shapes,
- sample
- );
- }
- }
- else
- {
- // Problem: empty subnode should have a type
- FatalErrorIn
- (
- "treeNode<Type>::getSampleType"
- "(const label, octree<Type>&, const Type&, const point&)"
- ) << "Empty node bb:" << this->bb().subBbox(midpoint(), octant)
- << " has non-mixed type:"
- << octree<Type>::volType(type)
- << abort(FatalError);
- }
- }
-
- if (type == octree<Type>::MIXED)
- {
- FatalErrorIn
- (
- "treeNode<Type>::getSampleType"
- "(const label, octree<Type>&, const Type&, const point&)"
- ) << "Type is MIXED when searching for " << sample
- << " at level " << this->bb() << endl
- << "This probably is because the octree has not been constructed"
- << " with search facility." << exit(FatalError);
- }
-
- if (debug & 4)
- {
- space(Pout, level);
- Pout<< "return from treeNode::getSampleType with type:"
- << octree<Type>::volType(type)
- << " bb:" << this->bb()
- << " sample:" << sample << endl;
- }
- return type;
-}
-
-
-template <class Type>
-Foam::label Foam::treeNode<Type>::find
-(
- const Type& shapes,
- const point& sample
-) const
-{
- // Find octant of sample. Don't care if on edge (since any item on edge
- // will have been inserted in both subcubes)
- bool onEdge = false;
-
- label octant = this->bb().subOctant(midpoint(), sample, onEdge);
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node: recurse into subnodes
- return getNodePtr(octant)->find(shapes, sample);
- }
- else
- {
- // Leaf: let leaf::find handle this
- return getLeafPtr(octant)->find(shapes, sample);
- }
- }
- return -1;
-}
-
-
-template <class Type>
-bool Foam::treeNode<Type>::findTightest
-(
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest
-) const
-{
- bool changed = false;
- bool onEdge = false;
- // Estimate for best place to start searching
- label sampleOctant = this->bb().subOctant(midpoint(), sample, onEdge);
-
- // Go into all suboctants (one containing sample first) and update tightest.
- // Order of visiting is if e.g. sampleOctant = 5:
- // 5 1 2 3 4 0 6 7
- for (label octantI=0; octantI<8; octantI++)
- {
- label octant;
- if (octantI == 0)
- {
- // Use sampleOctant first
- octant = sampleOctant;
- }
- else if (octantI == sampleOctant)
- {
- octant = 0;
- }
- else
- {
- octant = octantI;
- }
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node: recurse into subnodes
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
-
- if (subNodePtr->bb().overlaps(tightest))
- {
- // there might be a better fit inside this subNode
- changed |= subNodePtr->findTightest
- (
- shapes,
- sample,
- tightest
- );
- }
- }
- else
- {
- // Leaf: let leaf::find handle this
- const treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
-
- if (subLeafPtr->bb().overlaps(tightest))
- {
- // there might be a better fit inside this subLeaf
- changed |= subLeafPtr->findTightest
- (
- shapes,
- sample,
- tightest
- );
- }
- }
- }
- }
-
- return changed;
-}
-
-
-template <class Type>
-bool Foam::treeNode<Type>::findNearest
-(
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
-) const
-{
- if (debug & 8)
- {
- Pout<< "In findNearest with sample:" << sample << " cube:"
- << this->bb() << " tightest:" << tightest << endl;
- }
-
- bool changed = false;
- bool onEdge = false;
- // Estimate for best place to start searching
- label sampleOctant = this->bb().subOctant(midpoint(), sample, onEdge);
-
- // Go into all suboctants (one containing sample first) and update tightest.
- // Order of visiting is if e.g. sampleOctant = 5:
- // 5 1 2 3 4 0 6 7
- for (label octantI=0; octantI<8; octantI++)
- {
- label octant;
- if (octantI == 0)
- {
- // Use sampleOctant first
- octant = sampleOctant;
- }
- else if (octantI == sampleOctant)
- {
- octant = 0;
- }
- else
- {
- octant = octantI;
- }
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
-
- if (subNodePtr->bb().overlaps(tightest))
- {
- // there might be a better fit inside this subNode
- changed |= subNodePtr->findNearest
- (
- shapes,
- sample,
- tightest,
- tightestI,
- tightestDist
- );
- }
- }
- else
- {
- // Leaf: let leaf::find handle this
- const treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
-
- if (subLeafPtr->bb().overlaps(tightest))
- {
- // there might be a better fit inside this subNode
- changed |= subLeafPtr->findNearest
- (
- shapes,
- sample,
- tightest,
- tightestI,
- tightestDist
- );
- }
- }
- }
- }
-
- if (debug & 8)
- {
- Pout<< "Exiting findNearest for sample:" << sample << " cube:"
- << this->bb() << " tightestI:" << tightestI << endl;
- }
-
- return changed;
-}
-
-
-template <class Type>
-bool Foam::treeNode<Type>::findNearest
-(
- const Type& shapes,
- const linePointRef& ln,
- treeBoundBox& tightest,
- label& tightestI,
- point& linePoint, // nearest point on line
- point& shapePoint // nearest point on shape
-) const
-{
- bool changed = false;
- bool onEdge = false;
- // Estimate for best place to start searching
- label sampleOctant = this->bb().subOctant(midpoint(), ln.centre(), onEdge);
-
- // Go into all suboctants (one containing sample first) and update tightest.
- // Order of visiting is if e.g. sampleOctant = 5:
- // 5 1 2 3 4 0 6 7
- for (label octantI=0; octantI<8; octantI++)
- {
- label octant;
- if (octantI == 0)
- {
- // Use sampleOctant first
- octant = sampleOctant;
- }
- else if (octantI == sampleOctant)
- {
- octant = 0;
- }
- else
- {
- octant = octantI;
- }
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
-
- if (subNodePtr->bb().overlaps(tightest))
- {
- // there might be a better fit inside this subNode
- changed |= subNodePtr->findNearest
- (
- shapes,
- ln,
- tightest,
- tightestI,
- linePoint,
- shapePoint
- );
- }
- }
- else
- {
- // Leaf: let leaf::find handle this
- const treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
-
- if (subLeafPtr->bb().overlaps(tightest))
- {
- // there might be a better fit inside this subNode
- changed |= subLeafPtr->findNearest
- (
- shapes,
- ln,
- tightest,
- tightestI,
- linePoint,
- shapePoint
- );
- }
- }
- }
- }
-
- return changed;
-}
-
-
-template <class Type>
-bool Foam::treeNode<Type>::findBox
-(
- const Type& shapes,
- const boundBox& box,
- labelHashSet& elements
-) const
-{
- bool changed = false;
- bool onEdge = false;
- // Estimate for best place to start searching
- label sampleOctant = this->bb().subOctant
- (
- midpoint(),
- box.midpoint(),
- onEdge
- );
-
- // Go into all suboctants (one containing sample first) and update tightest.
- // Order of visiting is if e.g. sampleOctant = 5:
- // 5 1 2 3 4 0 6 7
- for (label octantI=0; octantI<8; octantI++)
- {
- label octant;
- if (octantI == 0)
- {
- // Use sampleOctant first
- octant = sampleOctant;
- }
- else if (octantI == sampleOctant)
- {
- octant = 0;
- }
- else
- {
- octant = octantI;
- }
-
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
-
- if (subNodePtr->bb().overlaps(box))
- {
- // Visit sub node.
- changed |= subNodePtr->findBox(shapes, box, elements);
- }
- }
- else
- {
- // Leaf: let leaf::find handle this
- const treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
-
- if (subLeafPtr->bb().overlaps(box))
- {
- // Visit sub leaf.
- changed |= subLeafPtr->findBox(shapes, box, elements);
- }
- }
- }
- }
-
- return changed;
-}
-
-
-// look from <start> in current cube (given by this->bb()).
-template <class Type>
-const Foam::treeLeaf<Type>* Foam::treeNode<Type>::findLeafLine
-(
- const int level,
- const Type& shapes,
- point& start,
- const point& end
-) const
-{
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLine : bb:" << this->bb() << " mid:" << midpoint()
- << " start:" << start << endl;
- }
-
- scalar typDim = this->bb().avgDim();
-
- const vector direction = end - start;
-
- // Loop on current level until start has been updated to be outside
- // of this->bb(). Note that max only four subcubes can be crossed so this is
- // check on whether there are any truncation error problems.
-
- label iter = 0;
-
- while (true)
- {
- if (!this->bb().contains(direction, start))
- {
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLine : Start not inside bb " << this->bb()
- << ". Returning with start:" << start << " subLeaf:"
- << 0 << endl;
- }
- return NULL;
- }
-
- // Check if start and <end> equal
- if ((mag(start - end)/typDim) < SMALL)
- {
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLine : start equals end"
- << ". Returning with start:" << start << " subLeaf:"
- << 0 << endl;
- }
- return NULL;
- }
-
- if (iter >= 4)
- {
- // Too many iterations. Is hanging. Handle outside of loop.
- break;
- }
-
- bool onEdge = false;
- label octant = this->bb().subOctant
- (
- midpoint(), direction, start, onEdge
- );
-
- // Try finding non-empty treeleaf in octant
- const treeLeaf<Type>* leafPtr = findLeafLineOctant
- (
- level,
- shapes,
- octant,
- direction,
- start,
- end
- );
-
- if (leafPtr)
- {
- // Found treeLeaf -> return
- if (debug & 2)
- {
- space(Pout, 2*level);
- Pout<< "findLeafLine : Found treeLeaf"
- << ". Returning with start:" << start << " subLeaf:"
- << long(leafPtr) << endl;
- }
-
- return leafPtr;
- }
-
- iter++;
- }
-
- // Check if is hanging. Max 4 octants can be crossed by a straight line
- FatalErrorIn
- (
- "treeNode<Type>::findLeafLine"
- "(const label, octree<Type>&, point&,"
- " const point&)"
- ) << "Did not leave bb " << this->bb()
- << " after " << iter
- << " iterations of updating starting point."
- << "start:" << start << " end:" << end
- << abort(FatalError);
-
- return NULL;
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::findLeaves
-(
- List<treeLeaf<Type>*>& leafArray,
- label& leafIndex
-) const
-{
- // Go into all sub boxes
- for (label octant=0; octant<8; octant++)
- {
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node: recurse into subnodes
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
- subNodePtr->findLeaves(leafArray, leafIndex);
- }
- else
- {
- // Leaf: store
- treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
- leafArray[leafIndex++] = subLeafPtr;
- }
- }
- }
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::findLeaves
-(
- List<const treeLeaf<Type>*>& leafArray,
- label& leafIndex
-) const
-{
- // Go into all sub boxes
- for (label octant=0; octant<8; octant++)
- {
- if (subNodes()[octant])
- {
- if (isNode(octant))
- {
- // Node: recurse into subnodes
- const treeNode<Type>* subNodePtr = getNodePtr(octant);
- subNodePtr->findLeaves(leafArray, leafIndex);
- }
- else
- {
- // Leaf: store
- treeLeaf<Type>* subLeafPtr = getLeafPtr(octant);
- leafArray[leafIndex++] = subLeafPtr;
- }
- }
- }
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::printNode
-(
- Ostream& os,
- const label level
-) const
-{
- space(os, 2*level);
-
- os << "node:" << this->bb() << endl;
-
- for (label octant=0; octant<8; octant++)
- {
- label type = getVolType(octant);
-
- string typeString = octree<Type>::volType(type);
-
- if (!subNodes_[octant])
- {
- space(os, level);
- os << octant << ":" << typeString << " : null" << endl;
- }
- else if (isNode(octant))
- {
- space(os, level);
- os << octant << ":" << typeString << " : node" << endl;
- getNodePtr(octant)->printNode(os, level+1);
- }
- else
- {
- space(os, level);
- os << octant << ":" << typeString << " : leaf" << endl;
-
- treeLeaf<Type>* leafPtr = getLeafPtr(octant);
- leafPtr->printLeaf(os, level+1);
- }
- }
-}
-
-
-template <class Type>
-void Foam::treeNode<Type>::writeOBJ
-(
- Ostream& os,
- const label level,
- label& vertNo
-) const
-{
- point midPoint(this->bb().midpoint());
-
- label midVertNo = vertNo;
- os << "v " << midPoint.x() << " " << midPoint.y() << " "
- << midPoint.z() << endl;
- vertNo++;
-
- for (label octant=0; octant<8; octant++)
- {
- if (subNodes_[octant])
- {
- if (isNode(octant))
- {
- treeNode<Type>* nodePtr = getNodePtr(octant);
-
- point subMidPoint(nodePtr->bb().midpoint());
- os << "v " << subMidPoint.x() << " " << subMidPoint.y() << " "
- << subMidPoint.z() << endl;
- os << "l " << midVertNo + 1<< " " << vertNo + 1 << endl;
- vertNo++;
-
- nodePtr->writeOBJ(os, level+1, vertNo);
- }
- else
- {
- treeLeaf<Type>* leafPtr = getLeafPtr(octant);
-
- point subMidPoint(leafPtr->bb().midpoint());
- os << "v " << subMidPoint.x() << " " << subMidPoint.y() << " "
- << subMidPoint.z() << endl;
- os << "l " << midVertNo + 1<< " " << vertNo + 1 << endl;
- vertNo++;
-
- //leafPtr->writeOBJ(os, level+1, vertNo);
- }
- }
- }
-}
-
-
-// * * * * * * * * * * * * * * * Friend Operators * * * * * * * * * * * * * //
-
-template <class Type>
-Foam::Istream& Foam::operator>>(Istream& is, treeNode<Type>& oc)
-{
- for (label octant = 0; octant < 8; octant++)
- {
- oc.subNodes_[octant] = NULL;
- }
-
- is >> oc.bb();
-
- label nPtrs;
-
- // Read number of entries folllowing
- is >> nPtrs;
-
- is.readBegin("treeNode");
- for (label octant = 0; octant < nPtrs; octant++)
- {
- label index;
- is >> index;
-
- if (index >= treeNode<Type>::leafOffset)
- {
- // Leaf recognized by out of range index
- treeLeaf<Type>* leafPtr = new treeLeaf<Type>(is);
- oc.setLeafPtr(index - treeNode<Type>::leafOffset, leafPtr);
- }
- else
- {
- oc.setNodePtr(index, new treeNode<Type>(is));
- }
- }
-
- // Read end of treeNode list
- is.readEnd("treeNode");
-
- // Check state of Istream
- is.check("Istream& operator>>(Istream&, treeNode&)");
-
- return is;
-}
-
-
-template <class Type>
-Foam::Ostream& Foam::operator<<(Ostream& os, const treeNode<Type>& tn)
-{
- // Count valid subnodes:
- // - treeNode
- // - treeLeafs with non-zero cell list.
- label nPtrs = 0;
- for (label octant = 0; octant < 8; octant++)
- {
- if (tn.subNodes_[octant])
- {
- if (tn.isNode(octant) || tn.getLeafPtr(octant)->indices().size())
- {
- nPtrs++;
- }
- }
- }
-
-
- // output subnodes as list of length nPtrs
- os << token::SPACE << tn.bb() << token::SPACE << nPtrs
- << token::SPACE << token::BEGIN_LIST;
-
- for (label octant = 0; octant < 8; octant++)
- {
- if (tn.subNodes_[octant])
- {
- if (tn.isNode(octant))
- {
- const treeNode<Type>* subNodePtr = tn.getNodePtr(octant);
-
- // Node: output index, value
- os << token::SPACE << octant << token::SPACE << *subNodePtr
- << token::NL;
- }
- else if (tn.getLeafPtr(octant)->indices().size())
- {
- // treeLeaf: mark by putting index invalid
- const treeLeaf<Type>* subLeafPtr = tn.getLeafPtr(octant);
-
- os << token::SPACE << octant + treeNode<Type>::leafOffset
- << token::SPACE << *subLeafPtr
- << token::NL;
- }
- }
- }
-
- os << token::SPACE << token::END_LIST;
-
- return os;
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeNode.H b/src/meshTools/octree/treeNode.H
deleted file mode 100644
index 200f302a84b7a51816addc563b400ca110c280c5..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeNode.H
+++ /dev/null
@@ -1,345 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::treeNode
-
-Description
- Class to implement octree.
-
- Holds the pointers to sub-octants. These are either other treeNodes or
- treeLeafs. The treeLeafs hold the actual data as a list of indices into
- octreeData.
-
-Note
- To prevent calculation errors all bounding boxes used in octrees are
- calculated only once.
-
- The pointers to either treeNode/treeLeaf are implemented 'by hand'
- (explicitly marking type) instead of using a proper virtual mechanism
- to save some space in the treeLeaves.
-
-SourceFiles
- treeNode.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef treeNode_H
-#define treeNode_H
-
-#include "treeBoundBoxList.H"
-#include "treeElem.H"
-#include "linePointRef.H"
-#include "HashSet.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// class intersection;
-
-template<class Type> class octree;
-template<class Type> class treeLeaf;
-template<class Type> class treeNode;
-
-// Forward declaration of friend functions and operators
-
-template<class Type> Istream& operator>>(Istream&, treeNode<Type>&);
-template<class Type> Ostream& operator<<(Ostream&, const treeNode<Type>&);
-
-
-/*---------------------------------------------------------------------------*\
- Class treeNodeName Declaration
-\*---------------------------------------------------------------------------*/
-
-TemplateName(treeNode);
-
-
-/*---------------------------------------------------------------------------*\
- Class treeNode Declaration
-\*---------------------------------------------------------------------------*/
-
-template <class Type>
-class treeNode
-:
- public treeElem<Type>,
- public treeNodeName
-{
- // Private data
-
- //- Position of the midpoint
- const point mid_;
-
- //- Type stored in subNodes_
- unsigned char subNodeTypes_;
-
- //- Pointers to sub treeNode or treeLeaf
- treeElem<Type>* subNodes_[8];
-
- //- Constant valid for whole subNode/leaf
- label volType_;
-
- // Static data members
-
- //- leaf offset for octant index
- static const label leafOffset;
-
-
- // Private Member Functions
-
- //- mark pointer to subnode as being a treeNode*
- void setAsNode(const label octant);
-
- //- mark pointer to subnode as being a treeLeaf*
- void setAsLeaf(const label octant);
-
- //- Set pointer to sub node
- void setNodePtr(const label octant, treeElem<Type>* treeNodePtr);
-
- //- Set pointer to sub leaf
- void setLeafPtr(const label octant, treeElem<Type>* treeLeafPtr);
-
- //- Set type of octant
- void setVolType(const label octant, const label type);
-
- //- Get type of octant
- inline label getVolType(const label octant) const;
-
- //- Find first leaf on line start-end. Updates start.
- const treeLeaf<Type>* findLeafLineOctant
- (
- const int level,
- const Type& shapes,
- const label octant,
- const vector& direction,
- point& start,
- const point& end
- ) const;
-
-
- //- Print spaces
- static void space(Ostream&, const label);
-
- //- Disallow default bitwise copy construct
- treeNode(const treeNode&);
-
- //- Disallow default bitwise assignment
- void operator=(const treeNode&);
-
-
-public:
-
- // Constructors
-
- //- Construct from components
- treeNode(const treeBoundBox&);
-
- //- Construct from Istream
- treeNode(Istream&);
-
-
- //- Destructor
- ~treeNode();
-
-
- // Member Functions
-
- // Access
-
- //- The midpoint position
- inline const point& midpoint() const;
-
- //- array of 8 subNodes/leaves
- inline treeElem<Type>* const* subNodes() const;
-
- //- octant contains pointer to treeNode(1) or treeLeaf(0)
- inline label isNode(const label octant) const;
-
- //- Get pointer to sub node
- inline treeNode<Type>* getNodePtr(const label octant) const;
-
- //- Get pointer to sub leaf
- inline treeLeaf<Type>* getLeafPtr(const label octant) const;
-
- // Edit
-
- //- Take list of shapes and distribute over the 8 octants
- void distribute
- (
- const label,
- octree<Type>&,
- const Type& shapes,
- const labelList&
- );
-
- //- Distribute at certain level only
- void redistribute
- (
- const label,
- octree<Type>&,
- const Type& shapes,
- const label
- );
-
- //- Set type of subnodes
- label setSubNodeType
- (
- const label level,
- octree<Type>& top,
- const Type& shapes
- );
-
- // Search
-
- //- Find type of node sample is in. Used for inside/outside
- // determination
- label getSampleType
- (
- const label level,
- const octree<Type>& top,
- const Type& shapes,
- const point& sample
- ) const;
-
- //- Find index of shape containing sample.
- label find
- (
- const Type& shapes,
- const point& sample
- ) const;
-
- //- Find tightest bounding box around sample which is guaranteed
- // to hold at least one cell.
- // Current best bb in tightest,
- // returns true if newTightest has changed, 0 otherwise.
- bool findTightest
- (
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Find nearest shape to sample
- // Returns true if found nearer shape and updates
- // tightest, tightestI, tightestDist
- bool findNearest
- (
- const Type& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
- ) const;
-
- //- Find nearest shape to line
- // Returns true if found nearer shape and updates nearest and
- // tightest
- bool findNearest
- (
- const Type& shapes,
- const linePointRef& ln,
- treeBoundBox& tightest,
- label& tightestI, // index of nearest shape
- point& linePoint, // nearest point on line
- point& shapePoint // nearest point on shape
- ) const;
-
- //- Find shapes not outside box. Return true if anything found.
- bool findBox
- (
- const Type& shapes,
- const boundBox& bb,
- labelHashSet& elements
- ) const;
-
- //- Find treeLeaves intersecting line segment [start..end]
- // Updates: start
- const treeLeaf<Type>* findLeafLine
- (
- const label level,
- const Type& shapes,
- point& start,
- const point& end
- ) const;
-
-
- //- Collect all treeLeafs in leafArray. leafIndex points to first
- // empty slot in leafArray and gets updated.
- void findLeaves
- (
- List<treeLeaf<Type>*>& leafArray,
- label& leafIndex
- ) const;
-
- //- Same but for const.
- void findLeaves
- (
- List<const treeLeaf<Type>*>& leafArray,
- label& leafIndex
- ) const;
-
-
- // Write
-
- //- Print contents of node.
- void printNode
- (
- Ostream& os,
- const label level
- ) const;
-
- //- Write subleafs in OBJ format.
- void writeOBJ
- (
- Ostream& os,
- const label level,
- label& vertNo
- ) const;
-
-
- // IOstream Operators
-
- friend Istream& operator>> <Type> (Istream&, treeNode<Type>&);
- friend Ostream& operator<< <Type> (Ostream&, const treeNode<Type>&);
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-
-#include "treeNodeI.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#ifdef NoRepository
-# include "treeNode.C"
-#endif
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeNodeI.H b/src/meshTools/octree/treeNodeI.H
deleted file mode 100644
index 6fa0a020246725b34170f5f5e7270d98fce5124d..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeNodeI.H
+++ /dev/null
@@ -1,100 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Description
-
-\*---------------------------------------------------------------------------*/
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-// Get type of octant
-template <class Type>
-inline Foam::label Foam::treeNode<Type>::getVolType(const label octant) const
-{
- return (volType_ >> 2*octant) & 0x3;
-}
-
-
-template <class Type>
-inline const Foam::point& Foam::treeNode<Type>::midpoint() const
-{
- return mid_;
-}
-
-
-template <class Type>
-inline Foam::treeElem<Type>* const* Foam::treeNode<Type>::subNodes() const
-{
- return subNodes_;
-}
-
-
-// octant contains pointer to treeNode(1) or treeLeaf(0)
-template <class Type>
-inline Foam::label Foam::treeNode<Type>::isNode(const label octant) const
-{
- return subNodeTypes_ & (0x1 << octant);
-}
-
-
-// Get pointer to sub node
-template <class Type>
-inline Foam::treeNode<Type>* Foam::treeNode<Type>::getNodePtr
-(
- const label octant
-) const
-{
-# ifdef FULLDEBUG
- if (!isNode(octant))
- {
- FatalErrorIn("treeNode::getNodePtr(const label)")
- << "not a treeNode"
- << abort(FatalError);
- }
-# endif
-
- return static_cast<treeNode<Type>*>(subNodes_[octant]);
-}
-
-
-// Get pointer to sub leaf
-template <class Type>
-inline Foam::treeLeaf<Type>* Foam::treeNode<Type>::getLeafPtr
-(
- const label octant
-) const
-{
-# ifdef FULLDEBUG
- if (isNode(octant))
- {
- FatalErrorIn("treeNode::getLeafPtr(const label)")
- << "not a treeLeaf"
- << abort(FatalError);
- }
-# endif
-
- return static_cast<treeLeaf<Type>*>(subNodes_[octant]);
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/octree/treeNodeName.C b/src/meshTools/octree/treeNodeName.C
deleted file mode 100644
index c8ba31a198fc4d684652d8e18d98d8646453329c..0000000000000000000000000000000000000000
--- a/src/meshTools/octree/treeNodeName.C
+++ /dev/null
@@ -1,32 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "treeNode.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-defineTypeNameAndDebug(Foam::treeNodeName, 0);
-
-// ************************************************************************* //
diff --git a/src/meshTools/triSurface/octreeData/octreeDataTriSurface.C b/src/meshTools/triSurface/octreeData/octreeDataTriSurface.C
deleted file mode 100644
index 346ca24f962928974865f857b0d555cf44e8847a..0000000000000000000000000000000000000000
--- a/src/meshTools/triSurface/octreeData/octreeDataTriSurface.C
+++ /dev/null
@@ -1,555 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataTriSurface.H"
-
-#include "labelList.H"
-#include "treeBoundBox.H"
-#include "faceList.H"
-#include "triPointRef.H"
-#include "octree.H"
-#include "triSurfaceTools.H"
-#include "triangleFuncs.H"
-
-// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
-
-defineTypeNameAndDebug(Foam::octreeDataTriSurface, 0);
-
-Foam::scalar Foam::octreeDataTriSurface::tol(1E-6);
-
-
-// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
-
-// Fast distance to triangle calculation. From
-// "Distance Between Point and Triangle in 3D"
-// David Eberly, Magic Software Inc. Aug. 2003.
-// Works on function Q giving distance to point and tries to minimize this.
-void Foam::octreeDataTriSurface::nearestCoords
-(
- const point& base,
- const point& E0,
- const point& E1,
- const scalar a,
- const scalar b,
- const scalar c,
- const point& P,
- scalar& s,
- scalar& t
-)
-{
- // distance vector
- const vector D(base - P);
-
- // Precalculate distance factors.
- const scalar d = E0 & D;
- const scalar e = E1 & D;
-
- // Do classification
- const scalar det = a*c - b*b;
-
- s = b*e - c*d;
- t = b*d - a*e;
-
- if (s+t < det)
- {
- if (s < 0)
- {
- if (t < 0)
- {
- //region 4
- if (e > 0)
- {
- //min on edge t = 0
- t = 0;
- s = (d >= 0 ? 0 : (-d >= a ? 1 : -d/a));
- }
- else
- {
- //min on edge s=0
- s = 0;
- t = (e >= 0 ? 0 : (-e >= c ? 1 : -e/c));
- }
- }
- else
- {
- //region 3. Min on edge s = 0
- s = 0;
- t = (e >= 0 ? 0 : (-e >= c ? 1 : -e/c));
- }
- }
- else if (t < 0)
- {
- //region 5
- t = 0;
- s = (d >= 0 ? 0 : (-d >= a ? 1 : -d/a));
- }
- else
- {
- //region 0
- const scalar invDet = 1/det;
- s *= invDet;
- t *= invDet;
- }
- }
- else
- {
- if (s < 0)
- {
- //region 2
- const scalar tmp0 = b + d;
- const scalar tmp1 = c + e;
- if (tmp1 > tmp0)
- {
- //min on edge s+t=1
- const scalar numer = tmp1 - tmp0;
- const scalar denom = a-2*b+c;
- s = (numer >= denom ? 1 : numer/denom);
- t = 1 - s;
- }
- else
- {
- //min on edge s=0
- s = 0;
- t = (tmp1 <= 0 ? 1 : (e >= 0 ? 0 : - e/c));
- }
- }
- else if (t < 0)
- {
- //region 6
- const scalar tmp0 = b + d;
- const scalar tmp1 = c + e;
- if (tmp1 > tmp0)
- {
- //min on edge s+t=1
- const scalar numer = tmp1 - tmp0;
- const scalar denom = a-2*b+c;
- s = (numer >= denom ? 1 : numer/denom);
- t = 1 - s;
- }
- else
- {
- //min on edge t=0
- t = 0;
- s = (tmp1 <= 0 ? 1 : (d >= 0 ? 0 : - d/a));
- }
- }
- else
- {
- //region 1
- const scalar numer = c+e-(b+d);
- if (numer <= 0)
- {
- s = 0;
- }
- else
- {
- const scalar denom = a-2*b+c;
- s = (numer >= denom ? 1 : numer/denom);
- }
- }
- t = 1 - s;
- }
-
-
- // Calculate distance.
- // Note: abs should not be needed but truncation error causes problems
- // with points very close to one of the triangle vertices.
- // (seen up to -9e-15). Alternatively add some small value.
-
- // const scalar f = D & D;
- // return a*s*s + 2*b*s*t + c*t*t + 2*d*s + 2*e*t + f + SMALL;
- // return Foam::mag(a*s*s + 2*b*s*t + c*t*t + 2*d*s + 2*e*t + f);
-}
-
-
-Foam::point Foam::octreeDataTriSurface::nearestPoint
-(
- const label index,
- const point& p
-) const
-{
- scalar s;
- scalar t;
-
- nearestCoords
- (
- base_[index],
- E0_[index],
- E1_[index],
- a_[index],
- b_[index],
- c_[index],
- p,
- s,
- t
- );
-
- return base_[index] + s*E0_[index] + t*E1_[index];
-}
-
-
-// Helper function to calculate tight fitting bounding boxes.
-Foam::treeBoundBoxList Foam::octreeDataTriSurface::calcBb
-(
- const triSurface& surf
-)
-{
- treeBoundBoxList allBb(surf.size(), treeBoundBox::invertedBox);
-
- const labelListList& pointFcs = surf.pointFaces();
- const pointField& localPts = surf.localPoints();
-
- forAll(pointFcs, pointI)
- {
- const labelList& myFaces = pointFcs[pointI];
- const point& vertCoord = localPts[pointI];
-
- forAll(myFaces, myFaceI)
- {
- // Update bb
- label faceI = myFaces[myFaceI];
-
- treeBoundBox& bb = allBb[faceI];
-
- bb.min() = min(bb.min(), vertCoord);
- bb.max() = max(bb.max(), vertCoord);
- }
- }
-
- return allBb;
-}
-
-
-// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
-
-// Construct from components
-Foam::octreeDataTriSurface::octreeDataTriSurface(const triSurface& surface)
-:
- surface_(surface),
- allBb_(calcBb(surface_)),
- base_(surface_.size()),
- E0_(surface_.size()),
- E1_(surface_.size()),
- a_(surface_.size()),
- b_(surface_.size()),
- c_(surface_.size())
-{
- // Precalculate factors for distance calculation
- const pointField& points = surface_.points();
-
- forAll(surface_, faceI)
- {
- const labelledTri& f = surface_[faceI];
-
- // Calculate base and spanning vectors of triangles
- base_[faceI] = points[f[1]];
- E0_[faceI] = points[f[0]] - points[f[1]];
- E1_[faceI] = points[f[2]] - points[f[1]];
-
- a_[faceI] = E0_[faceI] & E0_[faceI];
- b_[faceI] = E0_[faceI] & E1_[faceI];
- c_[faceI] = E1_[faceI] & E1_[faceI];
- }
-}
-
-
-// Construct from components
-Foam::octreeDataTriSurface::octreeDataTriSurface
-(
- const triSurface& surface,
- const treeBoundBoxList& allBb
-)
-:
- surface_(surface),
- allBb_(allBb),
- base_(surface_.size()),
- E0_(surface_.size()),
- E1_(surface_.size()),
- a_(surface_.size()),
- b_(surface_.size()),
- c_(surface_.size())
-{
- const pointField& points = surface_.points();
-
- forAll(surface_, faceI)
- {
- const labelledTri& f = surface_[faceI];
-
- // Calculate base and spanning vectors of triangles
- base_[faceI] = points[f[1]];
- E0_[faceI] = points[f[0]] - points[f[1]];
- E1_[faceI] = points[f[2]] - points[f[1]];
-
- a_[faceI] = E0_[faceI] & E0_[faceI];
- b_[faceI] = E0_[faceI] & E1_[faceI];
- c_[faceI] = E1_[faceI] & E1_[faceI];
- }
-}
-
-
-// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
-
-Foam::label Foam::octreeDataTriSurface::getSampleType
-(
- const octree<octreeDataTriSurface>& oc,
- const point& sample
-) const
-
-{
- treeBoundBox tightest(treeBoundBox::greatBox);
- scalar tightestDist(treeBoundBox::great);
-
- // Find nearest face to sample
- label faceI = oc.findNearest(sample, tightest, tightestDist);
-
- if (debug & 2)
- {
- Pout<< "getSampleType : sample:" << sample
- << " nearest face:" << faceI;
- }
-
- if (faceI == -1)
- {
- FatalErrorIn
- (
- "octreeDataTriSurface::getSampleType"
- "(octree<octreeDataTriSurface>&, const point&)"
- ) << "Could not find " << sample << " in octree."
- << abort(FatalError);
- }
-
- pointHit curHit = surface_[faceI].nearestPoint(sample, surface_.points());
-
- // Get normal according to position on face. On point -> pointNormal,
- // on edge-> edge normal, face normal on interior.
- vector n
- (
- triSurfaceTools::surfaceNormal
- (
- surface_,
- faceI,
- curHit.rawPoint()
- )
- );
-
- return
- octree<octreeDataTriSurface>::getVolType(n, sample - curHit.rawPoint());
-}
-
-
-// Check if any point on triangle is inside cubeBb.
-bool Foam::octreeDataTriSurface::overlaps
-(
- const label index,
- const treeBoundBox& cubeBb
-) const
-{
- //return cubeBb.overlaps(allBb_[index]);
-
- //- Exact test of triangle intersecting bb
-
- // Quick rejection.
- if (!cubeBb.overlaps(allBb_[index]))
- {
- return false;
- }
-
- // Triangle points
- const pointField& points = surface_.points();
- const labelledTri& f = surface_[index];
-
- // Check if one or more triangle point inside
- if (cubeBb.containsAny(points, f))
- {
- return true;
- }
-
- const point& p0 = points[f[0]];
- const point& p1 = points[f[1]];
- const point& p2 = points[f[2]];
- // Now we have the difficult case: all points are outside but connecting
- // edges might go through cube. Use fast intersection of bounding box.
-
- return triangleFuncs::intersectBb(p0, p1, p2, cubeBb);
-}
-
-
-bool Foam::octreeDataTriSurface::contains
-(
- const label,
- const point&
-) const
-{
- notImplemented
- (
- "octreeDataTriSurface::contains(const label, const point&)"
- );
-
- return false;
-}
-
-
-bool Foam::octreeDataTriSurface::intersects
-(
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
-) const
-{
- if (mag(surface_.faceNormals()[index]) < VSMALL)
- {
- return false;
- }
-
- const vector dir(end - start);
-
- // Disable picking up intersections behind us.
- scalar oldTol = intersection::setPlanarTol(0.0);
-
- pointHit inter = surface_[index].ray
- (
- start,
- dir,
- surface_.points(),
- intersection::HALF_RAY
- );
-
- intersection::setPlanarTol(oldTol);
-
- if (inter.hit() && inter.distance() <= mag(dir))
- {
- // Note: no extra test on whether intersection is in front of us
- // since using half_ray AND zero tolerance. (note that tolerance
- // is used to look behind us)
- intersectionPoint = inter.hitPoint();
-
- return true;
- }
- else
- {
- return false;
- }
-}
-
-
-bool Foam::octreeDataTriSurface::findTightest
-(
- const label index,
- const point& sample,
- treeBoundBox& tightest
-) const
-{
-
- // get nearest and furthest away vertex
- point myNear, myFar;
- allBb_[index].calcExtremities(sample, myNear, myFar);
-
- const point dist = myFar - sample;
- scalar myFarDist = mag(dist);
-
- point tightestNear, tightestFar;
- tightest.calcExtremities(sample, tightestNear, tightestFar);
-
- scalar tightestFarDist = mag(tightestFar - sample);
-
- if (tightestFarDist < myFarDist)
- {
- // Keep current tightest.
- return false;
- }
- else
- {
- // Construct bb around sample and myFar
- const point dist2(fabs(dist.x()), fabs(dist.y()), fabs(dist.z()));
-
- tightest.min() = sample - dist2;
- tightest.max() = sample + dist2;
-
- return true;
- }
-}
-
-
-// Determine numerical value of sign of sample compared to shape at index
-Foam::scalar Foam::octreeDataTriSurface::calcSign
-(
- const label index,
- const point& sample,
- vector& n
-) const
-{
- n = surface_.faceNormals()[index];
-
- // take vector from sample to any point on face (we use vertex 0)
- vector vec = sample - surface_.points()[surface_[index][0]];
-
- vec /= mag(vec) + VSMALL;
-
- return n & vec;
-}
-
-
-// Calculate nearest point to sample on/in shapei. !Does not set nearest
-Foam::scalar Foam::octreeDataTriSurface::calcNearest
-(
- const label index,
- const point& sample,
- point&
-) const
-{
- return mag(nearestPoint(index, sample) - sample);
-}
-
-
-// Calculate nearest point on/in shapei
-Foam::scalar Foam::octreeDataTriSurface::calcNearest
-(
- const label index,
- const linePointRef& ln,
- point& linePt,
- point& shapePt
-) const
-{
- notImplemented
- (
- "octreeDataTriSurface::calcNearest"
- "(const label, const linePointRef&, point& linePt, point&)"
- );
- return GREAT;
-}
-
-
-void Foam::octreeDataTriSurface::write
-(
- Ostream& os,
- const label index
-) const
-{
- os << surface_[index] << token::SPACE << allBb_[index];
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/triSurface/octreeData/octreeDataTriSurface.H b/src/meshTools/triSurface/octreeData/octreeDataTriSurface.H
deleted file mode 100644
index 822b349c4ca8ceeb227b35a36f6e28f083ac8d2f..0000000000000000000000000000000000000000
--- a/src/meshTools/triSurface/octreeData/octreeDataTriSurface.H
+++ /dev/null
@@ -1,235 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataTriSurface
-
-Description
- Encapsulates data for octree searches on triSurface.
-
-SourceFiles
- octreeDataTriSurface.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataTriSurface_H
-#define octreeDataTriSurface_H
-
-#include "treeBoundBoxList.H"
-#include "labelList.H"
-#include "point.H"
-#include "triSurface.H"
-#include "linePointRef.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-template<class Type> class octree;
-
-/*---------------------------------------------------------------------------*\
- Class octreeDataTriSurface Declaration
-\*---------------------------------------------------------------------------*/
-
-class octreeDataTriSurface
-{
- // Static data
-
- //- tolerance on linear dimensions
- static scalar tol;
-
- // Private data
-
- const triSurface& surface_;
-
- const treeBoundBoxList allBb_;
-
- // Extra data to speed up distance searches.
- // Triangles expressed as base + spanning vectors
- pointField base_;
- pointField E0_;
- pointField E1_;
- scalarList a_;
- scalarList b_;
- scalarList c_;
-
-
- // Private Static Functions
-
- //- fast triangle nearest point calculation. Returns point in E0, E1
- // coordinate system: base + s*E0 + t*E1
- static void nearestCoords
- (
- const point& base,
- const point& E0,
- const point& E1,
- const scalar a,
- const scalar b,
- const scalar c,
- const point& P,
- scalar& s,
- scalar& t
- );
-
- //- Calculate bounding boxes for triangles
- static treeBoundBoxList calcBb(const triSurface&);
-
- // Private Member Functions
-
- //- nearest point in xyz coord system
- point nearestPoint(const label index, const point& P) const;
-
-public:
-
- // Declare name of the class and its debug switch
- ClassName("octreeDataTriSurface");
-
-
- // Constructors
-
- //- Construct from triSurface. Holds reference. Bounding box
- // calculated from triangle points.
- octreeDataTriSurface(const triSurface&);
-
- //- Construct from triSurface and bounding box.
- // Holds references.
- octreeDataTriSurface(const triSurface&, const treeBoundBoxList&);
-
-
- // Member Functions
-
- // Access
-
- const triSurface& surface() const
- {
- return surface_;
- }
-
- const treeBoundBoxList& allBb() const
- {
- return allBb_;
- }
-
- label size() const
- {
- return allBb_.size();
- }
-
- // Search
-
- //- Get type of sample
- label getSampleType
- (
- const octree<octreeDataTriSurface>&,
- const point&
- ) const;
-
- //- Does (bb of) shape at index overlap bb
- bool overlaps
- (
- const label index,
- const treeBoundBox& sampleBb
- ) const;
-
- //- Does shape at index contain sample
- bool contains
- (
- const label index,
- const point& sample
- ) const;
-
- //- Segment (from start to end) intersection with shape
- // at index. If intersects returns true and sets intersectionPoint
- bool intersects
- (
- const label index,
- const point& start,
- const point& end,
- point& intersectionPoint
- ) const;
-
- //- Sets newTightest to bounding box (and returns true) if
- // nearer to sample than tightest bounding box. Otherwise
- // returns false.
- bool findTightest
- (
- const label index,
- const point& sample,
- treeBoundBox& tightest
- ) const;
-
- //- Given index get unit normal and calculate (numerical) sign
- // of sample.
- // Used to determine accuracy of calcNearest or inside/outside.
- scalar calcSign
- (
- const label index,
- const point& sample,
- vector& n
- ) const;
-
- //- Calculates nearest (to sample) point in shape.
- // Returns point and mag(nearest - sample)
- scalar calcNearest
- (
- const label index,
- const point& sample,
- point& nearest
- ) const;
-
- //- Calculates nearest (to line segment) point in shape.
- // Returns distance and both point.
- scalar calcNearest
- (
- const label index,
- const linePointRef& ln,
- point& linePt, // nearest point on line
- point& shapePt // nearest point on shape
- ) const;
-
-
- // Write
-
- // Write shape at index
- void write(Ostream& os, const label index) const;
-
-
- // IOstream Operators
-
- friend Istream& operator>>(Istream&, octreeDataTriSurface&);
- friend Ostream& operator<<(Ostream&, const octreeDataTriSurface&);
-};
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-
-#endif
-
-// ************************************************************************* //
diff --git a/src/meshTools/triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.C b/src/meshTools/triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.C
deleted file mode 100644
index 51a7b8d5e035537bed369a731ba682fd46dca7f9..0000000000000000000000000000000000000000
--- a/src/meshTools/triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.C
+++ /dev/null
@@ -1,81 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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 "octreeDataTriSurfaceTreeLeaf.H"
-#include "octreeDataTriSurface.H"
-
-// * * * * * * * * * * * * * Template Specialisations * * * * * * * * * * * //
-
-template<>
-bool Foam::treeLeaf<Foam::octreeDataTriSurface>::findNearest
-(
- const octreeDataTriSurface& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
-) const
-{
- // Some aliases
- const treeBoundBoxList& allBb = shapes.allBb();
- point& min = tightest.min();
- point& max = tightest.max();
-
- point nearest;
-
- bool changed = false;
- forAll(indices_, i)
- {
- label faceI = indices_[i];
-
- // Quick rejection test.
- if (tightest.overlaps(allBb[faceI]))
- {
- // Full calculation
- scalar dist = shapes.calcNearest(faceI, sample, nearest);
-
- if (dist < tightestDist)
- {
- // Update bb (centered around sample, span is dist)
- min.x() = sample.x() - dist;
- min.y() = sample.y() - dist;
- min.z() = sample.z() - dist;
-
- max.x() = sample.x() + dist;
- max.y() = sample.y() + dist;
- max.z() = sample.z() + dist;
-
- tightestI = faceI;
- tightestDist = dist;
-
- changed = true;
- }
- }
- }
- return changed;
-}
-
-
-// ************************************************************************* //
diff --git a/src/meshTools/triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.H b/src/meshTools/triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.H
deleted file mode 100644
index a084beec20386a1ff5f0e0707bfaa7dbcf98a0ae..0000000000000000000000000000000000000000
--- a/src/meshTools/triSurface/octreeData/octreeDataTriSurfaceTreeLeaf.H
+++ /dev/null
@@ -1,67 +0,0 @@
-/*---------------------------------------------------------------------------*\
- ========= |
- \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
- \\ / O peration |
- \\ / A nd | Copyright (C) 2011 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/>.
-
-Class
- Foam::octreeDataTriSurfaceTreeLeaf
-
-Description
- Template specialisation for octreeDataTriSurfaceTreeLeaf
-
-SourceFiles
- octreeDataTriSurfaceTreeLeafTreeLeaf.C
-
-\*---------------------------------------------------------------------------*/
-
-#ifndef octreeDataTriSurfaceTreeLeaf_H
-#define octreeDataTriSurfaceTreeLeaf_H
-
-#include "treeLeaf.H"
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-namespace Foam
-{
-
-// Forward declaration of classes
-class octreeDataTriSurface;
-
-template<>
-bool treeLeaf<octreeDataTriSurface>::findNearest
-(
- const octreeDataTriSurface& shapes,
- const point& sample,
- treeBoundBox& tightest,
- label& tightestI,
- scalar& tightestDist
-) const;
-
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-} // End namespace Foam
-
-// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
-
-#endif
-
-// ************************************************************************* //