Method find

source/MRMesh/MRReducePath.cpp:426–469

}

void PathInPlanarTriangleStrip::find( const Vector2f & end, std::function< void(float) > edgeCrossPosition )
{
    nextEdgeNewLeft( end );

    auto curr = edges_.back().left;
    auto prev = previous_[curr];
    for ( int i = (int)edges_.size() - 2; i >= 0; --i )
    {
        if ( edges_[i].left == prev )
        {
            edgeCrossPosition( 0 );
            curr = prev;
            prev = previous_[prev];
        }
        else if ( edges_[i].right == prev )
        {
            edgeCrossPosition( 1 );
            curr = prev;
            prev = previous_[prev];
        }
        else if ( edges_[i].left ==  curr )
        {
            edgeCrossPosition( 0 );
        }
        else if ( edges_[i].right == curr )
        {
            edgeCrossPosition( 1 );
        }
        else
        {
            float lc = cross( prev, edges_[i].left, curr );
            float rc = cross( prev, edges_[i].right, curr );
            if ( lc - rc  != 0 )
            {
                edgeCrossPosition( std::clamp( lc / ( lc - rc ), 0.0f, 1.0f ) );
            }
            else 
            {
                // prev-point and curr-point are on the same line with edges_[i], return something
                edgeCrossPosition( 0.5f );
            }
        }
    }
}

class TriangleStripUnfolder
{