d3f1222d3809d7a893de4cee541e24b3636563c5
in some cases, in particular when the the edge loops were not planar. Now rather than finding the shortest distance between two vertices, one from each edge loop and using that as a starting point, it now finds the smallest sum of distances between all vertex pairs that would be connected.
Description
No description provided
Languages
C++
78%
Python
14.9%
C
2.9%
GLSL
1.9%
CMake
1.2%
Other
0.9%