You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
/// not-negative metric that depends both on edge's length and on the angle between its left and right faces (ignoring the different between convex and concave)
41
+
/// \param angleSinFactor multiplier before absolute value of dihedral angle sine in edge metric calculation: zero - planar case, larger values of (PI - dihedral angle)
42
+
/// \param angleSinForBoundary consider this dihedral angle sine for boundary edges;
/// maximal summed metric of tunnel loops to detect
46
46
float maxTunnelLength = FLT_MAX;
47
47
48
48
/// maximal number of iterations to detect all tunnels;
49
49
/// on a big mesh with many tunnels even one iteration can take a while
50
50
int maxIters = 1;
51
51
52
-
/// metric for detectBasisTunnels,
53
-
/// if no metric is given then discreteMinusAbsMeanCurvatureMetric will be used
52
+
/// edge metric that will be used in optimizations,
53
+
/// if co-loops are enabled then this metric must be not-negative,
54
+
/// if no metric is given then either discreteMinusAbsMeanCurvatureMetric (if buildCoLoops = false) or edgeLengthMetric (if buildCoLoops = true) will be used,
55
+
/// using caching via edgeTableSymMetric function can improve the performance, especially in buildCoLoops = true mode
54
56
EdgeMetric metric;
55
57
56
-
/// if true then for every basis loop, findShortestCoLoop will be called;
58
+
/// if true then for every basis loop, findSmallestMetricCoLoop will be called;
57
59
/// it typically results in shorter tunnels found, but requires more time per iteration, and more iterations to find all tunnels
0 commit comments