mirror of
https://github.com/OPM/ResInsight.git
synced 2025-02-25 18:55:39 -06:00
299 lines
12 KiB
C++
299 lines
12 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) Statoil ASA
|
|
// Copyright (C) Ceetron Solutions AS
|
|
//
|
|
// ResInsight 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.
|
|
//
|
|
// ResInsight 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 at <http://www.gnu.org/licenses/gpl.html>
|
|
// for more details.
|
|
//
|
|
/////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "RigEclipseWellLogExtractor.h"
|
|
#include <map>
|
|
#include "RigCaseData.h"
|
|
#include "RigWellPath.h"
|
|
#include "RigResultAccessor.h"
|
|
#include "cvfBoundingBox.h"
|
|
#include "cvfGeometryTools.h"
|
|
|
|
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
RigEclipseWellLogExtractor::RigEclipseWellLogExtractor(const RigCaseData* aCase, const RigWellPath* wellpath)
|
|
: m_caseData(aCase), m_wellPath(wellpath)
|
|
{
|
|
calculateIntersection();
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
/// Internal class for intersection point info
|
|
//--------------------------------------------------------------------------------------------------
|
|
struct HexIntersectionInfo
|
|
{
|
|
|
|
public:
|
|
HexIntersectionInfo( cvf::Vec3d intersectionPoint,
|
|
bool isIntersectionEntering,
|
|
cvf::StructGridInterface::FaceType face,
|
|
size_t hexIndex)
|
|
: m_intersectionPoint(intersectionPoint),
|
|
m_isIntersectionEntering(isIntersectionEntering),
|
|
m_face(face),
|
|
m_hexIndex(hexIndex) {}
|
|
|
|
|
|
cvf::Vec3d m_intersectionPoint;
|
|
bool m_isIntersectionEntering;
|
|
cvf::StructGridInterface::FaceType m_face;
|
|
size_t m_hexIndex;
|
|
};
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
/// Specialized Line - Hex intersection
|
|
//--------------------------------------------------------------------------------------------------
|
|
|
|
int lineHexCellIntersection(const cvf::Vec3d p1, const cvf::Vec3d p2, const cvf::Vec3d hexCorners[8], const size_t hexIndex,
|
|
std::vector<HexIntersectionInfo>* intersections )
|
|
{
|
|
CVF_ASSERT(intersections != NULL);
|
|
|
|
int intersectionCount = 0;
|
|
|
|
for (int face = 0; face < 6 ; ++face)
|
|
{
|
|
cvf::ubyte faceVertexIndices[4];
|
|
cvf::StructGridInterface::cellFaceVertexIndices(static_cast<cvf::StructGridInterface::FaceType>(face), faceVertexIndices);
|
|
|
|
cvf::Vec3d intersection;
|
|
bool isEntering = false;
|
|
cvf::Vec3d faceCenter = cvf::GeometryTools::computeFaceCenter( hexCorners[faceVertexIndices[0]], hexCorners[faceVertexIndices[1]], hexCorners[faceVertexIndices[2]], hexCorners[faceVertexIndices[3]]);
|
|
|
|
for (int i = 0; i < 4; ++i)
|
|
{
|
|
int next = i < 3 ? i+1 : 0;
|
|
|
|
int intsStatus = cvf::GeometryTools::intersectLineSegmentTriangle(p1, p2,
|
|
hexCorners[faceVertexIndices[i]], hexCorners[faceVertexIndices[next]], faceCenter,
|
|
&intersection,
|
|
&isEntering);
|
|
if (intsStatus == 1)
|
|
{
|
|
intersectionCount++;
|
|
intersections->push_back(HexIntersectionInfo(intersection, isEntering, static_cast<cvf::StructGridInterface::FaceType>(face), hexIndex));
|
|
}
|
|
}
|
|
}
|
|
|
|
return intersectionCount;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
/// Class used to sort the intersections along the wellpath
|
|
//--------------------------------------------------------------------------------------------------
|
|
struct WellPathDepthPoint
|
|
{
|
|
WellPathDepthPoint(double md, bool entering): measuredDepth(md), isEnteringCell(entering){}
|
|
|
|
double measuredDepth;
|
|
bool isEnteringCell; // As opposed to leaving.
|
|
|
|
bool operator < (const WellPathDepthPoint& other) const
|
|
{
|
|
double depthDiff = other.measuredDepth - measuredDepth;
|
|
|
|
const double tolerance = 1e-6;
|
|
|
|
if (fabs(depthDiff) < tolerance) // Equal depth
|
|
{
|
|
if (isEnteringCell == other.isEnteringCell)
|
|
{
|
|
CVF_ASSERT(false); // For now
|
|
|
|
return false; // Completely equal
|
|
}
|
|
|
|
if(!isEnteringCell) // Leaving this cell
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
|
|
// The depths are not equal
|
|
|
|
if (measuredDepth < other.measuredDepth)
|
|
{
|
|
return true;
|
|
}
|
|
else if (measuredDepth > other.measuredDepth)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
CVF_ASSERT(false);
|
|
return false;
|
|
}
|
|
};
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
void RigEclipseWellLogExtractor::calculateIntersection()
|
|
{
|
|
const std::vector<cvf::Vec3d>& nodeCoords = m_caseData->mainGrid()->nodes();
|
|
|
|
double globalMeasuredDepth = 0; // Where do we start ? z - of first well path point ?
|
|
|
|
for (size_t wpp = 0; wpp < m_wellPath->m_wellPathPoints.size() - 1; ++wpp)
|
|
{
|
|
cvf::BoundingBox bb;
|
|
cvf::Vec3d p1 = m_wellPath->m_wellPathPoints[wpp];
|
|
cvf::Vec3d p2 = m_wellPath->m_wellPathPoints[wpp+1];
|
|
|
|
bb.add(p1);
|
|
bb.add(p2);
|
|
|
|
std::vector<size_t> closeCells = findCloseCells(bb );
|
|
std::vector<HexIntersectionInfo> intersections;
|
|
|
|
cvf::Vec3d hexCorners[8];
|
|
for (size_t cIdx = 0; cIdx < closeCells.size(); ++cIdx)
|
|
{
|
|
const RigCell& cell = m_caseData->mainGrid()->cells()[closeCells[cIdx]];
|
|
const caf::SizeTArray8& cornerIndices = cell.cornerIndices();
|
|
|
|
hexCorners[0] = nodeCoords[cornerIndices[0]];
|
|
hexCorners[1] = nodeCoords[cornerIndices[1]];
|
|
hexCorners[2] = nodeCoords[cornerIndices[2]];
|
|
hexCorners[3] = nodeCoords[cornerIndices[3]];
|
|
hexCorners[4] = nodeCoords[cornerIndices[4]];
|
|
hexCorners[5] = nodeCoords[cornerIndices[5]];
|
|
hexCorners[6] = nodeCoords[cornerIndices[6]];
|
|
hexCorners[7] = nodeCoords[cornerIndices[7]];
|
|
|
|
int intersectionCount = lineHexCellIntersection(p1, p2, hexCorners, closeCells[cIdx], &intersections);
|
|
}
|
|
|
|
// Now, with all the intersections of this piece of line, we need to
|
|
// sort them in order, and set the measured depth and corresponding cell index
|
|
|
|
// map <WellPathDepthPoint, (CellIdx, intersectionPoint)>
|
|
std::map<WellPathDepthPoint, HexIntersectionInfo > sortedIntersections;
|
|
|
|
for (size_t intIdx = 0; intIdx < intersections.size(); ++intIdx)
|
|
{
|
|
double lenghtAlongLineSegment = (intersections[intIdx].m_intersectionPoint - p1).length();
|
|
double measuredDepthOfPoint = globalMeasuredDepth + lenghtAlongLineSegment;
|
|
sortedIntersections.insert(std::make_pair(WellPathDepthPoint(measuredDepthOfPoint, intersections[intIdx].m_isIntersectionEntering), intersections[intIdx]));
|
|
}
|
|
|
|
// Now populate the return arrays
|
|
|
|
std::map<WellPathDepthPoint, HexIntersectionInfo >::iterator it;
|
|
it = sortedIntersections.begin();
|
|
while (it != sortedIntersections.end())
|
|
{
|
|
m_measuredDepth.push_back(it->first.measuredDepth);
|
|
m_trueVerticalDepth.push_back(it->second.m_intersectionPoint[2]);
|
|
m_intersections.push_back(it->second.m_intersectionPoint);
|
|
m_intersectedCells.push_back(it->second.m_hexIndex);
|
|
m_intersectedCellFaces.push_back(it->second.m_face);
|
|
++it;
|
|
}
|
|
|
|
// Increment the measured depth
|
|
globalMeasuredDepth += (p2-p1).length();
|
|
}
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
void RigEclipseWellLogExtractor::curveData(const RigResultAccessor* resultAccessor, std::vector<double>* values)
|
|
{
|
|
CVF_TIGHT_ASSERT(values);
|
|
values->resize(m_intersections.size());// + 1); // Plus one for the end of the wellpath stopping inside a cell
|
|
|
|
for (size_t cpIdx = 0; cpIdx < m_intersections.size(); ++cpIdx)
|
|
{
|
|
size_t cellIdx = m_intersectedCells[cpIdx];
|
|
cvf::StructGridInterface::FaceType cellFace = m_intersectedCellFaces[cpIdx];
|
|
(*values)[cpIdx] = resultAccessor->cellFaceScalarGlobIdx(cellIdx, cellFace);
|
|
}
|
|
|
|
// What do we do with the endpoint of the wellpath ?
|
|
// Ignore it for now ...
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
std::vector<size_t> RigEclipseWellLogExtractor::findCloseCells(const cvf::BoundingBox& bb)
|
|
{
|
|
const std::vector<RigCell>& cells = m_caseData->mainGrid()->cells();
|
|
const std::vector<cvf::Vec3d>& nodeCoords = m_caseData->mainGrid()->nodes();
|
|
|
|
std::vector<size_t> closeCells;
|
|
|
|
size_t cellCount = cells.size();
|
|
for (size_t cIdx = 0; cIdx < cellCount; ++cIdx)
|
|
{
|
|
const caf::SizeTArray8& cellIndices = cells[cIdx].cornerIndices();
|
|
cvf::BoundingBox cellBB;
|
|
cellBB.add(nodeCoords[cellIndices[0]]);
|
|
cellBB.add(nodeCoords[cellIndices[1]]);
|
|
cellBB.add(nodeCoords[cellIndices[2]]);
|
|
cellBB.add(nodeCoords[cellIndices[3]]);
|
|
cellBB.add(nodeCoords[cellIndices[4]]);
|
|
cellBB.add(nodeCoords[cellIndices[5]]);
|
|
cellBB.add(nodeCoords[cellIndices[6]]);
|
|
cellBB.add(nodeCoords[cellIndices[7]]);
|
|
|
|
if (bb.intersects(cellBB))
|
|
{
|
|
closeCells.push_back(cIdx);
|
|
}
|
|
}
|
|
|
|
return closeCells;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
const std::vector<double>& RigEclipseWellLogExtractor::measuredDepth()
|
|
{
|
|
return m_measuredDepth;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
const std::vector<double>& RigEclipseWellLogExtractor::trueVerticalDepth()
|
|
{
|
|
return m_trueVerticalDepth;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
const std::vector<size_t>& RigEclipseWellLogExtractor::cellIndicesPrSegment()
|
|
{
|
|
CVF_ASSERT(false); // Not implemented
|
|
return m_globalCellIndicesPrSegment;
|
|
}
|