shadowfacts/fonttools
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[varLib] "Document" IUP DP algorithm for the case when forced set is empty

Browse Source
This commit is contained in:
Behdad Esfahbod 2017-07-22 18:48:23 -07:00
parent e5ac044969
commit 69206e290e
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Lib/fontTools/varLib/__init__.py
View File

@ -345,6 +345,9 @@ def _iup_contour_optimize(delta, coords, tolerance=0.):
delta = _rot_list(delta, -k)
else:
# Repeat the contour an extra time, solve the 2*n case, then look for solutions of the
# circular n-length problem in the solution for 2*n linear case. I cannot prove that
# this always produces the optimal solution...
chain, costs = _iup_contour_optimize_dp(delta+delta, coords+coords, forced, tolerance, n)
best_sol, best_cost = None, n+1