30 return float4(normal_to_plane, -
dot(normal_to_plane, p));
53 for (
int i = 0; i < 5; i++) {
54 data.corners[i] = shape.
corners[i];
75 data.planes[3] =
float4(-data.planes[0].xyz, -
dot(-data.planes[0].xyz, shape.
corners[6]));
76 data.planes[4] =
float4(-data.planes[1].xyz, -
dot(-data.planes[1].xyz, shape.
corners[6]));
77 data.planes[5] =
float4(-data.planes[2].xyz, -
dot(-data.planes[2].xyz, shape.
corners[6]));
78 for (
int i = 0; i < 8; i++) {
79 data.corners[i] = shape.
corners[i];
88 data.corners[0] = origin;
89 data.corners[1] = origin + side_x;
90 data.corners[2] = origin + side_y + side_x;
91 data.corners[3] = origin + side_y;
92 data.corners[4] = data.corners[0] + side_z;
93 data.corners[5] = data.corners[1] + side_z;
94 data.corners[6] = data.corners[2] + side_z;
95 data.corners[7] = data.corners[3] + side_z;
101 data.planes[3] =
float4(-data.planes[0].xyz, -
dot(-data.planes[0].xyz, data.corners[6]));
102 data.planes[4] =
float4(-data.planes[1].xyz, -
dot(-data.planes[1].xyz, data.corners[6]));
103 data.planes[5] =
float4(-data.planes[2].xyz, -
dot(-data.planes[2].xyz, data.corners[6]));
129 for (
int i = 0; i < 8; i++) {
130 data.corners[i] = shape.
corners[i];
153 bool intersects =
true;
161 for (
int p = 0; p < 6; ++p) {
162 bool is_any_vertex_on_positive_side =
false;
163 for (
int v = 0; v < 5; ++v) {
166 is_any_vertex_on_positive_side =
true;
170 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
171 if (all_vertex_on_negative_side) {
183 for (
int p = 0; p < 5; ++p) {
184 bool is_any_vertex_on_positive_side =
false;
185 for (
int v = 0; v < 8; ++v) {
189 is_any_vertex_on_positive_side =
true;
193 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
194 if (all_vertex_on_negative_side) {
204 bool intersects =
true;
212 for (
int p = 0; p < 6; ++p) {
213 bool is_any_vertex_on_positive_side =
false;
214 for (
int v = 0; v < 8; ++v) {
217 is_any_vertex_on_positive_side =
true;
221 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
222 if (all_vertex_on_negative_side) {
234 for (
int p = 0; p < 6; ++p) {
235 bool is_any_vertex_on_positive_side =
false;
236 for (
int v = 0; v < 8; ++v) {
239 is_any_vertex_on_positive_side =
true;
243 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
244 if (all_vertex_on_negative_side) {
255 bool intersects =
true;
263 for (
int p = 0; p < 6; ++p) {
264 bool is_any_vertex_on_positive_side =
false;
265 for (
int v = 0; v < 8; ++v) {
268 is_any_vertex_on_positive_side =
true;
272 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
273 if (all_vertex_on_negative_side) {
283 for (
int p = 0; p < 6; ++p) {
284 bool is_any_vertex_on_positive_side =
false;
285 for (
int v = 0; v < 8; ++v) {
288 is_any_vertex_on_positive_side =
true;
292 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
293 if (all_vertex_on_negative_side) {
304 bool intersects =
true;
311 for (
int p = 0; p < 6 && intersects; ++p) {
313 if (dist_to_plane < -sphere.
radius) {
332 bool intersects =
true;
335 for (
int p = 0; p < 5; ++p) {
336 bool is_any_vertex_on_positive_side =
false;
337 for (
int v = 0; v < 8; ++v) {
340 is_any_vertex_on_positive_side =
true;
344 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
345 if (all_vertex_on_negative_side) {
357 for (
int p = 0; p < 6; ++p) {
358 bool is_any_vertex_on_positive_side =
false;
359 for (
int v = 0; v < 5; ++v) {
362 is_any_vertex_on_positive_side =
true;
366 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
367 if (all_vertex_on_negative_side) {
377 bool intersects =
true;
380 for (
int p = 0; p < 5; ++p) {
381 bool is_any_vertex_on_positive_side =
false;
382 for (
int v = 0; v < 8; ++v) {
385 is_any_vertex_on_positive_side =
true;
389 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
390 if (all_vertex_on_negative_side) {
401 for (
int p = 0; p < 6; ++p) {
402 bool is_any_vertex_on_positive_side =
false;
403 for (
int v = 0; v < 5; ++v) {
406 is_any_vertex_on_positive_side =
true;
410 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
411 if (all_vertex_on_negative_side) {
421 bool intersects =
true;
424 for (
int p = 0; p < 6; ++p) {
425 bool is_any_vertex_on_positive_side =
false;
426 for (
int v = 0; v < 5; ++v) {
429 is_any_vertex_on_positive_side =
true;
433 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
434 if (all_vertex_on_negative_side) {
446 for (
int p = 0; p < 5; ++p) {
447 bool is_any_vertex_on_positive_side =
false;
448 for (
int v = 0; v < 8; ++v) {
451 is_any_vertex_on_positive_side =
true;
455 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
456 if (all_vertex_on_negative_side) {
466 bool intersects =
true;
469 for (
int p = 0; p < 6; ++p) {
470 bool is_any_vertex_on_positive_side =
false;
471 for (
int v = 0; v < 8; ++v) {
474 is_any_vertex_on_positive_side =
true;
478 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
479 if (all_vertex_on_negative_side) {
491 for (
int p = 0; p < 6; ++p) {
492 bool is_any_vertex_on_positive_side =
false;
493 for (
int v = 0; v < 8; ++v) {
496 is_any_vertex_on_positive_side =
true;
500 bool all_vertex_on_negative_side = !is_any_vertex_on_positive_side;
501 if (all_vertex_on_negative_side) {
512 bool intersects =
true;
513 for (
int p = 0; p < 6; ++p) {
515 if (dist_to_plane < -sphere.
radius) {
531 float sphere_distance_rcp =
safe_rcp(sphere_distance);
533 float sphere_cos =
sqrt(1.0f - sphere_sin * sphere_sin);
536 float cone_sphere_center_cos =
dot(sphere.
center * sphere_distance_rcp, cone.
direction);
538 float cone_sphere_angle_sum_cos = (sphere.
radius > sphere_distance) ?
541 cone_aperture_sin * sphere_sin);
544 bool intersects = (cone_sphere_center_cos >= cone_sphere_angle_sum_cos);
#define DRW_VIEW_CULLING_UBO_SLOT
float4 isect_plane_setup(float3 p, float3 v1, float3 v2)
IsectBox isect_box_setup(Box shape)
IsectPyramid isect_pyramid_setup(Pyramid shape)
IsectFrustum isect_frustum_setup(Frustum shape)
bool intersect(IsectPyramid i_pyramid, Box box)
VecBase< float, D > normalize(VecOp< float, D >) RET
float dot(VecOp< float, D >, VecOp< float, D >) RET
VecBase< float, 3 > cross(VecOp< float, 3 >, VecOp< float, 3 >) RET
float length(VecOp< float, D >) RET
float distance_squared(VecT a, VecT b)
VecBase< float, 4 > float4
VecBase< float, 3 > float3
struct FrustumPlanes frustum_planes
struct FrustumCorners frustum_corners
const ViewCullingData(& drw_view_culling_buf)[64]
bool intersect_view(Box box, uint view_id) const
ViewCullingData get(uint view_id) const
bool intersect_view(IsectBox i_box, uint view_id) const
bool intersect_view(Sphere sphere, uint view_id) const
bool intersect_view(Pyramid pyramid, uint view_id) const