Zylann/godot_voxel
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Move function below to keep ray_intersects_triangle grouped

Browse Source
This commit is contained in:
Marc Gilleron 2022-08-06 22:47:43 +01:00
parent dcc5e3c174
commit 4b1ebf2bcc
1 changed files with 54 additions and 53 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

107
util/math/triangle.h
View File

@ -77,59 +77,6 @@ inline TriangleIntersectionResult ray_intersects_triangle(const Vector3f &p_from
}
}
// If you need to do a lot of raycasts on a triangle using the same direction every time
struct BakedIntersectionTriangleForFixedDirection {
Vector3f v0;
Vector3f e1;
Vector3f e2;
Vector3f h;
float f;
bool bake(Vector3f p_v0, Vector3f p_v1, Vector3f p_v2, Vector3f p_dir) {
v0 = p_v0;
e1 = p_v1 - v0;
e2 = p_v2 - v0;
h = math::cross(p_dir, e2);
const float a = math::dot(e1, h);
if (Math::abs(a) < 0.00001f) {
// Parallel, will never hit
return false;
}
f = 1.0f / a;
return true;
}
inline TriangleIntersectionResult intersect(const Vector3f &p_from, const Vector3f &p_dir) {
const Vector3f s = p_from - v0;
const float u = f * math::dot(s, h);
if ((u < 0.0f) || (u > 1.0f)) {
return { TriangleIntersectionResult::NO_INTERSECTION, -1 };
}
const Vector3f q = math::cross(s, e1);
const float v = f * math::dot(p_dir, q);
if ((v < 0.0f) || (u + v > 1.0f)) {
return { TriangleIntersectionResult::NO_INTERSECTION, -1 };
}
// At this stage we can compute t to find out where
// the intersection point is on the line.
const float t = f * math::dot(e2, q);
if (t > 0.00001f) { // ray intersection
//r_res = p_from + p_dir * t;
return { TriangleIntersectionResult::INTERSECTION, t };
} else { // This means that there is a line intersection but not a ray intersection.
return { TriangleIntersectionResult::NO_INTERSECTION, -1 };
}
}
};
inline TriangleIntersectionResult ray_intersects_triangle(const Vector3d &p_from, const Vector3d &p_dir,
const Vector3d &p_v0, const Vector3d &p_v1, const Vector3d &p_v2) {
const Vector3d e1 = p_v1 - p_v0;
@ -170,6 +117,60 @@ inline TriangleIntersectionResult ray_intersects_triangle(const Vector3d &p_from
}
}
// If you need to do a lot of raycasts on a triangle using the same direction every time
struct BakedIntersectionTriangleForFixedDirection {
Vector3f v0;
Vector3f e1;
Vector3f e2;
Vector3f h;
float f;
bool bake(Vector3f p_v0, Vector3f p_v1, Vector3f p_v2, Vector3f p_dir) {
v0 = p_v0;
e1 = p_v1 - v0;
e2 = p_v2 - v0;
h = math::cross(p_dir, e2);
const float a = math::dot(e1, h);
if (Math::abs(a) < 0.00001f) {
// Parallel, will never hit
return false;
}
f = 1.0f / a;
return true;
}
// Note, `p_dir` must be the same value as used in `bake`
inline TriangleIntersectionResult intersect(const Vector3f &p_from, const Vector3f &p_dir) {
const Vector3f s = p_from - v0;
const float u = f * math::dot(s, h);
if ((u < 0.0f) || (u > 1.0f)) {
return { TriangleIntersectionResult::NO_INTERSECTION, -1 };
}
const Vector3f q = math::cross(s, e1);
const float v = f * math::dot(p_dir, q);
if ((v < 0.0f) || (u + v > 1.0f)) {
return { TriangleIntersectionResult::NO_INTERSECTION, -1 };
}
// At this stage we can compute t to find out where
// the intersection point is on the line.
const float t = f * math::dot(e2, q);
if (t > 0.00001f) { // ray intersection
//r_res = p_from + p_dir * t;
return { TriangleIntersectionResult::INTERSECTION, t };
} else { // This means that there is a line intersection but not a ray intersection.
return { TriangleIntersectionResult::NO_INTERSECTION, -1 };
}
}
};
} // namespace zylann::math
#endif // ZN_TRIANGLE_H