mirror of
https://github.com/OPM/ResInsight.git
synced 2026-10-27 15:41:00 -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.
189 lines
6.3 KiB
C++
189 lines
6.3 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) 2018- Equinor 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 "RiaPolyArcLineSampler.h"
|
|
#include "RiaArcCurveCalculator.h"
|
|
|
|
#include "cvfGeometryTools.h"
|
|
|
|
#include "cafAssert.h"
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
RiaPolyArcLineSampler::RiaPolyArcLineSampler( const cvf::Vec3d& startTangent, const std::vector<cvf::Vec3d>& lineArcEndPoints )
|
|
: m_startTangent( startTangent )
|
|
, m_lineArcEndPoints( lineArcEndPoints )
|
|
, m_maxSamplingsInterval( 0.15 )
|
|
, m_isResamplingLines( true )
|
|
, m_totalMD( 0.0 )
|
|
{
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
std::pair<std::vector<cvf::Vec3d>, std::vector<double>> RiaPolyArcLineSampler::sampledPointsAndMDs( double sampleInterval,
|
|
bool isResamplingLines )
|
|
{
|
|
CAF_ASSERT( sampleInterval > 0.0 );
|
|
|
|
m_maxSamplingsInterval = sampleInterval;
|
|
m_isResamplingLines = isResamplingLines;
|
|
|
|
m_points.clear();
|
|
m_meshDs.clear();
|
|
|
|
double startMD = 0.0;
|
|
|
|
std::vector<cvf::Vec3d> pointsNoDuplicates = RiaPolyArcLineSampler::pointsWithoutDuplicates( m_lineArcEndPoints );
|
|
|
|
if ( pointsNoDuplicates.size() < 2 ) return std::make_pair( m_points, m_meshDs );
|
|
|
|
m_totalMD = startMD;
|
|
|
|
cvf::Vec3d p1 = pointsNoDuplicates[0];
|
|
|
|
m_points.push_back( p1 );
|
|
m_meshDs.push_back( m_totalMD );
|
|
|
|
cvf::Vec3d t2 = m_startTangent;
|
|
|
|
for ( size_t pIdx = 0; pIdx < pointsNoDuplicates.size() - 1; ++pIdx )
|
|
{
|
|
sampleSegment( t2, pointsNoDuplicates[pIdx], pointsNoDuplicates[pIdx + 1], &t2 );
|
|
}
|
|
|
|
return std::make_pair( m_points, m_meshDs );
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
void RiaPolyArcLineSampler::sampleSegment( cvf::Vec3d t1, cvf::Vec3d p1, cvf::Vec3d p2, cvf::Vec3d* endTangent )
|
|
{
|
|
cvf::Vec3d p1p2 = p2 - p1;
|
|
|
|
if ( p1p2.lengthSquared() < 1e-20 ) return;
|
|
|
|
if ( cvf::GeometryTools::getAngle( t1, p1p2 ) < 1e-5 || p1p2.length() < m_maxSamplingsInterval )
|
|
{
|
|
sampleLine( p1, p2, endTangent );
|
|
}
|
|
else // resample arc
|
|
{
|
|
sampleArc( t1, p1, p2, endTangent );
|
|
}
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
std::vector<cvf::Vec3d> RiaPolyArcLineSampler::pointsWithoutDuplicates( const std::vector<cvf::Vec3d>& points )
|
|
{
|
|
std::vector<cvf::Vec3d> outputPoints;
|
|
|
|
cvf::Vec3d previousPoint = cvf::Vec3d::UNDEFINED;
|
|
const double threshold = 1e-6;
|
|
for ( const auto& p : points )
|
|
{
|
|
if ( previousPoint.isUndefined() || ( ( previousPoint - p ).lengthSquared() ) > threshold )
|
|
{
|
|
outputPoints.push_back( p );
|
|
previousPoint = p;
|
|
}
|
|
}
|
|
|
|
return outputPoints;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
void RiaPolyArcLineSampler::sampleLine( cvf::Vec3d p1, cvf::Vec3d p2, cvf::Vec3d* endTangent )
|
|
{
|
|
cvf::Vec3d p1p2 = p2 - p1;
|
|
|
|
double p1p2Length = p1p2.length();
|
|
|
|
if ( m_isResamplingLines && p1p2Length > m_maxSamplingsInterval )
|
|
{
|
|
cvf::Vec3d tp1p2 = p1p2 / p1p2Length;
|
|
double mdInc = m_maxSamplingsInterval;
|
|
while ( mdInc < p1p2Length )
|
|
{
|
|
cvf::Vec3d ps = p1 + mdInc * tp1p2;
|
|
m_points.push_back( ps );
|
|
m_meshDs.push_back( m_totalMD + mdInc );
|
|
mdInc += m_maxSamplingsInterval;
|
|
}
|
|
}
|
|
|
|
m_totalMD += p1p2Length;
|
|
m_points.push_back( p2 );
|
|
m_meshDs.push_back( m_totalMD );
|
|
|
|
( *endTangent ) = p1p2.getNormalized();
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------
|
|
///
|
|
//--------------------------------------------------------------------------------------------------
|
|
void RiaPolyArcLineSampler::sampleArc( cvf::Vec3d t1, cvf::Vec3d p1, cvf::Vec3d p2, cvf::Vec3d* endTangent )
|
|
{
|
|
// Find arc CS
|
|
RiaArcCurveCalculator CS_rad( p1, t1, p2 );
|
|
|
|
double radius = CS_rad.radius();
|
|
cvf::Mat4d arcCS = CS_rad.arcCS();
|
|
|
|
double angleInc = m_maxSamplingsInterval / radius;
|
|
|
|
angleInc = angleInc < m_maxSamplingArcAngle ? angleInc : m_maxSamplingArcAngle; // Angle from 6 deg dogleg on 10 m
|
|
|
|
cvf::Vec3d C = CS_rad.center();
|
|
cvf::Vec3d N = CS_rad.normal();
|
|
|
|
// Sample arc by
|
|
// Rotate vector an increment, and transform to arc CS
|
|
|
|
double arcAngle = cvf::GeometryTools::getAngle( N, p1 - C, p2 - C );
|
|
if ( arcAngle / angleInc > 5000 )
|
|
{
|
|
angleInc = arcAngle / 5000;
|
|
}
|
|
|
|
for ( double angle = angleInc; angle < arcAngle; angle += angleInc )
|
|
{
|
|
cvf::Vec3d C_to_incP = cvf::Vec3d::X_AXIS;
|
|
C_to_incP *= radius;
|
|
C_to_incP.transformVector( cvf::Mat3d::fromRotation( cvf::Vec3d::Z_AXIS, angle ) );
|
|
|
|
C_to_incP.transformPoint( arcCS );
|
|
|
|
m_points.push_back( C_to_incP );
|
|
m_meshDs.push_back( m_totalMD + angle * radius );
|
|
}
|
|
|
|
m_totalMD += arcAngle * radius;
|
|
m_points.push_back( p2 );
|
|
m_meshDs.push_back( m_totalMD );
|
|
|
|
( *endTangent ) = CS_rad.endTangent();
|
|
}
|