Method constructGraph_

source/MRMesh/MRSegmentMesh.cpp:89–148

}

void MeshSegmenter::constructGraph_()
{
    MR_TIMER;

    // initially:
    //   Graph::VertId = Mesh::FaceId
    //   Graph::EdgeId = Mesh::UndirectedEdgeId

    graphEdgeData_.resize( mesh_.topology.undirectedEdgeSize() );
    Graph::EndsPerEdge ends( mesh_.topology.undirectedEdgeSize() );
    Graph::EdgeBitSet validGraphEdges;
    static_cast<BitSet&>( validGraphEdges ) = mesh_.topology.findNotLoneUndirectedEdges();
    BitSetParallelFor( validGraphEdges, [&]( Graph::EdgeId ge )
    {
        UndirectedEdgeId ue( (int)ge );

        Graph::EndVertices vv;
        vv.v0 = Graph::VertId( (int)mesh_.topology.left( ue ) );
        vv.v1 = Graph::VertId( (int)mesh_.topology.right( ue ) );
        if ( !vv.v0 || !vv.v1 )
        {
            validGraphEdges.reset( ge );
            return;
        }

        assert( vv.v0 != vv.v1 );
        if ( vv.v1 < vv.v0 )
            std::swap( vv.v0, vv.v1 );
        ends[ge] = vv;

        const auto len = mesh_.edgeLength( ue );
        graphEdgeData_[ge] =
        {
            .length = len,
            .lengthCurv = len * curvMetric_( ue )
        };
    } );

    graphVertData_.resize( mesh_.topology.faceSize() );
    Graph::NeighboursPerVertex neis( mesh_.topology.faceSize() );
    Graph::VertBitSet validGraphVerts;
    static_cast<BitSet&>( validGraphVerts ) = mesh_.topology.getValidFaces();
    BitSetParallelFor( validGraphVerts, [&]( Graph::VertId gv )
    {
        FaceId f( (int)gv );
        Graph::Neighbours n;
        n.reserve( mesh_.topology.getFaceDegree( f ) );
        for ( auto e : leftRing( mesh_.topology, f ) )
        {
            Graph::EdgeId ge( int( e.undirected() ) );
            assert( mesh_.topology.left( e ) = f );
            if ( mesh_.topology.right( e ) )
                n.push_back( ge );
        }
        graphVertData_[gv].area = mesh_.area( f );
        std::sort( n.begin(), n.end() );
        neis[gv] = std::move( n );
    } );