FabLab_Chemnitz/mightyscape-1.2
FabLab_Chemnitz/mightyscape-1.2
1
0
Fork 0
Code Pull Requests Wiki Activity

bugfix flevobezier

Browse Source
This commit is contained in:
Mario Voigt 2024-01-23 10:39:36 +01:00
parent c4048045ed
commit dd81cbfb99
1 changed files with 43 additions and 40 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

83
extensions/fablabchemnitz/flevobezier/flevobezier.py
View File

@ -10,50 +10,53 @@ import inkex
import gettext import gettext
from inkex.paths import Path from inkex.paths import Path
import sys import sys
def pout(t): sys.exit((gettext.gettext(t)))
class FlevoBezier(inkex.EffectExtension): class FlevoBezier(inkex.EffectExtension):
def effect(self): def effect(self):
if len(self.svg.selected) == 0: pout("Please select at least one path.") if len(self.svg.selected) == 0: inkex.utils.debug("Please select at least one path.")
for obj in self.svg.selected: # The objects are the paths, which may be compound for element in self.svg.selected: # The objects are the paths, which may be compound
curr = self.svg.selected[obj] if element.tag == inkex.addNS('path','svg'):
raw = Path(curr.get("d")).to_arrays() curr = self.svg.selected[element]
subpaths, prev = [], 0 raw = Path(curr.get("d")).to_arrays()
for i in range(len(raw)): # Breaks compound paths into simple paths subpaths, prev = [], 0
if raw[i][0] == 'M' and i != 0: for i in range(len(raw)): # Breaks compound paths into simple paths
subpaths.append(raw[prev:i]) if raw[i][0] == 'M' and i != 0:
prev = i subpaths.append(raw[prev:i])
subpaths.append(raw[prev:]) prev = i
subpaths.append(raw[prev:])
output = ""
for simpath in subpaths: output = ""
closed = False for simpath in subpaths:
if simpath[-1][0] == 'Z': closed = False
closed = True if simpath[-1][0] == 'Z':
if simpath[-2][0] == 'L': simpath[-1][1] = simpath[0][1] closed = True
else: simpath.pop() if simpath[-2][0] == 'L': simpath[-1][1] = simpath[0][1]
#nodes = [node(simpath[i][1][-2:]) for i in range(len(simpath))] else: simpath.pop()
nodes = [] #nodes = [node(simpath[i][1][-2:]) for i in range(len(simpath))]
for i in range(len(simpath)): nodes = []
if simpath[i][0] == 'V': # vertical and horizontal lines only have one point in args, but 2 are required for i in range(len(simpath)):
#inkex.utils.debug(simpath[i][0]) if simpath[i][0] == 'V': # vertical and horizontal lines only have one point in args, but 2 are required
simpath[i][0]='L' #overwrite V with regular L command #inkex.utils.debug(simpath[i][0])
add=simpath[i-1][1][0] #read the X value from previous segment simpath[i][0]='L' #overwrite V with regular L command
simpath[i][1].append(simpath[i][1][0]) #add the second (missing) argument by taking argument from previous segment add=simpath[i-1][1][0] #read the X value from previous segment
simpath[i][1][0]=add #replace with recent X after Y was appended simpath[i][1].append(simpath[i][1][0]) #add the second (missing) argument by taking argument from previous segment
if simpath[i][0] == 'H': # vertical and horizontal lines only have one point in args, but 2 are required simpath[i][1][0]=add #replace with recent X after Y was appended
#inkex.utils.debug(simpath[i][0]) if simpath[i][0] == 'H': # vertical and horizontal lines only have one point in args, but 2 are required
simpath[i][0]='L' #overwrite H with regular L command #inkex.utils.debug(simpath[i][0])
simpath[i][1].append(simpath[i-1][1][1]) #add the second (missing) argument by taking argument from previous segment simpath[i][0]='L' #overwrite H with regular L command
#inkex.utils.debug(simpath[i]) simpath[i][1].append(simpath[i-1][1][1]) #add the second (missing) argument by taking argument from previous segment
nodes.append(node(simpath[i][1][-2:])) #inkex.utils.debug(simpath[i])
output += flevobezier(nodes, closed) nodes.append(node(simpath[i][1][-2:]))
curr.set("d", output) output += flevobezier(nodes, closed)
curr.set("d", output)
else:
inkex.utils.debug("element {} is not a path! Try to degroup / convert before!".format(element.get('id')))
# The main algorithm! Yay! # The main algorithm! Yay!
def flevobezier(points, z): def flevobezier(points, z):
if len(points) < 2: pout("A curve isn't a point, silly!") if len(points) < 2: inkex.utils.debug("A curve isn't a point, silly!")
res = [] res = []
prevtrail, trail, lead, window = 0, 0, 1, points[:2] # Start with first two points prevtrail, trail, lead, window = 0, 0, 1, points[:2] # Start with first two points
maybeover = False # Over by error followed by over by angle -> backup maybeover = False # Over by error followed by over by angle -> backup
@ -66,7 +69,7 @@ def flevobezier(points, z):
try: try:
dist(v) / dist(w) dist(v) / dist(w)
except ZeroDivisionError as e: except ZeroDivisionError as e:
pout("Division by zero. Check if your path contains duplicate handles.") inkex.utils.debug("Division by zero. Check if your path contains duplicate handles.")
if dotp(v, w) / dist(v) / dist(w) >= 0.5: # 60 degrees or less, over by angle if dotp(v, w) / dist(v) / dist(w) >= 0.5: # 60 degrees or less, over by angle
if maybeover: # backup if maybeover: # backup
newcurve = stress(points[prevtrail:lead])[0] newcurve = stress(points[prevtrail:lead])[0]
@ -124,7 +127,7 @@ def flevobezier(points, z):
res[t - 1] = res[t] + spin(v, sign * theta) res[t - 1] = res[t] + spin(v, sign * theta)
res[t + 1] = res[t] + spin(w, -sign * theta) res[t + 1] = res[t] + spin(w, -sign * theta)
except ZeroDivisionError: except ZeroDivisionError:
pout("Path has only one point left. Cannot continue") inkex.utils.debug("Path has only one point left. Cannot continue")
res.append(ouro) res.append(ouro)
# Formatting and final output # Formatting and final output
out = "M " + str(res[0]) out = "M " + str(res[0])
@ -191,7 +194,7 @@ def cubicfrom4(nodes, p = None, q = None):
x = nodes[1] - (1 - lm) ** 3 * nodes[0] - lm ** 3 * nodes[3] x = nodes[1] - (1 - lm) ** 3 * nodes[0] - lm ** 3 * nodes[3]
y = nodes[2] - (1 - mu) ** 3 * nodes[0] - mu ** 3 * nodes[3] y = nodes[2] - (1 - mu) ** 3 * nodes[0] - mu ** 3 * nodes[3]
det = a * d - b * c det = a * d - b * c
if not det: pout("Singular matrix!") if not det: inkex.utils.debug("Singular matrix!")
l, m = (d * x - b * y) / det, (a * y - c * x) / det l, m = (d * x - b * y) / det, (a * y - c * x) / det
return [nodes[0], l, m, nodes[3]] return [nodes[0], l, m, nodes[3]]