Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Ablesons
three.js
提交
817c2dd5
T
three.js
项目概览
Ablesons
/
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,发现更多精彩内容 >>
提交
817c2dd5
编写于
7月 16, 2011
作者:
Z
zz85
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Got rid of Spline2
上级
ae71419f
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
2 addition
and
48 deletion
+2
-48
src/extras/geometries/ExtrudeGeometry.js
src/extras/geometries/ExtrudeGeometry.js
+1
-1
src/extras/geometries/Path.js
src/extras/geometries/Path.js
+1
-47
未找到文件。
src/extras/geometries/ExtrudeGeometry.js
浏览文件 @
817c2dd5
...
...
@@ -30,7 +30,7 @@ THREE.ExtrudeGeometry = function( shape, options ) {
THREE
.
Geometry
.
call
(
this
);
var
vertices
=
shape
.
get
SpacedPoints
();
var
vertices
=
shape
.
get
Points
();
// getSpacedPoints() you can get variable divisions by dividing by total lenght
var
reverse
=
THREE
.
FontUtils
.
Triangulate
.
area
(
vertices
)
>
0
;
if
(
reverse
)
{
//faces = THREE.FontUtils.Triangulate( vertices.reverse(), true );
...
...
src/extras/geometries/Path.js
浏览文件 @
817c2dd5
...
...
@@ -266,10 +266,7 @@ THREE.Path.prototype.getPoints = function( divisions ) {
var
n
=
divisions
*
args
[
0
].
length
;
spts
=
spts
.
concat
(
args
[
0
]);
console
.
log
(
args
[
0
].
length
,
spts
.
length
,
args
[
0
],
spts
);
//var spline = new Spline2();
var
spline
=
new
THREE
.
SplineCurve
(
spts
);
for
(
j
=
1
;
j
<=
n
;
j
++
)
{
...
...
@@ -309,49 +306,6 @@ THREE.Path.prototype.getPoints = function( divisions ) {
};
var
Spline2
=
function
()
{
var
c
=
[],
v2
,
point
,
intPoint
,
weight
;
this
.
get2DPoint
=
function
(
points
,
k
)
{
v2
=
new
THREE
.
Vector2
();
point
=
(
points
.
length
-
1
)
*
k
;
intPoint
=
Math
.
floor
(
point
);
weight
=
point
-
intPoint
;
c
[
0
]
=
intPoint
==
0
?
intPoint
:
intPoint
-
1
;
c
[
1
]
=
intPoint
;
c
[
2
]
=
intPoint
>
points
.
length
-
2
?
intPoint
:
intPoint
+
1
;
c
[
3
]
=
intPoint
>
points
.
length
-
3
?
intPoint
:
intPoint
+
2
;
v2
.
x
=
interpolate
(
points
[
c
[
0
]
].
x
,
points
[
c
[
1
]
].
x
,
points
[
c
[
2
]
].
x
,
points
[
c
[
3
]
].
x
,
weight
);
v2
.
y
=
interpolate
(
points
[
c
[
0
]
].
y
,
points
[
c
[
1
]
].
y
,
points
[
c
[
2
]
].
y
,
points
[
c
[
3
]
].
y
,
weight
);
//console.log('point',point, v2);
return
v2
;
}
// Catmull-Rom
function
interpolate
(
p0
,
p1
,
p2
,
p3
,
t
)
{
var
v0
=
(
p2
-
p0
)
*
0.5
;
var
v1
=
(
p3
-
p1
)
*
0.5
;
var
t2
=
t
*
t
;
var
t3
=
t
*
t2
;
return
(
2
*
p1
-
2
*
p2
+
v0
+
v1
)
*
t3
+
(
-
3
*
p1
+
3
*
p2
-
2
*
v0
-
v1
)
*
t2
+
v0
*
t
+
p1
;
}
};
THREE
.
Path
.
prototype
.
getMinAndMax
=
function
()
{
var
points
=
this
.
getPoints
();
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录