OilfieldToolsNet/ResInsight
4
0
Fork 0
mirror of https://github.com/OPM/ResInsight.git synced 2025-01-01 03:37:15 -06:00
Code Issues Packages Projects Releases Wiki Activity

Use AABB tree to speed up fault distance calculation

Browse Source
This commit is contained in:
Magne Sjaastad 2023-04-24 10:41:30 +02:00
parent 10adcbc082
commit f8c1eebe01
1 changed files with 59 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

59
ApplicationLibCode/ReservoirDataModel/ResultCalculators/RigFaultDistanceResultCalculator.cpp
View File

@ -17,6 +17,7 @@
/////////////////////////////////////////////////////////////////////////////////
#include "RigFaultDistanceResultCalculator.h"
#include "RiaDefines.h"
#include "RiaResultNames.h"
#include "RigActiveCellInfo.h"
@ -25,6 +26,8 @@
#include "RigEclipseResultInfo.h"
#include "RigMainGrid.h"
#include "cvfBoundingBoxTree.h"
//==================================================================================================
///
//==================================================================================================
@ -96,6 +99,28 @@ void RigFaultDistanceResultCalculator::calculate( const RigEclipseResultAddress&
}
}
if ( faultFaceCenters.empty() ) return;
// Create bounding box tree for all face centers
auto searchTree = new cvf::BoundingBoxTree;
{
std::vector<size_t> faceIndicesForBoundingBoxes;
std::vector<cvf::BoundingBox> faceBBs;
size_t faceCenterIndex = 0;
for ( const auto& faultFaceCenter : faultFaceCenters )
{
cvf::BoundingBox bb;
bb.add( faultFaceCenter );
faceBBs.push_back( bb );
faceIndicesForBoundingBoxes.push_back( faceCenterIndex++ );
}
searchTree->buildTreeFromBoundingBoxes( faceBBs, &faceIndicesForBoundingBoxes );
}
const auto nodes = m_resultsData->m_ownerMainGrid->nodes();
const auto mainGridBB = m_resultsData->m_ownerMainGrid->boundingBox();
#pragma omp parallel for
for ( long long cellIdx = 0; cellIdx < numCells; cellIdx++ )
{
@ -104,10 +129,42 @@ void RigFaultDistanceResultCalculator::calculate( const RigEclipseResultAddress&
size_t resultIndex = cellIdx;
if ( resultIndex == cvf::UNDEFINED_SIZE_T || !m_resultsData->activeCellInfo()->isActive( cellIdx ) ) continue;
std::vector<size_t> candidateFaceIndices;
{
cvf::BoundingBox bb;
const auto& cellIndices = cell.cornerIndices();
for ( const auto& i : cellIndices )
{
bb.add( nodes[i] );
}
searchTree->findIntersections( bb, &candidateFaceIndices );
bool bbIsBelowThreshold = true;
while ( candidateFaceIndices.empty() && bbIsBelowThreshold )
{
if ( bb.extent().x() > mainGridBB.extent().x() * 2 )
{
bbIsBelowThreshold = false;
break;
}
if ( bb.extent().y() > mainGridBB.extent().y() * 2 )
{
bbIsBelowThreshold = false;
break;
}
bb.expand( bb.extent().x() );
searchTree->findIntersections( bb, &candidateFaceIndices );
}
}
// Find closest fault face
double shortestDistance = std::numeric_limits<double>::infinity();
for ( const cvf::Vec3d& faultFaceCenter : faultFaceCenters )
for ( const auto& faultFaceIndex : candidateFaceIndices )
{
const cvf::Vec3d& faultFaceCenter = faultFaceCenters[faultFaceIndex];
shortestDistance = std::min( cell.center().pointDistance( faultFaceCenter ), shortestDistance );
}