Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
车家大少爷
three.js
提交
2b2c934e
T
three.js
项目概览
车家大少爷
/
three.js
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
three.js
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
未验证
提交
2b2c934e
编写于
6月 13, 2018
作者:
M
Mr.doob
提交者:
GitHub
6月 13, 2018
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #14276 from jonobr1/13478-zcommands
SVG Improvements
上级
8a9a106f
5248b91f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
96 addition
and
68 deletion
+96
-68
examples/js/loaders/SVGLoader.js
examples/js/loaders/SVGLoader.js
+96
-68
未找到文件。
examples/js/loaders/SVGLoader.js
浏览文件 @
2b2c934e
...
...
@@ -176,48 +176,54 @@ THREE.SVGLoader.prototype = {
case
'
S
'
:
var
numbers
=
parseFloats
(
data
);
path
.
bezierCurveTo
(
getReflection
(
point
.
x
,
control
.
x
),
getReflection
(
point
.
y
,
control
.
y
),
numbers
[
0
],
numbers
[
1
],
numbers
[
2
],
numbers
[
3
]
);
control
.
x
=
numbers
[
0
];
control
.
y
=
numbers
[
1
];
point
.
x
=
numbers
[
2
];
point
.
y
=
numbers
[
3
];
for
(
var
j
=
0
,
jl
=
numbers
.
length
;
j
<
jl
;
j
+=
4
)
{
path
.
bezierCurveTo
(
getReflection
(
point
.
x
,
control
.
x
),
getReflection
(
point
.
y
,
control
.
y
),
numbers
[
j
+
0
],
numbers
[
j
+
1
],
numbers
[
j
+
2
],
numbers
[
j
+
3
]
);
control
.
x
=
numbers
[
j
+
0
];
control
.
y
=
numbers
[
j
+
1
];
point
.
x
=
numbers
[
j
+
2
];
point
.
y
=
numbers
[
j
+
3
];
}
break
;
case
'
Q
'
:
var
numbers
=
parseFloats
(
data
);
path
.
quadraticCurveTo
(
numbers
[
0
],
numbers
[
1
],
numbers
[
2
],
numbers
[
3
]
);
control
.
x
=
numbers
[
0
];
control
.
y
=
numbers
[
1
];
point
.
x
=
numbers
[
2
];
point
.
y
=
numbers
[
3
];
for
(
var
j
=
0
,
jl
=
numbers
.
length
;
j
<
jl
;
j
+=
4
)
{
path
.
quadraticCurveTo
(
numbers
[
j
+
0
],
numbers
[
j
+
1
],
numbers
[
j
+
2
],
numbers
[
j
+
3
]
);
control
.
x
=
numbers
[
j
+
0
];
control
.
y
=
numbers
[
j
+
1
];
point
.
x
=
numbers
[
j
+
2
];
point
.
y
=
numbers
[
j
+
3
];
}
break
;
case
'
T
'
:
var
numbers
=
parseFloats
(
data
);
var
rx
=
getReflection
(
point
.
x
,
control
.
x
);
var
ry
=
getReflection
(
point
.
y
,
control
.
y
);
path
.
quadraticCurveTo
(
rx
,
ry
,
numbers
[
0
],
numbers
[
1
]
);
control
.
x
=
rx
;
control
.
y
=
ry
;
point
.
x
=
numbers
[
0
];
point
.
y
=
numbers
[
1
];
for
(
var
j
=
0
,
jl
=
numbers
.
length
;
j
<
jl
;
j
+=
2
)
{
var
rx
=
getReflection
(
point
.
x
,
control
.
x
);
var
ry
=
getReflection
(
point
.
y
,
control
.
y
);
path
.
quadraticCurveTo
(
rx
,
ry
,
numbers
[
j
+
0
],
numbers
[
j
+
1
]
);
control
.
x
=
rx
;
control
.
y
=
ry
;
point
.
x
=
numbers
[
j
+
0
];
point
.
y
=
numbers
[
j
+
1
];
}
break
;
case
'
A
'
:
...
...
@@ -298,48 +304,54 @@ THREE.SVGLoader.prototype = {
case
'
s
'
:
var
numbers
=
parseFloats
(
data
);
path
.
bezierCurveTo
(
getReflection
(
point
.
x
,
control
.
x
),
getReflection
(
point
.
y
,
control
.
y
),
point
.
x
+
numbers
[
0
],
point
.
y
+
numbers
[
1
],
point
.
x
+
numbers
[
2
],
point
.
y
+
numbers
[
3
]
);
control
.
x
=
point
.
x
+
numbers
[
0
];
control
.
y
=
point
.
y
+
numbers
[
1
];
point
.
x
+=
numbers
[
2
];
point
.
y
+=
numbers
[
3
];
for
(
var
j
=
0
,
jl
=
numbers
.
length
;
j
<
jl
;
j
+=
4
)
{
path
.
bezierCurveTo
(
getReflection
(
point
.
x
,
control
.
x
),
getReflection
(
point
.
y
,
control
.
y
),
point
.
x
+
numbers
[
j
+
0
],
point
.
y
+
numbers
[
j
+
1
],
point
.
x
+
numbers
[
j
+
2
],
point
.
y
+
numbers
[
j
+
3
]
);
control
.
x
=
point
.
x
+
numbers
[
j
+
0
];
control
.
y
=
point
.
y
+
numbers
[
j
+
1
];
point
.
x
+=
numbers
[
j
+
2
];
point
.
y
+=
numbers
[
j
+
3
];
}
break
;
case
'
q
'
:
var
numbers
=
parseFloats
(
data
);
path
.
quadraticCurveTo
(
point
.
x
+
numbers
[
0
],
point
.
y
+
numbers
[
1
],
point
.
x
+
numbers
[
2
],
point
.
y
+
numbers
[
3
]
);
control
.
x
=
point
.
x
+
numbers
[
0
];
control
.
y
=
point
.
y
+
numbers
[
1
];
point
.
x
+=
numbers
[
2
];
point
.
y
+=
numbers
[
3
];
for
(
var
j
=
0
,
jl
=
numbers
.
length
;
j
<
jl
;
j
+=
4
)
{
path
.
quadraticCurveTo
(
point
.
x
+
numbers
[
j
+
0
],
point
.
y
+
numbers
[
j
+
1
],
point
.
x
+
numbers
[
j
+
2
],
point
.
y
+
numbers
[
j
+
3
]
);
control
.
x
=
point
.
x
+
numbers
[
j
+
0
];
control
.
y
=
point
.
y
+
numbers
[
j
+
1
];
point
.
x
+=
numbers
[
j
+
2
];
point
.
y
+=
numbers
[
j
+
3
];
}
break
;
case
'
t
'
:
var
numbers
=
parseFloats
(
data
);
var
rx
=
getReflection
(
point
.
x
,
control
.
x
);
var
ry
=
getReflection
(
point
.
y
,
control
.
y
);
path
.
quadraticCurveTo
(
rx
,
ry
,
point
.
x
+
numbers
[
0
],
point
.
y
+
numbers
[
1
]
);
control
.
x
=
rx
;
control
.
y
=
ry
;
point
.
x
=
point
.
x
+
numbers
[
0
];
point
.
y
=
point
.
y
+
numbers
[
1
];
for
(
var
j
=
0
,
jl
=
numbers
.
length
;
j
<
jl
;
j
+=
2
)
{
var
rx
=
getReflection
(
point
.
x
,
control
.
x
);
var
ry
=
getReflection
(
point
.
y
,
control
.
y
);
path
.
quadraticCurveTo
(
rx
,
ry
,
point
.
x
+
numbers
[
j
+
0
],
point
.
y
+
numbers
[
j
+
1
]
);
control
.
x
=
rx
;
control
.
y
=
ry
;
point
.
x
=
point
.
x
+
numbers
[
j
+
0
];
point
.
y
=
point
.
y
+
numbers
[
j
+
1
];
}
break
;
case
'
a
'
:
...
...
@@ -361,6 +373,22 @@ THREE.SVGLoader.prototype = {
case
'
Z
'
:
case
'
z
'
:
path
.
currentPath
.
autoClose
=
true
;
// Reset point to beginning of Path
var
curve
=
path
.
currentPath
.
curves
[
0
];
if
(
curve
.
isLineCurve
)
{
point
.
x
=
curve
.
v1
.
x
;
point
.
y
=
curve
.
v1
.
y
;
}
else
if
(
curve
.
isEllipseCurve
||
curve
.
isArcCurve
)
{
point
.
x
=
curve
.
aX
;
point
.
y
=
curve
.
aY
;
}
else
if
(
curve
.
isCubicBezierCurve
||
curve
.
isQuadraticBezierCurve
)
{
point
.
x
=
curve
.
v0
.
x
;
point
.
y
=
curve
.
v0
.
y
;
}
else
if
(
curve
.
isSplineCurve
)
{
point
.
x
=
curve
.
points
[
0
].
x
;
point
.
y
=
curve
.
points
[
0
].
y
;
}
path
.
currentPath
.
currentPoint
.
copy
(
point
);
break
;
default
:
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录