czc98
czc98
The input is a curve made of a series of points, and the curve is made of line segments, and the line segments are made of two adjacent points. The...
 Curve 1 moves d distance along the surface to get curve 2.
https://ieeexplore.ieee.org/document/4751993 I don't know if this paper will work.
> > I guess @czc98 means a 3d curve offset constrained to the mesh surface. In this case, this recent Siggraph paper on winding numbers on discrete surfaces could come...
Is there any way in Meshlib to do that?
> function > This task can be solved this way: > > 1. Calculate surface distances for vertices near the path: > https://github.com/MeshInspector/MeshLib/blob/master/source/MRMesh/MRSurfaceDistance.h > 2. Extract iso-lines of found distance...
Whether points on a curve are required to be vertices?
> They are not, but you need to manually setup distances in the vertices closest to the curve (as Grantim explained above) before calling `computeSurfaceDistances`. Also this method is limited...
> > Do I just need to find the vertices adjacent to Polyline3 through a topological relationship, construct startVerticesWithDists by calculating the distance from the vertices to Polyline3, and then...