Given a bunch of line segments, return distance which is within mesh

[clbarnes]

Takes an array of source and target points.

Algorithm:

• For each source point, cast rays to target points
• For those which intersect, cast another ray from the intersection (or point+epsilon beyond it?) in case the same edge intersects multiple times: repeat until no intersection is found
• For those which do not intersect, check whether the starting point is inside the mesh

This practically just uses existing methods (maybe want to do the epsilon projection in rust) so could be done in python.

Returns an array of floats between 0 and segment_length for how much is inside the mesh.