2017-02-02 22:10:01 +00:00
|
|
|
/********************************************************************************
|
|
|
|
* ReactPhysics3D physics library, http://www.reactphysics3d.com *
|
|
|
|
* Copyright (c) 2010-2016 Daniel Chappuis *
|
|
|
|
*********************************************************************************
|
|
|
|
* *
|
|
|
|
* This software is provided 'as-is', without any express or implied warranty. *
|
|
|
|
* In no event will the authors be held liable for any damages arising from the *
|
|
|
|
* use of this software. *
|
|
|
|
* *
|
|
|
|
* Permission is granted to anyone to use this software for any purpose, *
|
|
|
|
* including commercial applications, and to alter it and redistribute it *
|
|
|
|
* freely, subject to the following restrictions: *
|
|
|
|
* *
|
|
|
|
* 1. The origin of this software must not be misrepresented; you must not claim *
|
|
|
|
* that you wrote the original software. If you use this software in a *
|
|
|
|
* product, an acknowledgment in the product documentation would be *
|
|
|
|
* appreciated but is not required. *
|
|
|
|
* *
|
|
|
|
* 2. Altered source versions must be plainly marked as such, and must not be *
|
|
|
|
* misrepresented as being the original software. *
|
|
|
|
* *
|
|
|
|
* 3. This notice may not be removed or altered from any source distribution. *
|
|
|
|
* *
|
|
|
|
********************************************************************************/
|
|
|
|
|
|
|
|
#ifndef TEST_MATHEMATICS_FUNCTIONS_H
|
|
|
|
#define TEST_MATHEMATICS_FUNCTIONS_H
|
|
|
|
|
|
|
|
// Libraries
|
2017-12-04 21:14:52 +00:00
|
|
|
#include "containers/List.h"
|
|
|
|
#include "memory/DefaultAllocator.h"
|
2017-02-02 22:10:01 +00:00
|
|
|
|
|
|
|
/// Reactphysics3D namespace
|
|
|
|
namespace reactphysics3d {
|
|
|
|
|
|
|
|
// Class TestMathematicsFunctions
|
|
|
|
/**
|
|
|
|
* Unit test for mathematics functions
|
|
|
|
*/
|
|
|
|
class TestMathematicsFunctions : public Test {
|
|
|
|
|
|
|
|
private :
|
|
|
|
|
|
|
|
// ---------- Atributes ---------- //
|
|
|
|
|
2017-12-04 21:14:52 +00:00
|
|
|
DefaultAllocator mAllocator;
|
2017-02-02 22:10:01 +00:00
|
|
|
|
|
|
|
public :
|
|
|
|
|
|
|
|
// ---------- Methods ---------- //
|
|
|
|
|
|
|
|
/// Constructor
|
|
|
|
TestMathematicsFunctions(const std::string& name): Test(name) {}
|
|
|
|
|
|
|
|
/// Run the tests
|
|
|
|
void run() {
|
|
|
|
|
|
|
|
// Test approxEqual()
|
|
|
|
test(approxEqual(2, 7, 5.2));
|
|
|
|
test(approxEqual(7, 2, 5.2));
|
|
|
|
test(approxEqual(6, 6));
|
|
|
|
test(!approxEqual(1, 5));
|
|
|
|
test(!approxEqual(1, 5, 3));
|
|
|
|
test(approxEqual(-2, -2));
|
|
|
|
test(approxEqual(-2, -7, 6));
|
|
|
|
test(!approxEqual(-2, 7, 2));
|
|
|
|
test(approxEqual(-3, 8, 12));
|
|
|
|
test(!approxEqual(-3, 8, 6));
|
|
|
|
|
|
|
|
// Test clamp()
|
|
|
|
test(clamp(4, -3, 5) == 4);
|
|
|
|
test(clamp(-3, 1, 8) == 1);
|
|
|
|
test(clamp(45, -6, 7) == 7);
|
|
|
|
test(clamp(-5, -2, -1) == -2);
|
|
|
|
test(clamp(-5, -9, -1) == -5);
|
|
|
|
test(clamp(6, 6, 9) == 6);
|
|
|
|
test(clamp(9, 6, 9) == 9);
|
|
|
|
test(clamp(decimal(4), decimal(-3), decimal(5)) == decimal(4));
|
|
|
|
test(clamp(decimal(-3), decimal(1), decimal(8)) == decimal(1));
|
|
|
|
test(clamp(decimal(45), decimal(-6), decimal(7)) == decimal(7));
|
|
|
|
test(clamp(decimal(-5), decimal(-2), decimal(-1)) == decimal(-2));
|
|
|
|
test(clamp(decimal(-5), decimal(-9), decimal(-1)) == decimal(-5));
|
|
|
|
test(clamp(decimal(6), decimal(6), decimal(9)) == decimal(6));
|
|
|
|
test(clamp(decimal(9), decimal(6), decimal(9)) == decimal(9));
|
|
|
|
|
|
|
|
// Test min3()
|
|
|
|
test(min3(1, 5, 7) == 1);
|
|
|
|
test(min3(-4, 2, 4) == -4);
|
|
|
|
test(min3(-1, -5, -7) == -7);
|
|
|
|
test(min3(13, 5, 47) == 5);
|
|
|
|
test(min3(4, 4, 4) == 4);
|
|
|
|
|
|
|
|
// Test max3()
|
|
|
|
test(max3(1, 5, 7) == 7);
|
|
|
|
test(max3(-4, 2, 4) == 4);
|
|
|
|
test(max3(-1, -5, -7) == -1);
|
|
|
|
test(max3(13, 5, 47) == 47);
|
|
|
|
test(max3(4, 4, 4) == 4);
|
|
|
|
|
|
|
|
// Test sameSign()
|
|
|
|
test(sameSign(4, 53));
|
|
|
|
test(sameSign(-4, -8));
|
|
|
|
test(!sameSign(4, -7));
|
|
|
|
test(!sameSign(-4, 53));
|
|
|
|
|
|
|
|
// Test computeBarycentricCoordinatesInTriangle()
|
|
|
|
Vector3 a(0, 0, 0);
|
|
|
|
Vector3 b(5, 0, 0);
|
|
|
|
Vector3 c(0, 0, 5);
|
|
|
|
Vector3 testPoint(4, 0, 1);
|
|
|
|
decimal u,v,w;
|
|
|
|
computeBarycentricCoordinatesInTriangle(a, b, c, a, u, v, w);
|
|
|
|
test(approxEqual(u, 1.0, 0.000001));
|
|
|
|
test(approxEqual(v, 0.0, 0.000001));
|
|
|
|
test(approxEqual(w, 0.0, 0.000001));
|
|
|
|
computeBarycentricCoordinatesInTriangle(a, b, c, b, u, v, w);
|
|
|
|
test(approxEqual(u, 0.0, 0.000001));
|
|
|
|
test(approxEqual(v, 1.0, 0.000001));
|
|
|
|
test(approxEqual(w, 0.0, 0.000001));
|
|
|
|
computeBarycentricCoordinatesInTriangle(a, b, c, c, u, v, w);
|
|
|
|
test(approxEqual(u, 0.0, 0.000001));
|
|
|
|
test(approxEqual(v, 0.0, 0.000001));
|
|
|
|
test(approxEqual(w, 1.0, 0.000001));
|
|
|
|
|
|
|
|
computeBarycentricCoordinatesInTriangle(a, b, c, testPoint, u, v, w);
|
|
|
|
test(approxEqual(u + v + w, 1.0, 0.000001));
|
|
|
|
|
|
|
|
// Test computeClosestPointBetweenTwoSegments()
|
|
|
|
Vector3 closestSeg1, closestSeg2;
|
|
|
|
computeClosestPointBetweenTwoSegments(Vector3(4, 0, 0), Vector3(6, 0, 0), Vector3(8, 0, 0), Vector3(8, 6, 0), closestSeg1, closestSeg2);
|
|
|
|
test(approxEqual(closestSeg1.x, 6.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg1.y, 0.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg1.z, 0.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.x, 8.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.y, 0.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.z, 0.0, 0.000001));
|
|
|
|
computeClosestPointBetweenTwoSegments(Vector3(4, 6, 5), Vector3(4, 6, 5), Vector3(8, 3, -9), Vector3(8, 3, -9), closestSeg1, closestSeg2);
|
|
|
|
test(approxEqual(closestSeg1.x, 4.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg1.y, 6.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg1.z, 5.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.x, 8.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.y, 3.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.z, -9.0, 0.000001));
|
|
|
|
computeClosestPointBetweenTwoSegments(Vector3(0, -5, 0), Vector3(0, 8, 0), Vector3(6, 3, 0), Vector3(10, -3, 0), closestSeg1, closestSeg2);
|
|
|
|
test(approxEqual(closestSeg1.x, 0.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg1.y, 3.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg1.z, 0.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.x, 6.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.y, 3.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.z, 0.0, 0.000001));
|
|
|
|
computeClosestPointBetweenTwoSegments(Vector3(1, -4, -5), Vector3(1, 4, -5), Vector3(-6, 5, -5), Vector3(6, 5, -5), closestSeg1, closestSeg2);
|
|
|
|
test(approxEqual(closestSeg1.x, 1.0, 0.000001));
|
2017-02-20 15:11:13 +00:00
|
|
|
test(approxEqual(closestSeg1.y, 4.0, 0.000001));
|
2017-02-02 22:10:01 +00:00
|
|
|
test(approxEqual(closestSeg1.z, -5.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.x, 1.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.y, 5.0, 0.000001));
|
|
|
|
test(approxEqual(closestSeg2.z, -5.0, 0.000001));
|
|
|
|
|
|
|
|
// Test computePlaneSegmentIntersection();
|
2017-02-20 15:11:13 +00:00
|
|
|
test(approxEqual(computePlaneSegmentIntersection(Vector3(-6, 3, 0), Vector3(6, 3, 0), 0.0, Vector3(-1, 0, 0)), 0.5, 0.000001));
|
2017-02-02 22:10:01 +00:00
|
|
|
test(approxEqual(computePlaneSegmentIntersection(Vector3(-6, 3, 0), Vector3(6, 3, 0), 0.0, Vector3(1, 0, 0)), 0.5, 0.000001));
|
|
|
|
test(approxEqual(computePlaneSegmentIntersection(Vector3(5, 12, 0), Vector3(5, 4, 0), 6, Vector3(0, 1, 0)), 0.75, 0.000001));
|
|
|
|
test(approxEqual(computePlaneSegmentIntersection(Vector3(5, 4, 8), Vector3(9, 14, 8), 4, Vector3(0, 1, 0)), 0.0, 0.000001));
|
|
|
|
decimal tIntersect = computePlaneSegmentIntersection(Vector3(5, 4, 0), Vector3(9, 4, 0), 4, Vector3(0, 1, 0));
|
2017-02-20 15:11:13 +00:00
|
|
|
test(tIntersect < 0.0 || tIntersect > 1.0);
|
2017-02-02 22:10:01 +00:00
|
|
|
|
2017-05-16 05:10:44 +00:00
|
|
|
// Test computePointToLineDistance()
|
|
|
|
test(approxEqual(computePointToLineDistance(Vector3(6, 0, 0), Vector3(14, 0, 0), Vector3(5, 3, 0)), 3.0, 0.000001));
|
|
|
|
test(approxEqual(computePointToLineDistance(Vector3(6, -5, 0), Vector3(10, -5, 0), Vector3(4, 3, 0)), 8.0, 0.000001));
|
|
|
|
test(approxEqual(computePointToLineDistance(Vector3(6, -5, 0), Vector3(10, -5, 0), Vector3(-43, 254, 0)), 259.0, 0.000001));
|
|
|
|
test(approxEqual(computePointToLineDistance(Vector3(6, -5, 8), Vector3(10, -5, -5), Vector3(6, -5, 8)), 0.0, 0.000001));
|
|
|
|
test(approxEqual(computePointToLineDistance(Vector3(6, -5, 8), Vector3(10, -5, -5), Vector3(10, -5, -5)), 0.0, 0.000001));
|
2017-04-16 20:09:59 +00:00
|
|
|
|
|
|
|
// Test clipSegmentWithPlanes()
|
|
|
|
std::vector<Vector3> segmentVertices;
|
|
|
|
segmentVertices.push_back(Vector3(-6, 3, 0));
|
|
|
|
segmentVertices.push_back(Vector3(8, 3, 0));
|
|
|
|
|
2017-12-27 19:53:09 +00:00
|
|
|
List<Vector3> planesNormals(mAllocator, 2);
|
|
|
|
List<Vector3> planesPoints(mAllocator, 2);
|
|
|
|
planesNormals.add(Vector3(-1, 0, 0));
|
|
|
|
planesPoints.add(Vector3(4, 0, 0));
|
2017-04-16 20:09:59 +00:00
|
|
|
|
2017-12-27 19:53:09 +00:00
|
|
|
List<Vector3> clipSegmentVertices = clipSegmentWithPlanes(segmentVertices[0], segmentVertices[1],
|
|
|
|
planesPoints, planesNormals, mAllocator);
|
2017-04-16 20:09:59 +00:00
|
|
|
test(clipSegmentVertices.size() == 2);
|
|
|
|
test(approxEqual(clipSegmentVertices[0].x, -6, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[0].y, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[0].z, 0, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].x, 4, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].y, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].z, 0, 0.000001));
|
|
|
|
|
|
|
|
segmentVertices.clear();
|
|
|
|
segmentVertices.push_back(Vector3(8, 3, 0));
|
|
|
|
segmentVertices.push_back(Vector3(-6, 3, 0));
|
|
|
|
|
2017-12-27 19:53:09 +00:00
|
|
|
clipSegmentVertices = clipSegmentWithPlanes(segmentVertices[0], segmentVertices[1], planesPoints, planesNormals, mAllocator);
|
2017-04-16 20:09:59 +00:00
|
|
|
test(clipSegmentVertices.size() == 2);
|
|
|
|
test(approxEqual(clipSegmentVertices[0].x, 4, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[0].y, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[0].z, 0, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].x, -6, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].y, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].z, 0, 0.000001));
|
|
|
|
|
|
|
|
segmentVertices.clear();
|
|
|
|
segmentVertices.push_back(Vector3(-6, 3, 0));
|
|
|
|
segmentVertices.push_back(Vector3(3, 3, 0));
|
|
|
|
|
2017-12-27 19:53:09 +00:00
|
|
|
clipSegmentVertices = clipSegmentWithPlanes(segmentVertices[0], segmentVertices[1], planesPoints, planesNormals, mAllocator);
|
2017-04-16 20:09:59 +00:00
|
|
|
test(clipSegmentVertices.size() == 2);
|
|
|
|
test(approxEqual(clipSegmentVertices[0].x, -6, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[0].y, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[0].z, 0, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].x, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].y, 3, 0.000001));
|
|
|
|
test(approxEqual(clipSegmentVertices[1].z, 0, 0.000001));
|
|
|
|
|
|
|
|
segmentVertices.clear();
|
|
|
|
segmentVertices.push_back(Vector3(5, 3, 0));
|
|
|
|
segmentVertices.push_back(Vector3(8, 3, 0));
|
|
|
|
|
2017-12-27 19:53:09 +00:00
|
|
|
clipSegmentVertices = clipSegmentWithPlanes(segmentVertices[0], segmentVertices[1], planesPoints, planesNormals, mAllocator);
|
2017-04-16 20:09:59 +00:00
|
|
|
test(clipSegmentVertices.size() == 0);
|
|
|
|
|
|
|
|
// Test clipPolygonWithPlanes()
|
2017-12-04 21:14:52 +00:00
|
|
|
List<Vector3> polygonVertices(mAllocator);
|
|
|
|
polygonVertices.add(Vector3(-4, 2, 0));
|
|
|
|
polygonVertices.add(Vector3(7, 2, 0));
|
|
|
|
polygonVertices.add(Vector3(7, 4, 0));
|
|
|
|
polygonVertices.add(Vector3(-4, 4, 0));
|
|
|
|
|
|
|
|
List<Vector3> polygonPlanesNormals(mAllocator);
|
|
|
|
List<Vector3> polygonPlanesPoints(mAllocator);
|
|
|
|
polygonPlanesNormals.add(Vector3(1, 0, 0));
|
|
|
|
polygonPlanesPoints.add(Vector3(0, 0, 0));
|
|
|
|
polygonPlanesNormals.add(Vector3(0, 1, 0));
|
|
|
|
polygonPlanesPoints.add(Vector3(0, 0, 0));
|
|
|
|
polygonPlanesNormals.add(Vector3(-1, 0, 0));
|
|
|
|
polygonPlanesPoints.add(Vector3(10, 0, 0));
|
|
|
|
polygonPlanesNormals.add(Vector3(0, -1, 0));
|
|
|
|
polygonPlanesPoints.add(Vector3(10, 5, 0));
|
|
|
|
|
|
|
|
List<Vector3> clipPolygonVertices = clipPolygonWithPlanes(polygonVertices, polygonPlanesPoints, polygonPlanesNormals, mAllocator);
|
|
|
|
test(clipPolygonVertices.size() == 4);
|
|
|
|
test(approxEqual(clipPolygonVertices[0].x, 0, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[0].y, 2, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[0].z, 0, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[1].x, 7, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[1].y, 2, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[1].z, 0, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[2].x, 7, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[2].y, 4, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[2].z, 0, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[3].x, 0, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[3].y, 4, 0.000001));
|
|
|
|
test(approxEqual(clipPolygonVertices[3].z, 0, 0.000001));
|
2017-04-16 20:09:59 +00:00
|
|
|
|
2017-02-02 22:10:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|