mirror of
https://github.com/OPM/ResInsight.git
synced 2025-01-26 16:26:48 -06:00
199 lines
8.2 KiB
C++
199 lines
8.2 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) 2018- Statoil ASA
|
|
//
|
|
// 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 "Riv3dWellLogGridGeomertyGenerator.h"
|
|
|
|
#include "RimWellPath.h"
|
|
#include "RimWellPathCollection.h"
|
|
|
|
#include "RigWellPath.h"
|
|
#include "RigWellPathGeometryTools.h"
|
|
|
|
#include "cafDisplayCoordTransform.h"
|
|
#include "cvfObject.h"
|
|
#include "cvfDrawableGeo.h"
|
|
#include "cvfPrimitiveSetIndexedUInt.h"
|
|
|
|
#include "cvfBoundingBox.h"
|
|
|
|
#include <map>
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
Riv3dWellLogGridGeometryGenerator::Riv3dWellLogGridGeometryGenerator(RimWellPath* wellPath)
|
|
: m_wellPath(wellPath)
|
|
{
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
std::map< Riv3dWellLogGridGeometryGenerator::DrawableId, cvf::ref<cvf::DrawableGeo> >
|
|
Riv3dWellLogGridGeometryGenerator::createGrid(const caf::DisplayCoordTransform* displayCoordTransform,
|
|
const cvf::BoundingBox& wellPathClipBoundingBox,
|
|
double planeAngle,
|
|
double planeOffsetFromWellPathCenter,
|
|
double planeWidth,
|
|
double gridIntervalSize) const
|
|
{
|
|
CVF_ASSERT(gridIntervalSize > 0);
|
|
|
|
if (!wellPathGeometry() || wellPathGeometry()->m_measuredDepths.empty())
|
|
{
|
|
return std::map< DrawableId, cvf::ref<cvf::DrawableGeo> >();
|
|
}
|
|
|
|
if (!wellPathClipBoundingBox.isValid())
|
|
{
|
|
return std::map< DrawableId, cvf::ref<cvf::DrawableGeo> >();
|
|
}
|
|
|
|
|
|
RimWellPathCollection* wellPathCollection = nullptr;
|
|
m_wellPath->firstAncestorOrThisOfTypeAsserted(wellPathCollection);
|
|
|
|
std::vector<cvf::Vec3d> wellPathPoints = wellPathGeometry()->m_wellPathPoints;
|
|
if (wellPathPoints.empty())
|
|
{
|
|
return std::map< DrawableId, cvf::ref<cvf::DrawableGeo> >();
|
|
}
|
|
|
|
size_t originalWellPathSize = wellPathPoints.size();
|
|
|
|
if (wellPathCollection->wellPathClip)
|
|
{
|
|
double horizontalLengthAlongWellToClipPoint;
|
|
double maxZClipHeight = wellPathClipBoundingBox.max().z() + wellPathCollection->wellPathClipZDistance;
|
|
size_t indexToFirstVisibleSegment;
|
|
wellPathPoints = RigWellPath::clipPolylineStartAboveZ(
|
|
wellPathPoints, maxZClipHeight, &horizontalLengthAlongWellToClipPoint, &indexToFirstVisibleSegment);
|
|
}
|
|
|
|
if (wellPathPoints.empty())
|
|
{
|
|
return std::map< DrawableId, cvf::ref<cvf::DrawableGeo> >();
|
|
}
|
|
|
|
std::map< DrawableId, cvf::ref<cvf::DrawableGeo> > drawables;
|
|
|
|
// calculateLineSegmentNormals returns normals for the whole well path. Erase the part which is clipped off
|
|
std::vector<cvf::Vec3d> wellPathSegmentNormals =
|
|
RigWellPathGeometryTools::calculateLineSegmentNormals(wellPathGeometry(), planeAngle);
|
|
wellPathSegmentNormals.erase(wellPathSegmentNormals.begin(), wellPathSegmentNormals.end() - wellPathPoints.size());
|
|
|
|
{
|
|
std::vector<cvf::Vec3f> vertices;
|
|
vertices.reserve(wellPathPoints.size());
|
|
|
|
std::vector<cvf::uint> indices;
|
|
indices.reserve(wellPathPoints.size());
|
|
cvf::uint indexCounter = 0;
|
|
// Line along and close to well
|
|
for (size_t i = 0; i < wellPathPoints.size(); i++)
|
|
{
|
|
vertices.push_back(cvf::Vec3f(displayCoordTransform->transformToDisplayCoord(
|
|
wellPathPoints[i] + wellPathSegmentNormals[i] * planeOffsetFromWellPathCenter)));
|
|
|
|
indices.push_back(indexCounter);
|
|
indices.push_back(++indexCounter);
|
|
}
|
|
// Line along and far away from well in reverse order to create a closed surface.
|
|
for (int64_t i = (int64_t) wellPathPoints.size()-1; i >= 0; i--)
|
|
{
|
|
vertices.push_back(cvf::Vec3f(displayCoordTransform->transformToDisplayCoord(
|
|
wellPathPoints[i] + wellPathSegmentNormals[i] * (planeOffsetFromWellPathCenter + planeWidth))));
|
|
|
|
indices.push_back(indexCounter);
|
|
indices.push_back(++indexCounter);
|
|
}
|
|
indices.pop_back();
|
|
indices.push_back(0u); // Close surface
|
|
cvf::ref<cvf::PrimitiveSetIndexedUInt> indexedUInt = new cvf::PrimitiveSetIndexedUInt(cvf::PrimitiveType::PT_LINE_LOOP);
|
|
cvf::ref<cvf::UIntArray> indexArray = new cvf::UIntArray(indices);
|
|
|
|
cvf::ref<cvf::DrawableGeo> gridBorderDrawable = new cvf::DrawableGeo();
|
|
|
|
indexedUInt->setIndices(indexArray.p());
|
|
gridBorderDrawable->addPrimitiveSet(indexedUInt.p());
|
|
|
|
cvf::ref<cvf::Vec3fArray> vertexArray = new cvf::Vec3fArray(vertices);
|
|
gridBorderDrawable->setVertexArray(vertexArray.p());
|
|
drawables[GridBorder] = gridBorderDrawable;
|
|
}
|
|
{
|
|
std::vector<cvf::Vec3d> interpolatedGridPoints;
|
|
std::vector<cvf::Vec3d> interpolatedGridNormals;
|
|
|
|
size_t newStartIndex = originalWellPathSize - wellPathPoints.size();
|
|
double firstMd = wellPathGeometry()->m_measuredDepths.at(newStartIndex);
|
|
double lastMd = wellPathGeometry()->m_measuredDepths.back();
|
|
|
|
double md = lastMd;
|
|
while (md >= firstMd)
|
|
{
|
|
cvf::Vec3d point = wellPathGeometry()->interpolatedPointAlongWellPath(md);
|
|
cvf::Vec3d normal = wellPathGeometry()->interpolatedVectorAlongWellPath(wellPathSegmentNormals, md);
|
|
interpolatedGridPoints.push_back(point);
|
|
interpolatedGridNormals.push_back(normal.getNormalized());
|
|
md -= gridIntervalSize;
|
|
}
|
|
|
|
std::vector<cvf::Vec3f> vertices;
|
|
vertices.reserve(interpolatedGridPoints.size());
|
|
|
|
std::vector<cvf::uint> indices;
|
|
indices.reserve(interpolatedGridPoints.size());
|
|
cvf::uint indexCounter = 0;
|
|
// Normal lines. Start from one to avoid drawing at surface edge.
|
|
for (size_t i = 1; i < interpolatedGridNormals.size(); i++)
|
|
{
|
|
vertices.push_back(cvf::Vec3f(
|
|
displayCoordTransform->transformToDisplayCoord(interpolatedGridPoints[i] + interpolatedGridNormals[i] * planeOffsetFromWellPathCenter)));
|
|
|
|
vertices.push_back(cvf::Vec3f(displayCoordTransform->transformToDisplayCoord(
|
|
interpolatedGridPoints[i] + interpolatedGridNormals[i] * (planeOffsetFromWellPathCenter + planeWidth))));
|
|
|
|
indices.push_back(indexCounter++);
|
|
indices.push_back(indexCounter++);
|
|
}
|
|
|
|
cvf::ref<cvf::PrimitiveSetIndexedUInt> indexedUInt = new cvf::PrimitiveSetIndexedUInt(cvf::PrimitiveType::PT_LINES);
|
|
cvf::ref<cvf::UIntArray> indexArray = new cvf::UIntArray(indices);
|
|
|
|
cvf::ref<cvf::DrawableGeo> normalLinesDrawable = new cvf::DrawableGeo();
|
|
|
|
indexedUInt->setIndices(indexArray.p());
|
|
normalLinesDrawable->addPrimitiveSet(indexedUInt.p());
|
|
|
|
cvf::ref<cvf::Vec3fArray> vertexArray = new cvf::Vec3fArray(vertices);
|
|
normalLinesDrawable->setVertexArray(vertexArray.p());
|
|
|
|
drawables[NormalLines] = normalLinesDrawable;
|
|
}
|
|
return drawables;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
const RigWellPath* Riv3dWellLogGridGeometryGenerator::wellPathGeometry() const
|
|
{
|
|
return m_wellPath->wellPathGeometry();
|
|
}
|