Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Ablesons
three.js
提交
19412735
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,发现更多精彩内容 >>
提交
19412735
编写于
12月 18, 2014
作者:
M
Mr.doob
浏览文件
操作
浏览文件
下载
差异文件
Merge branch 'dev-ray' of
https://github.com/WestLangley/three.js
into dev
Conflicts: src/math/Ray.js
上级
077dc92b
616952a3
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
81 addition
and
71 deletion
+81
-71
src/math/Ray.js
src/math/Ray.js
+81
-71
未找到文件。
src/math/Ray.js
浏览文件 @
19412735
...
...
@@ -93,53 +93,70 @@ THREE.Ray.prototype = {
}(),
distanceSqToSegment
:
function
(
v0
,
v1
,
optionalPointOnRay
,
optionalPointOnSegment
)
{
distanceSqToSegment
:
function
()
{
// from http://www.geometrictools.com/LibMathematics/Distance/Wm5DistRay3Segment3.cpp
// It returns the min distance between the ray and the segment
// defined by v0 and v1
// It can also set two optional targets :
// - The closest point on the ray
// - The closest point on the segment
var
segCenter
=
new
THREE
.
Vector3
();
var
segDir
=
new
THREE
.
Vector3
();
var
diff
=
new
THREE
.
Vector3
();
return
function
(
v0
,
v1
,
optionalPointOnRay
,
optionalPointOnSegment
)
{
// from http://www.geometrictools.com/LibMathematics/Distance/Wm5DistRay3Segment3.cpp
// It returns the min distance between the ray and the segment
// defined by v0 and v1
// It can also set two optional targets :
// - The closest point on the ray
// - The closest point on the segment
segCenter
.
copy
(
v0
).
add
(
v1
).
multiplyScalar
(
0.5
);
segDir
.
copy
(
v1
).
sub
(
v0
).
normalize
();
diff
.
copy
(
this
.
origin
).
sub
(
segCenter
);
var
segExtent
=
v0
.
distanceTo
(
v1
)
*
0.5
;
var
a01
=
-
this
.
direction
.
dot
(
segDir
);
var
b0
=
diff
.
dot
(
this
.
direction
);
var
b1
=
-
diff
.
dot
(
segDir
);
var
c
=
diff
.
lengthSq
();
var
det
=
Math
.
abs
(
1
-
a01
*
a01
);
var
s0
,
s1
,
sqrDist
,
extDet
;
if
(
det
>
0
)
{
// The ray and segment are not parallel.
s0
=
a01
*
b1
-
b0
;
s1
=
a01
*
b0
-
b1
;
extDet
=
segExtent
*
det
;
var
segCenter
=
v0
.
clone
().
add
(
v1
).
multiplyScalar
(
0.5
);
var
segDir
=
v1
.
clone
().
sub
(
v0
).
normalize
();
var
segExtent
=
v0
.
distanceTo
(
v1
)
*
0.5
;
var
diff
=
this
.
origin
.
clone
().
sub
(
segCenter
);
var
a01
=
-
this
.
direction
.
dot
(
segDir
);
var
b0
=
diff
.
dot
(
this
.
direction
);
var
b1
=
-
diff
.
dot
(
segDir
);
var
c
=
diff
.
lengthSq
();
var
det
=
Math
.
abs
(
1
-
a01
*
a01
);
var
s0
,
s1
,
sqrDist
,
extDet
;
if
(
s0
>=
0
)
{
if
(
det
>
0
)
{
if
(
s1
>=
-
extDet
)
{
// The ray and segment are not parallel.
if
(
s1
<=
extDet
)
{
s0
=
a01
*
b1
-
b0
;
s1
=
a01
*
b0
-
b1
;
extDet
=
segExtent
*
det
;
// region 0
// Minimum at interior points of ray and segment.
if
(
s0
>=
0
)
{
var
invDet
=
1
/
det
;
s0
*=
invDet
;
s1
*=
invDet
;
sqrDist
=
s0
*
(
s0
+
a01
*
s1
+
2
*
b0
)
+
s1
*
(
a01
*
s0
+
s1
+
2
*
b1
)
+
c
;
if
(
s1
>=
-
extDet
)
{
}
else
{
if
(
s1
<=
extDet
)
{
// region 1
// region 0
// Minimum at interior points of ray and segment.
s1
=
segExtent
;
s0
=
Math
.
max
(
0
,
-
(
a01
*
s1
+
b0
)
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
var
invDet
=
1
/
det
;
s0
*=
invDet
;
s1
*=
invDet
;
sqrDist
=
s0
*
(
s0
+
a01
*
s1
+
2
*
b0
)
+
s1
*
(
a01
*
s0
+
s1
+
2
*
b1
)
+
c
;
}
}
else
{
// region
1
// region
5
s1
=
segExtent
;
s1
=
-
segExtent
;
s0
=
Math
.
max
(
0
,
-
(
a01
*
s1
+
b0
)
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
...
...
@@ -147,69 +164,62 @@ THREE.Ray.prototype = {
}
else
{
// region 5
if
(
s1
<=
-
extDet
)
{
s1
=
-
segExtent
;
s0
=
Math
.
max
(
0
,
-
(
a01
*
s1
+
b0
)
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
// region 4
}
s0
=
Math
.
max
(
0
,
-
(
-
a01
*
segExtent
+
b0
)
);
s1
=
(
s0
>
0
)
?
-
segExtent
:
Math
.
min
(
Math
.
max
(
-
segExtent
,
-
b1
),
segExtent
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
}
else
{
}
else
if
(
s1
<=
extDet
)
{
if
(
s1
<=
-
extDet
)
{
// region 3
// region 4
s0
=
0
;
s1
=
Math
.
min
(
Math
.
max
(
-
segExtent
,
-
b1
),
segExtent
);
sqrDist
=
s1
*
(
s1
+
2
*
b1
)
+
c
;
s0
=
Math
.
max
(
0
,
-
(
-
a01
*
segExtent
+
b0
)
);
s1
=
(
s0
>
0
)
?
-
segExtent
:
Math
.
min
(
Math
.
max
(
-
segExtent
,
-
b1
),
segExtent
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
}
else
{
}
else
if
(
s1
<=
extDet
)
{
// region 2
// region 3
s0
=
Math
.
max
(
0
,
-
(
a01
*
segExtent
+
b0
)
);
s1
=
(
s0
>
0
)
?
segExtent
:
Math
.
min
(
Math
.
max
(
-
segExtent
,
-
b1
),
segExtent
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
s0
=
0
;
s1
=
Math
.
min
(
Math
.
max
(
-
segExtent
,
-
b1
),
segExtent
);
sqrDist
=
s1
*
(
s1
+
2
*
b1
)
+
c
;
}
}
else
{
}
// region 2
}
else
{
s0
=
Math
.
max
(
0
,
-
(
a01
*
segExtent
+
b0
)
);
s1
=
(
s0
>
0
)
?
segExtent
:
Math
.
min
(
Math
.
max
(
-
segExtent
,
-
b1
),
segExtent
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
// Ray and segment are parallel.
}
s1
=
(
a01
>
0
)
?
-
segExtent
:
segExtent
;
s0
=
Math
.
max
(
0
,
-
(
a01
*
s1
+
b0
)
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
}
}
else
{
if
(
optionalPointOnRay
)
{
// Ray and segment are parallel.
s1
=
(
a01
>
0
)
?
-
segExtent
:
segExtent
;
s0
=
Math
.
max
(
0
,
-
(
a01
*
s1
+
b0
)
);
sqrDist
=
-
s0
*
s0
+
s1
*
(
s1
+
2
*
b1
)
+
c
;
}
optionalPointOnRay
.
copy
(
this
.
direction
).
multiplyScalar
(
s0
).
add
(
this
.
origin
);
if
(
optionalPointOnRay
)
{
}
optionalPointOnRay
.
copy
(
this
.
direction
.
clone
().
multiplyScalar
(
s0
).
add
(
this
.
origin
)
);
if
(
optionalPointOnSegment
)
{
}
optionalPointOnSegment
.
copy
(
segDir
).
multiplyScalar
(
s1
).
add
(
segCenter
);
if
(
optionalPointOnSegment
)
{
}
optionalPointOnSegment
.
copy
(
segDir
.
clone
().
multiplyScalar
(
s1
).
add
(
segCenter
)
)
;
return
sqrDist
;
}
}
;
return
sqrDist
;
}(),
},
isIntersectionSphere
:
function
(
sphere
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录