Test on findClosestWeightedMeshPoint

source/MRMesh/MRClosestWeightedPoint.cpp

@@ -83,6 +83,7 @@ std::optional<ClosestTriPoint> findClosestWeightedTriPoint( const Vector3d& locd
         ws[i] = pointWeight( vs[i] );
     }
 
+    // considering unsigned distances, each triangle has two planes where euclidean distance equals interpolated point weight
     const auto maybePlane = ( dot( locd - ps[0], dirDblArea( ps ) ) >= 0 ) ?
         tangentPlaneToSpheres( ps[0], ps[1], ps[2], ws[0], ws[1], ws[2] ) :
         tangentPlaneToSpheres( ps[1], ps[0], ps[2], ws[1], ws[0], ws[2] );

source/MRTest/MRPointCloudVariadicOffsetTests.cpp

@@ -1,5 +1,6 @@
 #include <MRMesh/MRClosestWeightedPoint.h>
 #include <MRMesh/MRPointCloud.h>
+#include <MRMesh/MRMesh.h>
 #include <MRMesh/MRGTest.h>
 
 namespace MR
@@ -45,4 +46,35 @@ TEST( MRMesh, findClosestWeightedPoint )
     }
 }
 
+TEST( MRMesh, findClosestWeightedMeshPoint )
+{
+    Triangulation t{
+        { 0_v, 1_v, 2_v }
+    };
+    VertCoords vs{
+        {-1, -1, 0 },  //0_v
+        {-1,  1, 0 },  //1_v
+        { 1,  0, 0 },  //2_v
+    };
+    auto mesh = Mesh::fromTriangles( std::move( vs ), t );
+
+    DistanceFromWeightedPointsComputeParams params;
+    auto distance = [&]( Vector3f loc )
+    {
+        auto pd = findClosestWeightedMeshPoint( loc, mesh, params );
+        assert( !pd.mtp.onEdge( mesh.topology ) );
+        return pd.dist;
+    };
+
+    params.pointWeight = [&]( VertId ) { return 1; };
+    params.maxWeight = 1;
+    for ( float z = -2; z <= 2; z += 0.1f )
+        EXPECT_NEAR( distance( Vector3f( 0, 0, z ) ), -1 + std::abs( z ), 1e-7f );
+
+    params.pointWeight = [&]( VertId ) { return -1; };
+    params.maxWeight = -1;
+    for ( float z = -2; z <= 2; z += 0.1f )
+        EXPECT_NEAR( distance( Vector3f( 0, 0, z ) ),  1 + std::abs( z ), 1e-7f );
+}
+
 } //namespace MR