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

#2585 3d Well Log Curves: Draw line along well path

Browse Source
This commit is contained in:
Rebecca Cox
2018-03-09 15:42:23 +01:00
parent 540c4e57c9
commit c63aee779d
4 changed files with 92 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

97
ApplicationCode/ModelVisualization/Riv3dWellLogPlanePartMgr.cpp
View File

@@ -47,33 +47,11 @@ void Riv3dWellLogPlanePartMgr::append3dWellLogCurvesToModel(cvf::ModelBasicList*
m_3dWellLogCurveGeometryGenerator = new Riv3dWellLogCurveGeometryGenerator;
std::vector<cvf::Vec3d> wellPathPoints = m_wellPathGeometry->m_wellPathPoints;
std::vector<cvf::Vec3f> vertices;
vertices.resize(wellPathPoints.size());
cvf::Mat4d transMat;
transMat.setTranslation(cvf::Vec3d(0, 0, 10));
for (size_t i = 0; i < wellPathPoints.size(); i++)
{
wellPathPoints[i].transformPoint(transMat);
vertices[i] = cvf::Vec3f(displayCoordTransform->transformToDisplayCoord(wellPathPoints[i]));
}
std::vector<cvf::uint> indices;
indices.resize((vertices.size() - 1) * 2);
cvf::uint counter = 0;
for (size_t i = 0; i < indices.size(); i++)
{
indices[i] = counter;
if (i % 2 == 0) counter++;
}
std::vector<cvf::uint> indices = createPolylineIndices(m_wellPathGeometry->m_wellPathPoints.size());
for (Rim3dWellLogCurve* rim3dWellLogCurve : rim3dWellLogCurves)
{
std::vector<cvf::Vec3f> vertices = createCurveVertices(rim3dWellLogCurve, displayCoordTransform);
cvf::ref<cvf::Drawable> drawable = m_3dWellLogCurveGeometryGenerator->createDrawable(vertices, indices);
caf::SurfaceEffectGenerator surfaceGen(cvf::Color4f(255, 0, 0, 0.5), caf::PO_1);
@@ -89,3 +67,74 @@ void Riv3dWellLogPlanePartMgr::append3dWellLogCurvesToModel(cvf::ModelBasicList*
}
}
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
std::vector<cvf::Vec3f> Riv3dWellLogPlanePartMgr::createCurveVertices(const Rim3dWellLogCurve* rim3dWellLogCurve,
const caf::DisplayCoordTransform* displayCoordTransform)
{
std::vector<cvf::Vec3d> wellPathPoints = m_wellPathGeometry->m_wellPathPoints;
std::vector<cvf::Vec3f> vertices;
vertices.resize(wellPathPoints.size());
std::vector<cvf::Vec3d> curveNormals;
curveNormals.reserve(wellPathPoints.size());
for (size_t i = 0; i < wellPathPoints.size() - 1; i++)
{
cvf::Vec3d wellPathSegment = wellPathPoints[i + 1] - wellPathPoints[i];
cvf::Vec3d normVec;
if (rim3dWellLogCurve->drawPlane() == Rim3dWellLogCurve::HORIZONTAL_LEFT)
{
normVec = -wellPathSegment.perpendicularVector();
}
else
{
normVec = wellPathSegment.perpendicularVector();
}
curveNormals.push_back((wellPathSegment ^ normVec).getNormalized()*30);
}
cvf::Vec3d wellPathSegment = wellPathPoints[wellPathPoints.size()-1] - wellPathPoints[wellPathPoints.size() - 2];
cvf::Vec3d normVec = wellPathSegment.perpendicularVector();
curveNormals.push_back((wellPathSegment ^ normVec).getNormalized() * 30);
for (size_t i = 0; i < curveNormals.size(); i++)
{
cvf::Mat4d transMat;
transMat.setTranslation(curveNormals[i]);
vertices[i] = cvf::Vec3f(displayCoordTransform->transformToDisplayCoord(wellPathPoints[i].getTransformedPoint(transMat)));
}
// cvf::Mat4d transMat;
// transMat.setTranslation(cvf::Vec3d(0, 0, 10));
//
// for (size_t i = 0; i < wellPathPoints.size(); i++)
// {
// vertices[i] = cvf::Vec3f(displayCoordTransform->transformToDisplayCoord(wellPathPoints[i].getTransformedPoint(transMat)));
// }
return vertices;
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
std::vector<cvf::uint> Riv3dWellLogPlanePartMgr::createPolylineIndices(size_t vertexCount)
{
std::vector<cvf::uint> indices;
indices.resize((vertexCount - 1) * 2);
cvf::uint counter = 0;
for (size_t i = 0; i < indices.size(); i++)
{
indices[i] = counter;
if (i % 2 == 0) counter++;
}
return indices;
}