forked from acaudwell/Core
-
Notifications
You must be signed in to change notification settings - Fork 0
/
frustum.cpp
157 lines (112 loc) · 5.15 KB
/
frustum.cpp
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
/*
Copyright (c) 2009 Andrew Caudwell (acaudwell@gmail.com)
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.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
#include "frustum.h"
// Lighthouse 3D Frustum tutorial:
// http://www.lighthouse3d.com/opengl/viewfrustum/index.php?gasource
Frustum::Frustum() {
}
Frustum::Frustum(Camera& camera) {
update(camera);
}
void Frustum::update(Camera& camera) {
updatePerspective(camera);
updateView(camera);
}
void Frustum::updatePerspective(Camera& camera) {
view_ratio = (float) display.width / (float) display.height;
fov = camera.getFov();
near_distance = camera.getZNear();
far_distance = camera.getZFar();
float toa = (float) tan(fov * 0.5 * DEGREES_TO_RADIANS);
near_half_height = near_distance * toa;
near_half_width = near_half_height * view_ratio;
far_half_height = far_distance * toa;
far_half_width = far_half_height * view_ratio;
}
void Frustum::updateView(Camera& camera) {
vec3f source = camera.getPos();
vec3f target = camera.getTarget();
vec3f up = camera.getUp();
vec3f view_ray = target - source;
view_ray.normalize();
vec3f horiz_normal = view_ray.cross(up);
horiz_normal.normalize();
vec3f vert_normal = horiz_normal.cross(view_ray);
//calculate the positions of the 8 points that make up
//the viewing frustum and then use them to create the 6 planes
vec3f near_centre = source + view_ray * near_distance;
vec3f far_centre = source + view_ray * far_distance;
vec3f near_horiz_offset = horiz_normal * near_half_width;
vec3f near_vert_offset = vert_normal * near_half_height;
near_top_left = near_centre + near_vert_offset - near_horiz_offset;
near_top_right = near_centre + near_vert_offset + near_horiz_offset;
near_bottom_left = near_centre - near_vert_offset - near_horiz_offset;
near_bottom_right = near_centre - near_vert_offset + near_horiz_offset;
vec3f far_horiz_offset = horiz_normal * far_half_width;
vec3f far_vert_offset = vert_normal * far_half_height;
far_top_left = far_centre + far_vert_offset - far_horiz_offset;
far_top_right = far_centre + far_vert_offset + far_horiz_offset;
far_bottom_left = far_centre - far_vert_offset - far_horiz_offset;
far_bottom_right = far_centre - far_vert_offset + far_horiz_offset;
//top
planes[0] = Plane(near_top_right, near_top_left, far_top_left);
//bottom
planes[1] = Plane(near_bottom_left, near_bottom_right, far_bottom_right);
//left
planes[2] = Plane(near_top_left, near_bottom_left, far_bottom_left);
//right
planes[3] = Plane(near_bottom_right, near_top_right, far_bottom_right);
//near
planes[4] = Plane(near_top_left, near_top_right, near_bottom_right);
//far
planes[5] = Plane(far_top_right, far_top_left, far_bottom_left);
}
bool Frustum::contains(const vec3f& p) const {
for(int i=0; i < 6; i++) {
float dist = planes[i].distance(p);
if(dist < 0) return false;
}
return true;
}
bool Frustum::intersects(const Bounds3D& bounds) const {
vec3f corner;
for(int i=0; i<6; i++) {
corner.x = planes[i].normal.x > 0.0 ? bounds.max.x : bounds.min.x;
corner.y = planes[i].normal.y > 0.0 ? bounds.max.y : bounds.min.y;
corner.z = planes[i].normal.z > 0.0 ? bounds.max.z : bounds.min.z;
if (planes[i].distance(corner) < 0.0) return false;
}
return true;
}
bool Frustum::intersects(const Bounds2D& bounds, float z) const {
vec3f corner;
for(int i=0; i<6; i++) {
corner.x = planes[i].normal.x > 0.0 ? bounds.max.x : bounds.min.x;
corner.y = planes[i].normal.y > 0.0 ? bounds.max.y : bounds.min.y;
corner.z = z;
if (planes[i].distance(corner) < 0.0) return false;
}
return true;
}