OilfieldToolsNet/ResInsight
4
0
Fork 0
mirror of https://github.com/OPM/ResInsight.git synced 2025-02-25 18:55:39 -06:00
Code Issues Packages Projects Releases Wiki Activity

Improved Bounding Box tree for ill-formed grids

Browse Source
This commit is contained in:
Gaute Lindkvist 2020-05-25 12:14:09 +02:00
parent 0b453b9d15
commit d6be12bf02
1 changed files with 20 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
Fwk/VizFwk/LibGeometry/cvfBoundingBoxTree.cpp
View File

@ -519,11 +519,11 @@ bool AABBTree::buildTree(AABBTreeNodeInternal* pNode, size_t iFromIdx, size_t iT
size_t i = iFromIdx;
size_t iMid = iToIdx;
//=================================================================================================================================
//
// Geometric split tree - best!
//
//=================================================================================================================================
//=================================================================================================================================
//
// Geometric split tree - best!
//
//=================================================================================================================================
// Order the leaves according to the position of the center of each BB in comparison with longest axis of the BB
while (i < iMid)
{
@ -547,6 +547,21 @@ bool AABBTree::buildTree(AABBTreeNodeInternal* pNode, size_t iFromIdx, size_t iT
{
iMid = (iToIdx + iFromIdx)/2;
}
else
{
const size_t maxInbalance = 1000u;
size_t rangeA = iMid - iFromIdx;
size_t rangeB = iToIdx - iMid;
if (rangeA > maxInbalance * rangeB || rangeB > maxInbalance * rangeA)
{
// Extremely imbalanced tree. Sort leaves and chose iMid as the median of the centres.
std::sort(m_ppLeaves.begin() + iFromIdx, m_ppLeaves.begin() + iToIdx, [=](const AABBTreeNodeLeaf* lhs, const AABBTreeNodeLeaf* rhs)
{
return lhs->boundingBoxCenter()[iLongestAxis] < rhs->boundingBoxCenter()[iLongestAxis];
});
iMid = (iToIdx + iFromIdx)/2;
}
}
// Create the left tree
if (iMid > iFromIdx)