forked from 0000duck/VectorMath
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Frustum.cs
212 lines (183 loc) · 6.28 KB
/
Frustum.cs
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
/*
Copyright (c) 2014, Lars Brubaker
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.
The views and conclusions contained in the software and documentation are those
of the authors and should not be interpreted as representing official policies,
either expressed or implied, of the FreeBSD Project.
*/
using MatterHackers.VectorMath;
using System;
namespace MatterHackers.VectorMath
{
public enum FrustumIntersection { Inside, Outside, Intersect };
public class Frustum
{
// Plane normals should point out
public Plane[] Planes { get; set; } = new Plane[6];
public Plane Left
{
get { return Planes[0]; }
set { Planes[0] = value; }
}
public Frustum()
{
Planes = new Plane[6];
}
public static Frustum FrustumFromProjectionMatrix(Matrix4X4 projectionMatrix)
{
Frustum createdFrustum = new Frustum();
// left
for (int i = 4; i-- > 0;) createdFrustum.Planes[0][i] = projectionMatrix[i, 3] + projectionMatrix[i, 0];
// right
for (int i = 4; i-- > 0;) createdFrustum.Planes[1][i] = projectionMatrix[i,3] - projectionMatrix[i,0];
// bottom
for (int i = 4; i-- > 0;) createdFrustum.Planes[2][i] = projectionMatrix[i, 3] + projectionMatrix[i, 1];
// top
for (int i = 4; i-- > 0;) createdFrustum.Planes[3][i] = projectionMatrix[i, 3] - projectionMatrix[i, 1];
// front
for (int i = 4; i-- > 0;) createdFrustum.Planes[4][i] = projectionMatrix[i, 3] + projectionMatrix[i, 2];
// back
for (int i = 4; i-- > 0;) createdFrustum.Planes[5][i] = projectionMatrix[i, 3] - projectionMatrix[i, 2];
for(int i=0; i<6; i++)
{
createdFrustum.Planes[i].Normalize();
createdFrustum.Planes[i].DistanceToPlaneFromOrigin = -createdFrustum.Planes[i].DistanceToPlaneFromOrigin;
}
return createdFrustum;
}
/// <summary>
/// Modify the start and end points so they fall within the view frustum.
/// </summary>
/// <param name="startPoint"></param>
/// <param name="endPoint"></param>
/// <returns>Returns true if any part of the line is in the frustum else false.</returns>
public bool ClipLine(ref Vector3 startPoint, ref Vector3 endPoint)
{
foreach(Plane plane in Planes)
{
if(!plane.ClipLine(ref startPoint, ref endPoint))
{
// It is entirely behind the plane so
return false;
}
}
// It has been clipped to all planes and there is still some left.
return true;
}
// The front plan is at 0 (the intersection of the 4 side planes). Plane normals should point out.
public Frustum(Vector3 leftNormal, Vector3 rightNormal,
Vector3 bottomNormal, Vector3 topNormal,
Vector3 backNormal, double distanceToBack)
{
Planes = new Plane[5];
Planes[0] = new Plane(leftNormal.GetNormal(), 0);
Planes[1] = new Plane(rightNormal.GetNormal(), 0);
Planes[2] = new Plane(bottomNormal.GetNormal(), 0);
Planes[3] = new Plane(topNormal.GetNormal(), 0);
Planes[4] = new Plane(backNormal.GetNormal(), distanceToBack);
}
// Plane normals should point out.
public Frustum(Plane left, Plane right, Plane bottom, Plane top, Plane front, Plane back)
{
Planes = new Plane[6];
Planes[0] = left;
Planes[1] = right;
Planes[2] = bottom;
Planes[3] = top;
Planes[4] = front;
Planes[5] = back;
}
static public Frustum Transform(Frustum frustum, Matrix4X4 matrix)
{
Frustum transformedFrustum = new Frustum();
transformedFrustum.Planes = new Plane[frustum.Planes.Length];
for (int i = 0; i < frustum.Planes.Length; ++i)
{
transformedFrustum.Planes[i] = Plane.Transform(frustum.Planes[i], matrix);
}
return transformedFrustum;
}
public Frustum(Plane[] sixPlanes)
{
Planes = new Plane[6];
if (sixPlanes.Length != 6)
{
throw new Exception("Must create with six planes");
}
for (int i = 0; i < 6; i++)
{
Planes[i] = sixPlanes[i];
}
}
public FrustumIntersection GetIntersect(AxisAlignedBoundingBox boundingBox)
{
FrustumIntersection returnValue = FrustumIntersection.Inside;
Vector3 vmin, vmax;
for (int i = 0; i < Planes.Length; ++i)
{
// X axis
if (Planes[i].PlaneNormal.X > 0)
{
vmin.X = boundingBox.minXYZ.X;
vmax.X = boundingBox.maxXYZ.X;
}
else
{
vmin.X = boundingBox.maxXYZ.X;
vmax.X = boundingBox.minXYZ.X;
}
// Y axis
if (Planes[i].PlaneNormal.Y > 0)
{
vmin.Y = boundingBox.minXYZ.Y;
vmax.Y = boundingBox.maxXYZ.Y;
}
else
{
vmin.Y = boundingBox.maxXYZ.Y;
vmax.Y = boundingBox.minXYZ.Y;
}
// Z axis
if (Planes[i].PlaneNormal.Z > 0)
{
vmin.Z = boundingBox.minXYZ.Z;
vmax.Z = boundingBox.maxXYZ.Z;
}
else
{
vmin.Z = boundingBox.maxXYZ.Z;
vmax.Z = boundingBox.minXYZ.Z;
}
if (Vector3.Dot(Planes[i].PlaneNormal, vmin) - Planes[i].DistanceToPlaneFromOrigin > 0)
{
if (Vector3.Dot(Planes[i].PlaneNormal, vmax) - Planes[i].DistanceToPlaneFromOrigin >= 0)
{
return FrustumIntersection.Outside;
}
}
if (Vector3.Dot(Planes[i].PlaneNormal, vmax) - Planes[i].DistanceToPlaneFromOrigin >= 0)
{
returnValue = FrustumIntersection.Intersect;
}
}
return returnValue;
}
}
}