QGIS/src/analysis/processing/qgsalgorithmcheckgeometryselfintersection.cpp
2025-05-15 13:08:36 +10:00

250 lines
10 KiB
C++

/***************************************************************************
qgsalgorithmcheckgeometryselfintersection.cpp
---------------------
begin : April 2025
copyright : (C) 2025 by Jacky Volpes
email : jacky dot volpes at oslandia dot com
***************************************************************************/
/***************************************************************************
* *
* This program 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 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#include "qgsalgorithmcheckgeometryselfintersection.h"
#include "qgsgeometrycheckcontext.h"
#include "qgsgeometrycheckerror.h"
#include "qgsgeometryselfintersectioncheck.h"
#include "qgspoint.h"
#include "qgsvectorlayer.h"
#include "qgsvectordataproviderfeaturepool.h"
///@cond PRIVATE
QString QgsGeometryCheckSelfIntersectionAlgorithm::name() const
{
return QStringLiteral( "checkgeometryselfintersection" );
}
QString QgsGeometryCheckSelfIntersectionAlgorithm::displayName() const
{
return QObject::tr( "Self-intersections" );
}
QString QgsGeometryCheckSelfIntersectionAlgorithm::shortDescription() const
{
return QObject::tr( "Detects self-intersecting geometries." );
}
QStringList QgsGeometryCheckSelfIntersectionAlgorithm::tags() const
{
return QObject::tr( "check,geometry,intersection" ).split( ',' );
}
QString QgsGeometryCheckSelfIntersectionAlgorithm::group() const
{
return QObject::tr( "Check geometry" );
}
QString QgsGeometryCheckSelfIntersectionAlgorithm::groupId() const
{
return QStringLiteral( "checkgeometry" );
}
QString QgsGeometryCheckSelfIntersectionAlgorithm::shortHelpString() const
{
return QObject::tr( "This algorithm checks self-intersecting geometries.\n"
"Self-intersecting geometries are errors." );
}
Qgis::ProcessingAlgorithmFlags QgsGeometryCheckSelfIntersectionAlgorithm::flags() const
{
return QgsProcessingAlgorithm::flags() | Qgis::ProcessingAlgorithmFlag::NoThreading;
}
QgsGeometryCheckSelfIntersectionAlgorithm *QgsGeometryCheckSelfIntersectionAlgorithm::createInstance() const
{
return new QgsGeometryCheckSelfIntersectionAlgorithm();
}
void QgsGeometryCheckSelfIntersectionAlgorithm::initAlgorithm( const QVariantMap &configuration )
{
Q_UNUSED( configuration )
addParameter( new QgsProcessingParameterFeatureSource(
QStringLiteral( "INPUT" ), QObject::tr( "Input layer" ),
QList<int>()
<< static_cast<int>( Qgis::ProcessingSourceType::VectorPolygon )
<< static_cast<int>( Qgis::ProcessingSourceType::VectorLine )
) );
addParameter( new QgsProcessingParameterField(
QStringLiteral( "UNIQUE_ID" ), QObject::tr( "Unique feature identifier" ), QString(), QStringLiteral( "INPUT" )
) );
addParameter( new QgsProcessingParameterFeatureSink(
QStringLiteral( "ERRORS" ), QObject::tr( "Self-intersecting errors" ), Qgis::ProcessingSourceType::VectorPoint
) );
addParameter( new QgsProcessingParameterFeatureSink(
QStringLiteral( "OUTPUT" ), QObject::tr( "Self-intersecting features" ), Qgis::ProcessingSourceType::VectorAnyGeometry, QVariant(), true, false
) );
std::unique_ptr<QgsProcessingParameterNumber> tolerance = std::make_unique<QgsProcessingParameterNumber>(
QStringLiteral( "TOLERANCE" ), QObject::tr( "Tolerance" ), Qgis::ProcessingNumberParameterType::Integer, 8, false, 1, 13
);
tolerance->setFlags( tolerance->flags() | Qgis::ProcessingParameterFlag::Advanced );
tolerance->setHelp( QObject::tr( "The \"Tolerance\" advanced parameter defines the numerical precision of geometric operations, "
"given as an integer n, meaning that any difference smaller than 10⁻ⁿ (in map units) is considered zero." ) );
addParameter( tolerance.release() );
}
bool QgsGeometryCheckSelfIntersectionAlgorithm::prepareAlgorithm( const QVariantMap &parameters, QgsProcessingContext &context, QgsProcessingFeedback * )
{
mTolerance = parameterAsInt( parameters, QStringLiteral( "TOLERANCE" ), context );
return true;
}
QgsFields QgsGeometryCheckSelfIntersectionAlgorithm::outputFields()
{
QgsFields fields;
fields.append( QgsField( QStringLiteral( "gc_layerid" ), QMetaType::QString ) );
fields.append( QgsField( QStringLiteral( "gc_layername" ), QMetaType::QString ) );
fields.append( QgsField( QStringLiteral( "gc_partidx" ), QMetaType::Int ) );
fields.append( QgsField( QStringLiteral( "gc_ringidx" ), QMetaType::Int ) );
fields.append( QgsField( QStringLiteral( "gc_vertidx" ), QMetaType::Int ) );
fields.append( QgsField( QStringLiteral( "gc_errorx" ), QMetaType::Double ) );
fields.append( QgsField( QStringLiteral( "gc_errory" ), QMetaType::Double ) );
fields.append( QgsField( QStringLiteral( "gc_error" ), QMetaType::QString ) );
fields.append( QgsField( QStringLiteral( "gc_segment_1" ), QMetaType::Int ) );
fields.append( QgsField( QStringLiteral( "gc_segment_2" ), QMetaType::Int ) );
return fields;
}
QVariantMap QgsGeometryCheckSelfIntersectionAlgorithm::processAlgorithm( const QVariantMap &parameters, QgsProcessingContext &context, QgsProcessingFeedback *feedback )
{
QString dest_output;
QString dest_errors;
const std::unique_ptr<QgsProcessingFeatureSource> input( parameterAsSource( parameters, QStringLiteral( "INPUT" ), context ) );
if ( !input )
throw QgsProcessingException( invalidSourceError( parameters, QStringLiteral( "INPUT" ) ) );
const QString uniqueIdFieldName( parameterAsString( parameters, QStringLiteral( "UNIQUE_ID" ), context ) );
const int uniqueIdFieldIdx = input->fields().indexFromName( uniqueIdFieldName );
if ( uniqueIdFieldIdx == -1 )
throw QgsProcessingException( QObject::tr( "Missing field %1 in input layer" ).arg( uniqueIdFieldName ) );
const QgsField uniqueIdField = input->fields().at( uniqueIdFieldIdx );
QgsFields fields = outputFields();
fields.append( uniqueIdField );
const std::unique_ptr<QgsFeatureSink> sink_output( parameterAsSink(
parameters, QStringLiteral( "OUTPUT" ), context, dest_output, fields, input->wkbType(), input->sourceCrs()
) );
const std::unique_ptr<QgsFeatureSink> sink_errors( parameterAsSink(
parameters, QStringLiteral( "ERRORS" ), context, dest_errors, fields, Qgis::WkbType::Point, input->sourceCrs()
) );
if ( !sink_errors )
throw QgsProcessingException( invalidSinkError( parameters, QStringLiteral( "ERRORS" ) ) );
QgsProcessingMultiStepFeedback multiStepFeedback( 3, feedback );
const QgsProject *project = QgsProject::instance();
QgsGeometryCheckContext checkContext = QgsGeometryCheckContext( mTolerance, input->sourceCrs(), project->transformContext(), project );
// Test detection
QList<QgsGeometryCheckError *> checkErrors;
QStringList messages;
const QgsGeometrySelfIntersectionCheck check( &checkContext, QVariantMap() );
multiStepFeedback.setCurrentStep( 1 );
feedback->setProgressText( QObject::tr( "Preparing features…" ) );
QMap<QString, QgsFeaturePool *> featurePools;
std::unique_ptr<QgsVectorLayer> inputLayer( input->materialize( QgsFeatureRequest() ) );
QgsVectorDataProviderFeaturePool featurePool = QgsVectorDataProviderFeaturePool( inputLayer.get() );
featurePools.insert( inputLayer->id(), &featurePool );
multiStepFeedback.setCurrentStep( 2 );
feedback->setProgressText( QObject::tr( "Collecting errors…" ) );
check.collectErrors( featurePools, checkErrors, messages, feedback );
multiStepFeedback.setCurrentStep( 3 );
feedback->setProgressText( QObject::tr( "Exporting errors…" ) );
const double step { checkErrors.size() > 0 ? 100.0 / checkErrors.size() : 1 };
long i = 0;
feedback->setProgress( 0.0 );
for ( const QgsGeometryCheckError *error : checkErrors )
{
const QgsGeometryCheckErrorSingle *singleError = dynamic_cast<const QgsGeometryCheckErrorSingle *>( error );
if ( !singleError )
break;
const QgsGeometrySelfIntersectionCheckError *selfIntersectionError = dynamic_cast<const QgsGeometrySelfIntersectionCheckError *>( singleError->singleError() );
if ( !selfIntersectionError )
break;
const QgsGeometryUtils::SelfIntersection &intersection = selfIntersectionError->intersection();
if ( feedback->isCanceled() )
break;
QgsFeature f;
QgsAttributes attrs = f.attributes();
attrs << error->layerId()
<< inputLayer->name()
<< error->vidx().part
<< error->vidx().ring
<< error->vidx().vertex
<< error->location().x()
<< error->location().y()
<< error->value().toString()
<< intersection.segment1
<< intersection.segment2
<< inputLayer->getFeature( error->featureId() ).attribute( uniqueIdField.name() );
f.setAttributes( attrs );
f.setGeometry( error->geometry() );
if ( sink_output && !sink_output->addFeature( f, QgsFeatureSink::FastInsert ) )
throw QgsProcessingException( writeFeatureError( sink_output.get(), parameters, QStringLiteral( "OUTPUT" ) ) );
f.setGeometry( QgsGeometry::fromPoint( QgsPoint( error->location().x(), error->location().y() ) ) );
if ( !sink_errors->addFeature( f, QgsFeatureSink::FastInsert ) )
throw QgsProcessingException( writeFeatureError( sink_errors.get(), parameters, QStringLiteral( "ERRORS" ) ) );
i++;
feedback->setProgress( 100.0 * step * static_cast<double>( i ) );
}
// Place the point layer above the other layer
if ( context.willLoadLayerOnCompletion( dest_output ) && context.willLoadLayerOnCompletion( dest_errors ) )
{
context.layerToLoadOnCompletionDetails( dest_errors ).layerSortKey = 0;
context.layerToLoadOnCompletionDetails( dest_output ).layerSortKey = 1;
}
// cleanup memory of the pointed data
for ( const QgsGeometryCheckError *error : checkErrors )
{
delete error;
}
QVariantMap outputs;
if ( sink_output )
outputs.insert( QStringLiteral( "OUTPUT" ), dest_output );
outputs.insert( QStringLiteral( "ERRORS" ), dest_errors );
return outputs;
}
///@endcond