-
-
Notifications
You must be signed in to change notification settings - Fork 100
/
svg.py
173 lines (156 loc) · 5.91 KB
/
svg.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
# -----------------------------------------------------------------------------
# Copyright (c) 2017, Nicolas P. Rougier. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
#
# 1. Redistributions of source code must retain the above copyright notice, this
# list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
# ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
# -----------------------------------------------------------------------------
import re
import bezier
import numpy as np
from lxml import etree
from matplotlib.path import Path
MOVETO = 1
LINETO = 2
CURVE4 = 3
CURVE3 = 4
CLOSE = 5
def get(filename, name):
"""
Read a given element from an SVG file
"""
root = etree.parse(filename).getroot()
return root.xpath("//*[@id='%s']" % name)[0].get("d")
def path(filename, name):
"""
Read and convert an SVG path command into a path representation
"""
path = get(filename, name)
verts, codes = convert(path)
verts, codes = tesselate(verts, codes)
return verts, codes
def convert(path):
"""
Parse and convert an SVG path command into a path representation
Parameters
----------
path : string
A valid SVG path command
"""
# First we separate tokens inside the path
tokens = []
COMMANDS = set('MmZzLlHhVvCcSsQqTtAa')
COMMAND_RE = re.compile("([MmZzLlHhVvCcSsQqTtAa])")
FLOAT_RE = re.compile("[-+]?[0-9]*\.?[0-9]+(?:[eE][-+]?[0-9]+)?")
for x in COMMAND_RE.split(path):
if x in COMMANDS:
tokens.append(x)
for token in FLOAT_RE.findall(x):
tokens.append(float(token))
# Then we process and convert commands
# (Note that not all commands have been implemented)
commands = { 'M': [MOVETO, 2],
'm': [MOVETO, 2],
'L': [LINETO, 2],
'l': [LINETO, 2],
# 'V': [Path.LINETO, 1],
# 'v': [Path.LINETO, 1],
# 'H': [Path.LINETO, 1],
# 'h': [Path.LINETO, 1],
'C': [CURVE4, 6],
'c': [CURVE4, 6],
# 'S': [Path.CURVE4, 4],
# 's': [Path.CURVE4, 4],
'Q': [CURVE3, 4],
'q': [CURVE3, 4],
# 'T': [Path.CURVE3, 2],
# 't': [Path.CURVE3, 2],
# 'A': [None, 7],
# 'a': [None, 7],
'Z': [CLOSE, 0],
'z': [CLOSE, 0] }
index = 0
codes, verts = [], []
last_vertice = np.array([[0, 0]])
while index < len(tokens):
# Token is a command
# (else, we re-use last command because
# SVG allows to omit command when it is the same as the last command)
if isinstance(tokens[index], str):
last_command = tokens[index]
code, n = commands[last_command]
index += 1
if n > 0:
vertices = np.array(tokens[index:index+n]).reshape(n//2,2)
if last_command.islower():
vertices += last_vertice
last_vertice = vertices[-1]
codes.extend([code,]*len(vertices))
verts.extend(vertices.tolist())
index += n
else:
codes.append(code)
verts.append(last_vertice.tolist())
# A 'M/m' follows by several vertices means implicit 'L/l' for
# subsequent vertices
if last_command == 'm':
last_command, code = 'l', LINETO
elif last_command == 'M':
last_command, code = 'L', LINETO
return np.array(verts), codes
def tesselate(verts, codes):
"""
Tesselate a matplotlib path with the given vertices and codes.
Parameters
----------
vertices : array_like
The ``(n, 2)`` float array or sequence of pairs representing the
vertices of the path.
codes : array_like
n-length array integers representing the codes of the path.
"""
tesselated_verts = []
tesselated_codes = []
index = 0
while index < len(codes):
if codes[index] in [MOVETO, LINETO]:
tesselated_codes.append(codes[index])
tesselated_verts.append(verts[index])
index += 1
elif codes[index] == CURVE3:
p1, p2, p3 = verts[index-1:index+2]
V = bezier.quadratic(p1,p2,p3)
C = [LINETO,]*len(V)
tesselated_codes.extend(C[1:])
tesselated_verts.extend(V[1:])
index += 2
elif codes[index] == CURVE4:
p1, p2, p3, p4 = verts[index-1:index+3]
V = bezier.cubic(p1,p2,p3,p4)
C = [LINETO,]*len(V)
tesselated_codes.extend(C[1:])
tesselated_verts.extend(V[1:])
index += 3
elif codes[index] == CLOSE:
index += 1
else:
index += 1
verts = tesselated_verts
codes = tesselated_codes
return np.array(verts), codes