mirror of
https://github.com/OPM/ResInsight.git
synced 2026-08-27 13:47:12 -05:00
Magne Sjaastad
56e98ba1c4
Migrate all assert macros in ApplicationLibCode to CAF_ASSERT and remove every use of cvfAssert.h. CVF_ASSERT is replaced one to one. CVF_TIGHT_ASSERT is also replaced by CAF_ASSERT, which is semantically exact: CVF_ENABLE_TIGHT_ASSERTS is 1 only under _DEBUG, and that is what CAF_ASSERT now does. The two CVF_FAIL_MSG sites become CAF_ASSERT( false && "message" ), preserving the message with the idiom already used elsewhere in the code base. Counts before and after: CVF_ASSERT 1044 to 0, CVF_TIGHT_ASSERT 66 to 0, CVF_FAIL_MSG 2 to 0, cvfAssert.h references 154 to 0. Include handling: files that included cvfAssert.h directly now include cafAssert.h instead, includes left dead by the migration are removed, and files that were relying on cvfAssert.h transitively get an explicit cafAssert.h. Files that reach cafAssert.h through another caf header are left unchanged; a missing include here is a compile error, not a silently disabled assert. ResultStatisticsCache links only LibCore and therefore had no path to cafAssert.h. Add the cafPdmCore directory as a private include path rather than linking the library, since cafAssert.h is header only. Note that this stops these asserts from firing in Release and RelWithDebInfo, where CVF_ASSERT was previously active.
240 lines
12 KiB
C++
240 lines
12 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) 2017 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 "RigHexIntersectionTools.h"
|
|
|
|
#include "RigCellGeometryTools.h"
|
|
|
|
#include "cvfBoundingBox.h"
|
|
#include "cvfGeometryTools.h"
|
|
#include "cvfRay.h"
|
|
|
|
#include "cafAssert.h"
|
|
#include "cafHexGridIntersectionTools/cafHexGridIntersectionTools.h"
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
int RigHexIntersectionTools::lineHexCellIntersection( const cvf::Vec3d& p1,
|
|
const cvf::Vec3d& p2,
|
|
const std::array<cvf::Vec3d, 8>& hexCorners,
|
|
const size_t hexIndex,
|
|
std::vector<HexIntersectionInfo>* intersections )
|
|
{
|
|
CAF_ASSERT( intersections != nullptr );
|
|
|
|
std::set<HexIntersectionInfo> uniqueIntersections;
|
|
|
|
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 )
|
|
{
|
|
uniqueIntersections.insert(
|
|
HexIntersectionInfo( intersection, isEntering, static_cast<cvf::StructGridInterface::FaceType>( face ), hexIndex ) );
|
|
}
|
|
}
|
|
}
|
|
|
|
int intersectionCount = 0;
|
|
for ( const auto& intersection : uniqueIntersections )
|
|
{
|
|
intersections->push_back( intersection );
|
|
++intersectionCount;
|
|
}
|
|
|
|
return intersectionCount;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
bool RigHexIntersectionTools::lineIntersectsHexCell( const cvf::Vec3d& p1, const cvf::Vec3d& p2, const std::array<cvf::Vec3d, 8>& hexCorners )
|
|
{
|
|
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 )
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
bool RigHexIntersectionTools::isPointInCell( const cvf::Vec3d& point, const std::array<cvf::Vec3d, 8>& hexCorners )
|
|
{
|
|
cvf::Ray ray;
|
|
ray.setOrigin( point );
|
|
size_t intersections = 0;
|
|
|
|
for ( int face = 0; face < 6; ++face )
|
|
{
|
|
cvf::ubyte faceVertexIndices[4];
|
|
cvf::StructGridInterface::cellFaceVertexIndices( static_cast<cvf::StructGridInterface::FaceType>( face ), faceVertexIndices );
|
|
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;
|
|
if ( ray.triangleIntersect( hexCorners[faceVertexIndices[i]], hexCorners[faceVertexIndices[next]], faceCenter ) )
|
|
{
|
|
++intersections;
|
|
}
|
|
}
|
|
}
|
|
return intersections % 2 == 1;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
bool RigHexIntersectionTools::planeHexCellIntersection( const std::array<cvf::Vec3d, 8>& hexCorners,
|
|
const cvf::Plane& fracturePlane,
|
|
std::list<std::pair<cvf::Vec3d, cvf::Vec3d>>& intersectionLineSegments )
|
|
{
|
|
bool isCellIntersected = false;
|
|
cvf::ubyte faceVertexIndices[4];
|
|
caf::HexGridIntersectionTools::ClipVx triangleIntersectionPoint1;
|
|
caf::HexGridIntersectionTools::ClipVx triangleIntersectionPoint2;
|
|
bool isMostVxesOnPositiveSideOfP1 = false;
|
|
|
|
for ( int face = 0; face < 6; ++face )
|
|
{
|
|
cvf::StructGridInterface::cellFaceVertexIndices( static_cast<cvf::StructGridInterface::FaceType>( face ), faceVertexIndices );
|
|
|
|
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;
|
|
|
|
bool isIntersectingPlane = caf::HexGridIntersectionTools::planeTriangleIntersection( fracturePlane,
|
|
hexCorners[faceVertexIndices[i]],
|
|
0,
|
|
hexCorners[faceVertexIndices[next]],
|
|
1,
|
|
faceCenter,
|
|
2,
|
|
&triangleIntersectionPoint1,
|
|
&triangleIntersectionPoint2,
|
|
&isMostVxesOnPositiveSideOfP1 );
|
|
|
|
if ( isIntersectingPlane )
|
|
{
|
|
isCellIntersected = true;
|
|
intersectionLineSegments.emplace_back( triangleIntersectionPoint1.vx, triangleIntersectionPoint2.vx );
|
|
}
|
|
}
|
|
}
|
|
return isCellIntersected;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
bool RigHexIntersectionTools::planeHexIntersectionPolygons( const std::array<cvf::Vec3d, 8>& hexCorners,
|
|
cvf::Mat4d transformMatrixForPlane,
|
|
std::vector<std::vector<cvf::Vec3d>>& polygons )
|
|
{
|
|
bool isCellIntersected = false;
|
|
|
|
cvf::Plane fracturePlane;
|
|
fracturePlane.setFromPointAndNormal( transformMatrixForPlane.translation(), static_cast<cvf::Vec3d>( transformMatrixForPlane.col( 2 ) ) );
|
|
|
|
// Find line-segments where cell and fracture plane intersects
|
|
std::list<std::pair<cvf::Vec3d, cvf::Vec3d>> intersectionLineSegments;
|
|
|
|
isCellIntersected = planeHexCellIntersection( hexCorners, fracturePlane, intersectionLineSegments );
|
|
|
|
RigCellGeometryTools::createPolygonFromLineSegments( intersectionLineSegments, polygons );
|
|
|
|
return isCellIntersected;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
bool operator<( const HexIntersectionInfo& hi1, const HexIntersectionInfo& hi2 )
|
|
{
|
|
const double tolerance = 1e-6;
|
|
|
|
if ( hi1.m_hexIndex != hi2.m_hexIndex ) return hi1.m_hexIndex < hi2.m_hexIndex;
|
|
if ( hi1.m_face != hi2.m_face ) return hi1.m_face < hi2.m_face;
|
|
if ( hi1.m_isIntersectionEntering != hi2.m_isIntersectionEntering ) return hi1.m_isIntersectionEntering < hi2.m_isIntersectionEntering;
|
|
if ( hi1.m_face != hi2.m_face ) return hi1.m_face < hi2.m_face;
|
|
|
|
if ( cvf::Math::abs( hi2.m_intersectionPoint.x() - hi1.m_intersectionPoint.x() ) > tolerance )
|
|
return hi1.m_intersectionPoint.x() < hi2.m_intersectionPoint.x();
|
|
if ( cvf::Math::abs( hi2.m_intersectionPoint.y() - hi1.m_intersectionPoint.y() ) > tolerance )
|
|
return hi1.m_intersectionPoint.y() < hi2.m_intersectionPoint.y();
|
|
if ( cvf::Math::abs( hi2.m_intersectionPoint.z() - hi1.m_intersectionPoint.z() ) > tolerance )
|
|
return hi1.m_intersectionPoint.z() < hi2.m_intersectionPoint.z();
|
|
|
|
return false;
|
|
}
|