bgfx/examples/common/bounds.cpp

1171 lines
25 KiB
C++
Raw Normal View History

2013-02-22 09:07:31 +04:00
/*
2019-01-14 04:13:25 +03:00
* Copyright 2011-2019 Branimir Karadzic. All rights reserved.
2016-01-01 11:11:04 +03:00
* License: https://github.com/bkaradzic/bgfx#license-bsd-2-clause
2013-02-22 09:07:31 +04:00
*/
#include <bx/rng.h>
2017-07-16 07:01:08 +03:00
#include <bx/math.h>
2013-02-22 09:07:31 +04:00
#include "bounds.h"
2019-02-04 06:47:33 +03:00
using namespace bx;
2019-02-04 09:07:51 +03:00
Vec3 getCenter(const Aabb& _aabb)
2019-02-04 06:47:33 +03:00
{
2019-02-04 09:07:51 +03:00
return mul(add(_aabb.min, _aabb.max), 0.5f);
2019-02-04 06:47:33 +03:00
}
2019-02-04 09:07:51 +03:00
Vec3 getExtents(const Aabb& _aabb)
2019-02-04 06:47:33 +03:00
{
2019-02-04 09:07:51 +03:00
return mul(sub(_aabb.max, _aabb.min), 0.5f);
}
Vec3 getCenter(const Triangle& _triangle)
{
2019-02-04 10:19:04 +03:00
return mul(add(add(_triangle.v0, _triangle.v1), _triangle.v2), 1.0f/3.0f);
2019-02-04 06:47:33 +03:00
}
void toAabb(Aabb& _outAabb, const Vec3& _center, const Vec3& _extent)
2013-02-22 09:07:31 +04:00
{
2019-02-04 06:47:33 +03:00
_outAabb.min = sub(_center, _extent);
_outAabb.max = add(_center, _extent);
2013-02-22 09:07:31 +04:00
}
2019-02-04 06:47:33 +03:00
void toAabb(Aabb& _outAabb, const Obb& _obb)
{
2019-02-04 06:47:33 +03:00
Vec3 xyz = { 1.0f, 1.0f, 1.0f };
Vec3 tmp = mul(xyz, _obb.mtx);
2019-02-04 06:47:33 +03:00
_outAabb.min = tmp;
_outAabb.max = tmp;
for (uint32_t ii = 1; ii < 8; ++ii)
{
2018-11-14 09:38:41 +03:00
xyz.x = ii & 1 ? -1.0f : 1.0f;
xyz.y = ii & 2 ? -1.0f : 1.0f;
xyz.z = ii & 4 ? -1.0f : 1.0f;
2019-02-04 06:47:33 +03:00
tmp = mul(xyz, _obb.mtx);
2019-02-04 06:47:33 +03:00
_outAabb.min = min(_outAabb.min, tmp);
_outAabb.max = max(_outAabb.max, tmp);
}
}
2019-02-04 06:47:33 +03:00
void toAabb(Aabb& _outAabb, const Sphere& _sphere)
2014-05-20 09:08:35 +04:00
{
2019-02-04 06:47:33 +03:00
const float radius = _sphere.radius;
_outAabb.min = sub(_sphere.center, radius);
_outAabb.max = add(_sphere.center, radius);
2014-05-20 09:08:35 +04:00
}
2019-02-04 06:47:33 +03:00
void toAabb(Aabb& _outAabb, const Disk& _disk)
{
2018-11-26 07:11:03 +03:00
// Reference(s):
// - https://web.archive.org/web/20181113055756/http://iquilezles.org/www/articles/diskbbox/diskbbox.htm
//
2019-02-04 06:47:33 +03:00
const Vec3 nsq = mul(_disk.normal, _disk.normal);
const Vec3 one = { 1.0f, 1.0f, 1.0f };
const Vec3 tmp = sub(one, nsq);
2018-11-14 09:38:41 +03:00
const float inv = 1.0f / (tmp.x*tmp.y*tmp.z);
2019-02-04 06:47:33 +03:00
const Vec3 extent =
2018-11-14 09:38:41 +03:00
{
2019-02-04 06:47:33 +03:00
_disk.radius * tmp.x * sqrt( (nsq.x + nsq.y * nsq.z) * inv),
_disk.radius * tmp.y * sqrt( (nsq.y + nsq.z * nsq.x) * inv),
_disk.radius * tmp.z * sqrt( (nsq.z + nsq.x * nsq.y) * inv),
2018-11-14 09:38:41 +03:00
};
2019-02-04 06:47:33 +03:00
_outAabb.min = sub(_disk.center, extent);
_outAabb.max = add(_disk.center, extent);
}
2019-02-04 06:47:33 +03:00
void toAabb(Aabb& _outAabb, const Cylinder& _cylinder)
{
2018-11-26 07:11:03 +03:00
// Reference(s):
// - https://web.archive.org/web/20181113055756/http://iquilezles.org/www/articles/diskbbox/diskbbox.htm
//
2019-02-04 06:47:33 +03:00
const Vec3 axis = sub(_cylinder.end, _cylinder.pos);
const Vec3 asq = mul(axis, axis);
const Vec3 nsq = mul(asq, 1.0f/dot(axis, axis) );
const Vec3 one = { 1.0f, 1.0f, 1.0f };
const Vec3 tmp = sub(one, nsq);
2018-11-14 09:38:41 +03:00
const float inv = 1.0f / (tmp.x*tmp.y*tmp.z);
2019-02-04 06:47:33 +03:00
const Vec3 extent =
2018-11-14 09:38:41 +03:00
{
2019-02-04 06:47:33 +03:00
_cylinder.radius * tmp.x * sqrt( (nsq.x + nsq.y * nsq.z) * inv),
_cylinder.radius * tmp.y * sqrt( (nsq.y + nsq.z * nsq.x) * inv),
_cylinder.radius * tmp.z * sqrt( (nsq.z + nsq.x * nsq.y) * inv),
2018-11-14 09:38:41 +03:00
};
2019-02-04 06:47:33 +03:00
const Vec3 minP = sub(_cylinder.pos, extent);
const Vec3 minE = sub(_cylinder.end, extent);
const Vec3 maxP = add(_cylinder.pos, extent);
const Vec3 maxE = add(_cylinder.end, extent);
2018-11-14 09:38:41 +03:00
2019-02-04 06:47:33 +03:00
_outAabb.min = min(minP, minE);
_outAabb.max = max(maxP, maxE);
}
2013-02-22 09:07:31 +04:00
void aabbTransformToObb(Obb& _obb, const Aabb& _aabb, const float* _mtx)
{
2019-02-04 06:47:33 +03:00
toObb(_obb, _aabb);
2013-02-22 09:07:31 +04:00
float result[16];
2019-02-04 06:47:33 +03:00
mtxMul(result, _obb.mtx, _mtx);
memCopy(_obb.mtx, result, sizeof(result) );
2013-02-22 09:07:31 +04:00
}
2019-02-04 06:47:33 +03:00
void toAabb(Aabb& _outAabb, const void* _vertices, uint32_t _numVertices, uint32_t _stride)
2013-02-22 09:07:31 +04:00
{
2019-02-04 06:47:33 +03:00
Vec3 mn, mx;
2013-02-22 09:07:31 +04:00
uint8_t* vertex = (uint8_t*)_vertices;
2019-02-04 06:47:33 +03:00
mn = mx = load<Vec3>(vertex);
2013-02-22 09:07:31 +04:00
vertex += _stride;
for (uint32_t ii = 1; ii < _numVertices; ++ii)
{
2019-02-04 06:47:33 +03:00
const Vec3 pos = load<Vec3>(vertex);
2013-02-22 09:07:31 +04:00
vertex += _stride;
2019-02-04 06:47:33 +03:00
mn = min(pos, mn);
mx = max(pos, mx);
2018-11-14 09:38:41 +03:00
}
2019-02-04 06:47:33 +03:00
_outAabb.min = mn;
_outAabb.max = mx;
2013-02-22 09:07:31 +04:00
}
2019-02-04 06:47:33 +03:00
void toAabb(Aabb& _outAabb, const float* _mtx, const void* _vertices, uint32_t _numVertices, uint32_t _stride)
2013-02-22 09:07:31 +04:00
{
2019-02-04 06:47:33 +03:00
Vec3 mn, mx;
2013-02-22 09:07:31 +04:00
uint8_t* vertex = (uint8_t*)_vertices;
2019-02-04 06:47:33 +03:00
mn = mx = mul(load<Vec3>(vertex), _mtx);
2013-02-22 09:07:31 +04:00
vertex += _stride;
for (uint32_t ii = 1; ii < _numVertices; ++ii)
{
2019-02-04 06:47:33 +03:00
Vec3 pos = mul(load<Vec3>(vertex), _mtx);
2013-02-22 09:07:31 +04:00
vertex += _stride;
2019-02-04 06:47:33 +03:00
mn = min(pos, mn);
mx = max(pos, mx);
2018-11-14 09:38:41 +03:00
}
2019-02-04 06:47:33 +03:00
_outAabb.min = mn;
_outAabb.max = mx;
2013-02-22 09:07:31 +04:00
}
2016-12-06 06:01:11 +03:00
float calcAreaAabb(const Aabb& _aabb)
{
2019-02-04 06:47:33 +03:00
const float ww = _aabb.max.x - _aabb.min.x;
const float hh = _aabb.max.y - _aabb.min.y;
const float dd = _aabb.max.z - _aabb.min.z;
2016-12-06 06:01:11 +03:00
return 2.0f * (ww*hh + ww*dd + hh*dd);
}
2019-02-04 06:47:33 +03:00
void aabbExpand(Aabb& _outAabb, float _factor)
2014-05-27 03:55:46 +04:00
{
2019-02-04 06:47:33 +03:00
_outAabb.min.x -= _factor;
_outAabb.min.y -= _factor;
_outAabb.min.z -= _factor;
_outAabb.max.x += _factor;
_outAabb.max.y += _factor;
_outAabb.max.z += _factor;
2014-05-27 03:55:46 +04:00
}
2019-02-04 06:47:33 +03:00
void aabbExpand(Aabb& _outAabb, const Vec3& _pos)
{
2019-02-04 06:47:33 +03:00
_outAabb.min = min(_outAabb.min, _pos);
_outAabb.max = max(_outAabb.max, _pos);
}
2019-02-04 06:47:33 +03:00
void toObb(Obb& _outObb, const Aabb& _aabb)
2014-05-27 03:55:46 +04:00
{
2019-02-04 06:47:33 +03:00
memSet(_outObb.mtx, 0, sizeof(_outObb.mtx) );
_outObb.mtx[ 0] = (_aabb.max.x - _aabb.min.x) * 0.5f;
_outObb.mtx[ 5] = (_aabb.max.y - _aabb.min.y) * 0.5f;
_outObb.mtx[10] = (_aabb.max.z - _aabb.min.z) * 0.5f;
_outObb.mtx[12] = (_aabb.min.x + _aabb.max.x) * 0.5f;
_outObb.mtx[13] = (_aabb.min.y + _aabb.max.y) * 0.5f;
_outObb.mtx[14] = (_aabb.min.z + _aabb.max.z) * 0.5f;
_outObb.mtx[15] = 1.0f;
2014-05-27 03:55:46 +04:00
}
2019-02-04 06:47:33 +03:00
void calcObb(Obb& _outObb, const void* _vertices, uint32_t _numVertices, uint32_t _stride, uint32_t _steps)
2013-02-22 09:07:31 +04:00
{
Aabb aabb;
2016-12-06 06:01:11 +03:00
toAabb(aabb, _vertices, _numVertices, _stride);
2013-02-22 09:07:31 +04:00
float minArea = calcAreaAabb(aabb);
Obb best;
2019-02-04 06:47:33 +03:00
toObb(best, aabb);
2013-02-22 09:07:31 +04:00
2019-02-04 06:47:33 +03:00
float angleStep = float(kPiHalf/_steps);
2013-02-22 09:07:31 +04:00
float ax = 0.0f;
float mtx[16];
for (uint32_t ii = 0; ii < _steps; ++ii)
{
float ay = 0.0f;
for (uint32_t jj = 0; jj < _steps; ++jj)
{
float az = 0.0f;
for (uint32_t kk = 0; kk < _steps; ++kk)
{
2019-02-04 06:47:33 +03:00
mtxRotateXYZ(mtx, ax, ay, az);
2013-02-22 09:07:31 +04:00
float mtxT[16];
2019-02-04 06:47:33 +03:00
mtxTranspose(mtxT, mtx);
2016-12-06 06:01:11 +03:00
toAabb(aabb, mtxT, _vertices, _numVertices, _stride);
2013-02-22 09:07:31 +04:00
float area = calcAreaAabb(aabb);
if (area < minArea)
{
minArea = area;
aabbTransformToObb(best, aabb, mtx);
}
az += angleStep;
}
ay += angleStep;
}
ax += angleStep;
}
2019-02-04 06:47:33 +03:00
memCopy(&_outObb, &best, sizeof(Obb) );
2013-02-22 09:07:31 +04:00
}
void calcMaxBoundingSphere(Sphere& _sphere, const void* _vertices, uint32_t _numVertices, uint32_t _stride)
{
Aabb aabb;
2016-12-06 06:01:11 +03:00
toAabb(aabb, _vertices, _numVertices, _stride);
2013-02-22 09:07:31 +04:00
2019-02-04 06:47:33 +03:00
Vec3 center = getCenter(aabb);
2013-02-22 09:07:31 +04:00
float maxDistSq = 0.0f;
uint8_t* vertex = (uint8_t*)_vertices;
for (uint32_t ii = 0; ii < _numVertices; ++ii)
{
2019-02-04 06:47:33 +03:00
const Vec3& pos = load<Vec3>(vertex);
2013-02-22 09:07:31 +04:00
vertex += _stride;
2019-02-04 06:47:33 +03:00
const Vec3 tmp = sub(pos, center);
const float distSq = dot(tmp, tmp);
maxDistSq = max(distSq, maxDistSq);
2013-02-22 09:07:31 +04:00
}
2019-02-04 06:47:33 +03:00
_sphere.center = center;
_sphere.radius = sqrt(maxDistSq);
2013-02-22 09:07:31 +04:00
}
void calcMinBoundingSphere(Sphere& _sphere, const void* _vertices, uint32_t _numVertices, uint32_t _stride, float _step)
{
2019-02-04 06:47:33 +03:00
RngMwc rng;
2013-02-22 09:07:31 +04:00
uint8_t* vertex = (uint8_t*)_vertices;
2019-02-04 06:47:33 +03:00
Vec3 center;
2013-02-22 09:07:31 +04:00
float* position = (float*)&vertex[0];
2018-11-14 09:38:41 +03:00
center.x = position[0];
center.y = position[1];
center.z = position[2];
2013-02-22 09:07:31 +04:00
position = (float*)&vertex[1*_stride];
2018-11-14 09:38:41 +03:00
center.x += position[0];
center.y += position[1];
center.z += position[2];
2013-02-22 09:07:31 +04:00
2018-11-14 09:38:41 +03:00
center.x *= 0.5f;
center.y *= 0.5f;
center.z *= 0.5f;
2013-02-22 09:07:31 +04:00
2018-11-14 09:38:41 +03:00
float xx = position[0] - center.x;
float yy = position[1] - center.y;
float zz = position[2] - center.z;
2013-02-22 09:07:31 +04:00
float maxDistSq = xx*xx + yy*yy + zz*zz;
float radiusStep = _step * 0.37f;
bool done;
2015-11-28 10:45:42 +03:00
do
2013-02-22 09:07:31 +04:00
{
done = true;
for (uint32_t ii = 0, index = rng.gen()%_numVertices; ii < _numVertices; ++ii, index = (index + 1)%_numVertices)
{
position = (float*)&vertex[index*_stride];
2018-11-14 09:38:41 +03:00
xx = position[0] - center.x;
yy = position[1] - center.y;
zz = position[2] - center.z;
2013-02-22 09:07:31 +04:00
float distSq = xx*xx + yy*yy + zz*zz;
if (distSq > maxDistSq)
{
done = false;
2018-11-14 09:38:41 +03:00
center.x += xx * radiusStep;
center.y += yy * radiusStep;
center.z += zz * radiusStep;
2019-02-04 06:47:33 +03:00
maxDistSq = lerp(maxDistSq, distSq, _step);
2013-02-22 09:07:31 +04:00
break;
}
}
} while (!done);
2019-02-04 06:47:33 +03:00
_sphere.center = center;
_sphere.radius = sqrt(maxDistSq);
2015-11-28 10:45:42 +03:00
}
2019-02-04 06:47:33 +03:00
void buildFrustumPlanes(Plane* _result, const float* _viewProj)
{
const float xw = _viewProj[ 3];
const float yw = _viewProj[ 7];
const float zw = _viewProj[11];
const float ww = _viewProj[15];
const float xz = _viewProj[ 2];
const float yz = _viewProj[ 6];
const float zz = _viewProj[10];
const float wz = _viewProj[14];
2019-02-04 06:47:33 +03:00
Plane& near = _result[0];
Plane& far = _result[1];
Plane& left = _result[2];
Plane& right = _result[3];
Plane& top = _result[4];
Plane& bottom = _result[5];
2019-01-04 09:03:40 +03:00
near.normal.x = xw - xz;
near.normal.y = yw - yz;
near.normal.z = zw - zz;
near.dist = ww - wz;
2019-01-04 09:03:40 +03:00
far.normal.x = xw + xz;
far.normal.y = yw + yz;
far.normal.z = zw + zz;
far.dist = ww + wz;
const float xx = _viewProj[ 0];
const float yx = _viewProj[ 4];
const float zx = _viewProj[ 8];
const float wx = _viewProj[12];
2019-01-04 09:03:40 +03:00
left.normal.x = xw - xx;
left.normal.y = yw - yx;
left.normal.z = zw - zx;
left.dist = ww - wx;
2019-01-04 09:03:40 +03:00
right.normal.x = xw + xx;
right.normal.y = yw + yx;
right.normal.z = zw + zx;
right.dist = ww + wx;
const float xy = _viewProj[ 1];
const float yy = _viewProj[ 5];
const float zy = _viewProj[ 9];
const float wy = _viewProj[13];
2019-01-04 09:03:40 +03:00
top.normal.x = xw + xy;
top.normal.y = yw + yy;
top.normal.z = zw + zy;
top.dist = ww + wy;
2019-01-04 09:03:40 +03:00
bottom.normal.x = xw - xy;
bottom.normal.y = yw - yy;
bottom.normal.z = zw - zy;
bottom.dist = ww - wy;
2019-02-04 06:47:33 +03:00
Plane* plane = _result;
for (uint32_t ii = 0; ii < 6; ++ii)
{
2019-02-04 06:47:33 +03:00
const float len = length(plane->normal);
plane->normal = normalize(plane->normal);
2018-11-14 09:38:41 +03:00
float invLen = 1.0f / len;
2019-01-04 09:03:40 +03:00
plane->dist *= invLen;
++plane;
}
}
2019-02-04 06:47:33 +03:00
Vec3 intersectPlanes(const Plane& _pa, const Plane& _pb, const Plane& _pc)
{
2019-02-04 06:47:33 +03:00
const Vec3 axb = cross(_pa.normal, _pb.normal);
const Vec3 bxc = cross(_pb.normal, _pc.normal);
const Vec3 cxa = cross(_pc.normal, _pa.normal);
const Vec3 tmp0 = mul(bxc, _pa.dist);
const Vec3 tmp1 = mul(cxa, _pb.dist);
const Vec3 tmp2 = mul(axb, _pc.dist);
const Vec3 tmp3 = add(tmp0, tmp1);
const Vec3 tmp4 = add(tmp3, tmp2);
const float denom = dot(_pa.normal, bxc);
const Vec3 result = mul(tmp4, -1.0f/denom);
2018-11-14 09:38:41 +03:00
return result;
}
2015-11-28 10:45:42 +03:00
Ray makeRay(float _x, float _y, const float* _invVp)
{
Ray ray;
2019-02-04 06:47:33 +03:00
const Vec3 near = { _x, _y, 0.0f };
ray.pos = mulH(near, _invVp);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 far = { _x, _y, 1.0f };
Vec3 tmp = mulH(far, _invVp);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 dir = sub(tmp, ray.pos);
ray.dir = normalize(dir);
2015-11-28 10:45:42 +03:00
return ray;
}
2019-02-04 06:47:33 +03:00
inline Vec3 getPointAt(const Ray& _ray, float _t)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
return add(mul(_ray.dir, _t), _ray.pos);
2015-11-28 10:45:42 +03:00
}
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Aabb& _aabb, Hit* _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
const Vec3 invDir = rcp(_ray.dir);
const Vec3 tmp0 = sub(_aabb.min, _ray.pos);
const Vec3 t0 = mul(tmp0, invDir);
const Vec3 tmp1 = sub(_aabb.max, _ray.pos);
const Vec3 t1 = mul(tmp1, invDir);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 mn = min(t0, t1);
const Vec3 mx = max(t0, t1);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const float tmin = max(mn.x, mn.y, mn.z);
const float tmax = min(mx.x, mx.y, mx.z);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
if (0.0f > tmax
2015-11-28 10:45:42 +03:00
|| tmin > tmax)
{
return false;
}
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
_hit->plane.normal.x = float( (t1.x == tmin) - (t0.x == tmin) );
_hit->plane.normal.y = float( (t1.y == tmin) - (t0.y == tmin) );
_hit->plane.normal.z = float( (t1.z == tmin) - (t0.z == tmin) );
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
_hit->plane.dist = tmin;
_hit->pos = getPointAt(_ray, tmin);
2015-11-28 10:45:42 +03:00
}
return true;
}
2019-02-04 06:47:33 +03:00
static constexpr Aabb kUnitAabb =
{
{ -1.0f, -1.0f, -1.0f },
{ 1.0f, 1.0f, 1.0f },
};
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Obb& _obb, Hit* _hit)
{
Aabb aabb;
toAabb(aabb, _obb);
if (!intersect(_ray, aabb) )
{
return false;
}
float mtxInv[16];
2019-02-04 06:47:33 +03:00
mtxInverse(mtxInv, _obb.mtx);
Ray obbRay;
2019-02-04 06:47:33 +03:00
obbRay.pos = mul(_ray.pos, mtxInv);
obbRay.dir = mulXyz0(_ray.dir, mtxInv);
2019-02-04 06:47:33 +03:00
if (intersect(obbRay, kUnitAabb, _hit) )
{
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
{
2019-02-04 06:47:33 +03:00
_hit->pos = mul(_hit->pos, _obb.mtx);
2019-02-04 06:47:33 +03:00
const Vec3 tmp = mulXyz0(_hit->plane.normal, _obb.mtx);
_hit->plane.normal = normalize(tmp);
}
return true;
}
return false;
}
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Disk& _disk, Hit* _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
Plane plane;
plane.normal = _disk.normal;
plane.dist = -dot(_disk.center, _disk.normal);
2015-11-28 10:45:42 +03:00
2017-09-28 07:52:25 +03:00
Hit tmpHit;
_hit = NULL != _hit ? _hit : &tmpHit;
2015-11-28 10:45:42 +03:00
2017-09-28 07:52:25 +03:00
if (intersect(_ray, plane, _hit) )
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
const Vec3 tmp = sub(_disk.center, _hit->pos);
return dot(tmp, tmp) <= square(_disk.radius);
2015-11-28 10:45:42 +03:00
}
return false;
}
2017-09-28 07:52:25 +03:00
static bool intersect(const Ray& _ray, const Cylinder& _cylinder, bool _capsule, Hit* _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
Vec3 axis = sub(_cylinder.end, _cylinder.pos);
const Vec3 rc = sub(_ray.pos, _cylinder.pos);
const Vec3 dxa = cross(_ray.dir, axis);
2015-11-28 10:45:42 +03:00
2019-02-04 10:19:04 +03:00
const float len = length(dxa);
const Vec3 normal = normalize(dxa);
const float dist = bx::abs(dot(rc, normal) );
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
if (dist > _cylinder.radius)
2015-11-28 10:45:42 +03:00
{
return false;
}
2019-02-04 06:47:33 +03:00
Vec3 vo = cross(rc, axis);
const float t0 = -dot(vo, normal) / len;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
vo = normalize(cross(normal, axis) );
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const float rsq = square(_cylinder.radius);
const float ddoto = dot(_ray.dir, vo);
const float ss = t0 - bx::abs(sqrt(rsq - square(dist) ) / ddoto);
2015-11-28 10:45:42 +03:00
2017-09-25 09:33:08 +03:00
if (0.0f > ss)
{
return false;
}
2019-02-04 06:47:33 +03:00
const Vec3 point = getPointAt(_ray, ss);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const float axisLen = length(axis);
axis = normalize(axis);
const float pdota = dot(_cylinder.pos, axis);
const float height = dot(point, axis) - pdota;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
if (0.0f < height
&& axisLen > height)
2015-11-28 10:45:42 +03:00
{
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
2015-11-28 10:45:42 +03:00
{
const float t1 = height / axisLen;
2019-02-04 06:47:33 +03:00
const Vec3 pointOnAxis = lerp(_cylinder.pos, _cylinder.end, t1);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
_hit->pos = point;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 tmp = sub(point, pointOnAxis);
_hit->plane.normal = normalize(tmp);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
_hit->plane.dist = ss;
2015-11-28 10:45:42 +03:00
}
return true;
}
if (_capsule)
{
2019-02-04 06:47:33 +03:00
const float rdota = dot(_ray.pos, axis);
2015-11-28 10:45:42 +03:00
const float pp = rdota - pdota;
const float t1 = pp / axisLen;
2019-02-04 06:47:33 +03:00
const Vec3 pointOnAxis = lerp(_cylinder.pos, _cylinder.end, t1);
const Vec3 axisToRay = sub(_ray.pos, pointOnAxis);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
if (_cylinder.radius < length(axisToRay)
2015-11-28 10:45:42 +03:00
&& 0.0f > ss)
{
return false;
}
Sphere sphere;
2019-02-04 06:47:33 +03:00
sphere.radius = _cylinder.radius;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
sphere.center = 0.0f >= height
? _cylinder.pos
: _cylinder.end
2018-11-14 09:38:41 +03:00
;
2015-11-28 10:45:42 +03:00
2017-09-28 07:52:25 +03:00
return intersect(_ray, sphere, _hit);
2015-11-28 10:45:42 +03:00
}
2019-02-04 06:47:33 +03:00
Plane plane;
Vec3 pos;
2015-11-28 10:45:42 +03:00
if (0.0f >= height)
{
2019-02-04 06:47:33 +03:00
plane.normal = neg(axis);
pos = _cylinder.pos;
2015-11-28 10:45:42 +03:00
}
else
{
2019-01-04 09:03:40 +03:00
plane.normal = axis;
2019-02-04 06:47:33 +03:00
pos = _cylinder.end;
2015-11-28 10:45:42 +03:00
}
2019-02-04 06:47:33 +03:00
plane.dist = -dot(pos, plane.normal);
2015-11-28 10:45:42 +03:00
2017-09-28 07:52:25 +03:00
Hit tmpHit;
_hit = NULL != _hit ? _hit : &tmpHit;
2015-11-28 10:45:42 +03:00
2017-09-28 07:52:25 +03:00
if (intersect(_ray, plane, _hit) )
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
const Vec3 tmp = sub(pos, _hit->pos);
return dot(tmp, tmp) <= rsq;
2015-11-28 10:45:42 +03:00
}
return false;
}
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Cylinder& _cylinder, Hit* _hit)
2017-09-26 06:18:19 +03:00
{
2017-09-28 07:52:25 +03:00
return intersect(_ray, _cylinder, false, _hit);
2017-09-26 06:18:19 +03:00
}
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Capsule& _capsule, Hit* _hit)
2017-09-26 06:18:19 +03:00
{
BX_STATIC_ASSERT(sizeof(Capsule) == sizeof(Cylinder) );
2017-09-28 07:52:25 +03:00
return intersect(_ray, *( (const Cylinder*)&_capsule), true, _hit);
2017-09-26 06:18:19 +03:00
}
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Cone& _cone, Hit* _hit)
2017-09-25 05:12:18 +03:00
{
2019-02-04 06:47:33 +03:00
const Vec3 axis = sub(_cone.pos, _cone.end);
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const float len = length(axis);
const Vec3 normal = normalize(axis);
2017-09-25 05:12:18 +03:00
Disk disk;
2019-02-04 06:47:33 +03:00
disk.center = _cone.pos;
disk.normal = normal;
disk.radius = _cone.radius;
2017-09-25 05:12:18 +03:00
2017-09-28 07:52:25 +03:00
Hit tmpInt;
Hit* out = NULL != _hit ? _hit : &tmpInt;
2017-09-25 08:50:05 +03:00
bool hit = intersect(_ray, disk, out);
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 ro = sub(_ray.pos, _cone.end);
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const float hyp = sqrt(square(_cone.radius) + square(len) );
const float cosaSq = square(len/hyp);
const float ndoto = dot(normal, ro);
const float ndotd = dot(normal, _ray.dir);
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const float aa = square(ndotd) - cosaSq;
const float bb = 2.0f * (ndotd*ndoto - dot(_ray.dir, ro)*cosaSq);
const float cc = square(ndoto) - dot(ro, ro)*cosaSq;
2017-09-25 05:12:18 +03:00
float det = bb*bb - 4.0f*aa*cc;
if (0.0f > det)
{
2017-09-25 08:50:05 +03:00
return hit;
2017-09-25 05:12:18 +03:00
}
2019-02-04 06:47:33 +03:00
det = sqrt(det);
2017-09-25 08:50:05 +03:00
const float invA2 = 1.0f / (2.0f*aa);
const float t1 = (-bb - det) * invA2;
const float t2 = (-bb + det) * invA2;
2017-09-25 05:12:18 +03:00
float tt = t1;
if (0.0f > t1
|| (0.0f < t2 && t2 < t1) )
{
tt = t2;
}
if (0.0f > tt)
{
2017-09-25 08:50:05 +03:00
return hit;
2017-09-25 05:12:18 +03:00
}
2019-02-04 06:47:33 +03:00
const Vec3 hitPos = getPointAt(_ray, tt);
const Vec3 point = sub(hitPos, _cone.end);
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const float hh = dot(normal, point);
2017-09-25 05:12:18 +03:00
if (0.0f > hh
|| len < hh)
{
2017-09-25 08:50:05 +03:00
return hit;
2017-09-25 05:12:18 +03:00
}
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
2017-09-25 05:12:18 +03:00
{
2017-09-25 08:50:05 +03:00
if (!hit
2019-02-04 06:47:33 +03:00
|| tt < _hit->plane.dist)
2017-09-25 08:50:05 +03:00
{
2019-02-04 06:47:33 +03:00
_hit->plane.dist = tt;
_hit->pos = hitPos;
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const float scale = hh / dot(point, point);
const Vec3 pointScaled = mul(point, scale);
2017-09-25 05:12:18 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 tmp = sub(pointScaled, normal);
_hit->plane.normal = normalize(tmp);
2017-09-25 08:50:05 +03:00
}
2017-09-25 05:12:18 +03:00
}
return true;
}
2019-02-04 06:47:33 +03:00
bool intersect(const Ray& _ray, const Plane& _plane, Hit* _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
const float dist = distance(_plane, _ray.pos);
if (0.0f > dist)
2015-11-28 10:45:42 +03:00
{
return false;
}
2019-02-04 06:47:33 +03:00
const float ndotd = dot(_ray.dir, _plane.normal);
2015-11-28 10:45:42 +03:00
if (0.0f < ndotd)
{
return false;
}
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
_hit->plane.normal = _plane.normal;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
float tt = -dist/ndotd;
_hit->plane.dist = tt;
_hit->pos = getPointAt(_ray, tt);
2015-11-28 10:45:42 +03:00
}
return true;
}
2017-09-28 07:52:25 +03:00
bool intersect(const Ray& _ray, const Sphere& _sphere, Hit* _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
const Vec3 rs = sub(_ray.pos, _sphere.center);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const float bb = dot(rs, _ray.dir);
2015-11-28 10:45:42 +03:00
if (0.0f < bb)
{
return false;
}
2019-02-04 06:47:33 +03:00
const float aa = dot(_ray.dir, _ray.dir);
const float cc = dot(rs, rs) - square(_sphere.radius);
2015-11-28 10:45:42 +03:00
const float discriminant = bb*bb - aa*cc;
if (0.0f >= discriminant)
{
return false;
}
2019-02-04 06:47:33 +03:00
const float sqrtDiscriminant = sqrt(discriminant);
2015-11-28 10:45:42 +03:00
const float invA = 1.0f / aa;
const float tt = -(bb + sqrtDiscriminant)*invA;
if (0.0f >= tt)
{
return false;
}
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
_hit->plane.dist = tt;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 point = getPointAt(_ray, tt);
_hit->pos = point;
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const Vec3 tmp = sub(point, _sphere.center);
_hit->plane.normal = normalize(tmp);
2015-11-28 10:45:42 +03:00
}
return true;
}
2019-02-04 06:47:33 +03:00
bool intersect(const Ray& _ray, const Triangle& _triangle, Hit* _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
const Vec3 edge10 = sub(_triangle.v1, _triangle.v0);
const Vec3 edge02 = sub(_triangle.v0, _triangle.v2);
const Vec3 normal = cross(edge02, edge10);
const Vec3 vo = sub(_triangle.v0, _ray.pos);
const Vec3 dxo = cross(_ray.dir, vo);
const float det = dot(normal, _ray.dir);
if (0.0f < det)
2015-11-28 10:45:42 +03:00
{
return false;
}
const float invDet = 1.0f/det;
2019-02-04 06:47:33 +03:00
const float bz = dot(dxo, edge02) * invDet;
const float by = dot(dxo, edge10) * invDet;
2015-11-28 10:45:42 +03:00
const float bx = 1.0f - by - bz;
2019-02-04 06:47:33 +03:00
if (0.0f > bx
|| 0.0f > by
|| 0.0f > bz)
2015-11-28 10:45:42 +03:00
{
return false;
}
2017-09-28 07:52:25 +03:00
if (NULL != _hit)
2015-11-28 10:45:42 +03:00
{
2019-02-04 06:47:33 +03:00
_hit->plane.normal = normalize(normal);
2015-11-28 10:45:42 +03:00
2019-02-04 06:47:33 +03:00
const float tt = dot(normal, vo) * invDet;
_hit->plane.dist = tt;
_hit->pos = getPointAt(_ray, tt);
2015-11-28 10:45:42 +03:00
}
return true;
2013-02-22 09:07:31 +04:00
}
2019-02-04 06:47:33 +03:00
2019-02-04 10:19:04 +03:00
Vec3 barycentric(const Triangle& _triangle, const Vec3& _pos)
2019-02-04 09:07:51 +03:00
{
const Vec3 v0 = sub(_triangle.v1, _triangle.v0);
const Vec3 v1 = sub(_triangle.v2, _triangle.v0);
const Vec3 v2 = sub(_pos, _triangle.v0);
const float dot00 = dot(v0, v0);
const float dot01 = dot(v0, v1);
const float dot02 = dot(v0, v2);
const float dot11 = dot(v1, v1);
const float dot12 = dot(v1, v2);
const float invDenom = 1.0f/(dot00*dot11 - square(dot01) );
2019-02-04 10:19:04 +03:00
const float uu = (dot11*dot02 - dot01*dot12)*invDenom;
const float vv = (dot00*dot12 - dot01*dot02)*invDenom;
const float ww = 1.0f - uu - vv;
return { uu, vv, ww };
2019-02-04 09:07:51 +03:00
}
2019-02-04 10:19:04 +03:00
Vec3 cartesian(const Triangle& _triangle, const Vec3& _uvw)
{
const Vec3 b0 = mul(_triangle.v0, _uvw.x);
const Vec3 b1 = mul(_triangle.v1, _uvw.y);
const Vec3 b2 = mul(_triangle.v2, _uvw.z);
return add(add(b0, b1), b2);
}
void calcPlane(Plane& _outPlane, const Triangle& _triangle)
{
calcPlane(_outPlane, _triangle.v0, _triangle.v1, _triangle.v2);
}
Vec3 closestPoint(const Plane& _plane, const Vec3& _pos)
2019-02-04 06:47:33 +03:00
{
const float dist = distance(_plane, _pos);
return sub(_pos, mul(_plane.normal, dist) );
}
2019-02-04 10:19:04 +03:00
Vec3 closestPoint(const Aabb& _aabb, const Vec3& _pos)
2019-02-04 06:47:33 +03:00
{
return clamp(_pos, _aabb.min, _aabb.max);
}
2019-02-04 10:19:04 +03:00
Vec3 closestPoint(const Triangle& _triangle, const Vec3& _pos)
{
Plane plane;
calcPlane(plane, _triangle);
const Vec3 pos = closestPoint(plane, _pos);
const Vec3 uvw = barycentric(_triangle, pos);
return cartesian(_triangle, clamp(uvw, {0.0f, 0.0f, 0.0f}, {1.0f, 1.0f, 1.0f}) );
}
2019-02-04 06:47:33 +03:00
bool overlap(const Sphere& _sphere, const Vec3& _pos)
{
const Vec3 ba = sub(_sphere.center, _pos);
const float rsq = square(_sphere.radius);
return dot(ba, ba) <= rsq;
}
bool overlap(const Sphere& _sphereA, const Sphere& _sphereB)
{
2019-02-04 09:07:51 +03:00
const Vec3 ba = sub(_sphereA.center, _sphereB.center);
const float rsq = square(_sphereA.radius + _sphereB.radius);
2019-02-04 06:47:33 +03:00
return dot(ba, ba) <= rsq;
}
bool overlap(const Sphere& _sphere, const Aabb& _aabb)
{
const Vec3 pos = closestPoint(_aabb, _sphere.center);
return overlap(_sphere, pos);
}
bool overlap(const Sphere& _sphere, const Plane& _plane)
{
return bx::abs(distance(_plane, _sphere.center) ) <= _sphere.radius;
}
bool overlap(const Sphere& _sphere, const Triangle& _triangle)
{
Plane plane;
2019-02-04 10:19:04 +03:00
calcPlane(plane, _triangle);
2019-02-04 06:47:33 +03:00
if (!overlap(_sphere, plane) )
{
return false;
}
const Vec3 pos = closestPoint(plane, _sphere.center);
2019-02-04 10:19:04 +03:00
const Vec3 uvw = barycentric(_triangle, pos);
2019-02-04 06:47:33 +03:00
const float nr = -_sphere.radius;
2019-02-04 10:19:04 +03:00
return uvw.x >= nr
&& uvw.y >= nr
&& uvw.z >= nr
2019-02-04 06:47:33 +03:00
;
}
bool overlap(const Sphere& _sphere, const Cylinder& _cylinder)
{
BX_UNUSED(_sphere, _cylinder);
return false;
}
bool overlap(const Sphere& _sphere, const Capsule& _capsule)
{
BX_UNUSED(_sphere, _capsule);
return false;
}
bool overlap(const Sphere& _sphere, const Cone& _cone)
{
BX_UNUSED(_sphere, _cone);
return false;
}
bool overlap(const Sphere& _sphere, const Disk& _disk)
{
2019-02-04 09:07:51 +03:00
if (!overlap(_sphere, Sphere{_disk.center, _disk.radius}) )
{
return false;
}
2019-02-04 10:19:04 +03:00
Plane plane;
calcPlane(plane, _disk.normal, _disk.center);
2019-02-04 09:07:51 +03:00
return overlap(_sphere, plane);
2019-02-04 06:47:33 +03:00
}
bool overlap(const Sphere& _sphere, const Obb& _obb)
{
BX_UNUSED(_sphere, _obb);
return false;
}
bool overlap(const Aabb& _aabb, const Vec3& _pos)
{
const Vec3 ac = getCenter(_aabb);
const Vec3 ae = getExtents(_aabb);
const Vec3 abc = bx::abs(sub(ac, _pos) );
return abc.x <= ae.x
&& abc.y <= ae.y
&& abc.z <= ae.z
;
}
2019-02-04 09:07:51 +03:00
bool overlap(const Aabb& _aabb, const Sphere& _sphere)
{
return overlap(_sphere, _aabb);
}
2019-02-04 06:47:33 +03:00
uint32_t overlapTestMask(const Aabb& _aabbA, const Aabb& _aabbB)
{
/// Returns 0 is two AABB don't overlap, otherwise returns flags of overlap
/// test.
const uint32_t ltMinX = _aabbA.max.x < _aabbB.min.x;
const uint32_t gtMaxX = _aabbA.min.x > _aabbB.max.x;
const uint32_t ltMinY = _aabbA.max.y < _aabbB.min.y;
const uint32_t gtMaxY = _aabbA.min.y > _aabbB.max.y;
const uint32_t ltMinZ = _aabbA.max.z < _aabbB.min.z;
const uint32_t gtMaxZ = _aabbA.min.z > _aabbB.max.z;
return 0
| (ltMinX << 0)
| (gtMaxX << 1)
| (ltMinY << 2)
| (gtMaxY << 3)
| (ltMinZ << 4)
| (gtMaxZ << 5)
;
}
bool overlap(const Aabb& _aabbA, const Aabb& _aabbB)
{
#if 0
return 0 != overlapTestMask(_aabbA, _aabbB);
#else
const Vec3 ac = getCenter(_aabbA);
const Vec3 bc = getCenter(_aabbB);
const Vec3 abc = bx::abs(sub(ac, bc) );
const Vec3 ae = getExtents(_aabbA);
const Vec3 be = getExtents(_aabbB);
const Vec3 abe = add(ae, be);
return abc.x <= abe.x
&& abc.y <= abe.y
&& abc.z <= abe.z
;
#endif // 0
}
bool overlap(const Aabb& _aabb, const Plane& _plane)
{
const Vec3 center = getCenter(_aabb);
const float dist = distance(_plane, center);
const Vec3 extents = getExtents(_aabb);
const Vec3 normal = bx::abs(_plane.normal);
const float radius = dot(extents, normal);
return bx::abs(dist) <= radius;
}
bool overlap(const Aabb& _aabb, const Triangle& _triangle)
{
Plane plane;
2019-02-04 10:19:04 +03:00
calcPlane(plane, _triangle);
2019-02-04 06:47:33 +03:00
if (!overlap(_aabb, plane) )
{
return false;
}
BX_UNUSED(_aabb, _triangle);
return false;
}
bool overlap(const Aabb& _aabb, const Cylinder& _cylinder)
{
BX_UNUSED(_aabb, _cylinder);
return false;
}
bool overlap(const Aabb& _aabb, const Capsule& _capsule)
{
BX_UNUSED(_aabb, _capsule);
return false;
}
bool overlap(const Aabb& _aabb, const Cone& _cone)
{
BX_UNUSED(_aabb, _cone);
return false;
}
bool overlap(const Aabb& _aabb, const Disk& _disk)
{
2019-02-04 09:07:51 +03:00
if (!overlap(_aabb, Sphere{_disk.center, _disk.radius}) )
{
return false;
}
2019-02-04 10:19:04 +03:00
Plane plane;
calcPlane(plane, _disk.normal, _disk.center);
2019-02-04 09:07:51 +03:00
return overlap(_aabb, plane);
2019-02-04 06:47:33 +03:00
}
bool overlap(const Aabb& _aabb, const Obb& _obb)
{
BX_UNUSED(_aabb, _obb);
return false;
}
2019-02-04 10:19:04 +03:00
bool overlap(const Triangle& _triangle, const Vec3& _pos)
2019-02-04 06:47:33 +03:00
{
2019-02-04 10:19:04 +03:00
const Vec3 uvw = barycentric(_triangle, _pos);
2019-02-04 06:47:33 +03:00
2019-02-04 10:19:04 +03:00
return uvw.x >= 0.0f
&& uvw.y >= 0.0f
&& uvw.z >= 0.0f
2019-02-04 06:47:33 +03:00
;
}
2019-02-04 09:07:51 +03:00
bool overlap(const Triangle& _triangle, const Sphere& _sphere)
{
return overlap(_sphere, _triangle);
}
bool overlap(const Triangle& _triangle, const Aabb& _aabb)
{
return overlap(_aabb, _triangle);
}
2019-02-04 10:19:04 +03:00
bool overlap(const Triangle& _triangle, const Plane& _plane)
2019-02-04 06:47:33 +03:00
{
const float dist0 = distance(_plane, _triangle.v0);
const float dist1 = distance(_plane, _triangle.v1);
const float dist2 = distance(_plane, _triangle.v2);
const float minDist = min(dist0, dist1, dist2);
const float maxDist = max(dist0, dist1, dist2);
return 0.0f > minDist
&& 0.0f < maxDist
;
}
bool overlap(const Triangle& _triangleA, const Triangle& _triangleB)
{
BX_UNUSED(_triangleA, _triangleB);
return false;
}
bool overlap(const Triangle& _triangle, const Cylinder& _cylinder)
{
BX_UNUSED(_triangle, _cylinder);
return false;
}
bool overlap(const Triangle& _triangle, const Capsule& _capsule)
{
BX_UNUSED(_triangle, _capsule);
return false;
}
bool overlap(const Triangle& _triangle, const Cone& _cone)
{
BX_UNUSED(_triangle, _cone);
return false;
}
bool overlap(const Triangle& _triangle, const Disk& _disk)
{
2019-02-04 09:07:51 +03:00
if (!overlap(_triangle, Sphere{_disk.center, _disk.radius}) )
{
return false;
}
2019-02-04 10:19:04 +03:00
Plane plane;
calcPlane(plane, _disk.normal, _disk.center);
2019-02-04 09:07:51 +03:00
return overlap(_triangle, plane);
2019-02-04 06:47:33 +03:00
}
bool overlap(const Triangle& _triangle, const Obb& _obb)
{
BX_UNUSED(_triangle, _obb);
return false;
}