2011-02-01 11:03:54 +00:00
|
|
|
/********************************************************************************
|
2015-02-15 20:56:45 +00:00
|
|
|
* ReactPhysics3D physics library, http://www.reactphysics3d.com *
|
2016-04-11 18:15:20 +00:00
|
|
|
* Copyright (c) 2010-2016 Daniel Chappuis *
|
2011-02-01 11:03:54 +00:00
|
|
|
*********************************************************************************
|
|
|
|
* *
|
2011-11-13 17:49:03 +00:00
|
|
|
* 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. *
|
2011-02-01 11:03:54 +00:00
|
|
|
* *
|
2011-11-13 17:49:03 +00:00
|
|
|
* 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. *
|
2011-02-01 11:03:54 +00:00
|
|
|
* *
|
|
|
|
********************************************************************************/
|
|
|
|
|
|
|
|
// Libraries
|
2017-04-01 22:33:29 +00:00
|
|
|
#include "SphereVsConvexPolyhedronAlgorithm.h"
|
2017-02-02 21:58:40 +00:00
|
|
|
#include "SAT/SATAlgorithm.h"
|
|
|
|
#include "collision/shapes/SphereShape.h"
|
|
|
|
#include "collision/shapes/ConvexMeshShape.h"
|
2011-02-01 11:03:54 +00:00
|
|
|
|
2017-02-02 21:58:40 +00:00
|
|
|
// We want to use the ReactPhysics3D namespace
|
2011-02-07 14:51:54 +00:00
|
|
|
using namespace reactphysics3d;
|
2011-02-01 11:03:54 +00:00
|
|
|
|
2017-04-01 22:33:29 +00:00
|
|
|
bool SphereVsConvexPolyhedronAlgorithm::testCollision(const NarrowPhaseInfo* narrowPhaseInfo,
|
2017-02-26 11:48:50 +00:00
|
|
|
ContactManifoldInfo& contactManifoldInfo) {
|
2017-02-02 21:58:40 +00:00
|
|
|
|
|
|
|
// Get the local-space to world-space transforms
|
|
|
|
const Transform& transform1 = narrowPhaseInfo->shape1ToWorldTransform;
|
|
|
|
const Transform& transform2 = narrowPhaseInfo->shape2ToWorldTransform;
|
|
|
|
|
|
|
|
// First, we run the GJK algorithm
|
|
|
|
GJKAlgorithm gjkAlgorithm;
|
2017-02-26 11:48:50 +00:00
|
|
|
GJKAlgorithm::GJKResult result = gjkAlgorithm.testCollision(narrowPhaseInfo, contactManifoldInfo);
|
2017-02-02 21:58:40 +00:00
|
|
|
|
|
|
|
// If we have found a contact point inside the margins (shallow penetration)
|
|
|
|
if (result == GJKAlgorithm::GJKResult::COLLIDE_IN_MARGIN) {
|
|
|
|
|
|
|
|
// Return true
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we have overlap even without the margins (deep penetration)
|
|
|
|
if (result == GJKAlgorithm::GJKResult::INTERPENETRATE) {
|
|
|
|
|
|
|
|
// Run the SAT algorithm to find the separating axis and compute contact point
|
|
|
|
SATAlgorithm satAlgorithm;
|
2017-02-26 11:48:50 +00:00
|
|
|
return satAlgorithm.testCollision(narrowPhaseInfo, contactManifoldInfo);
|
2017-02-02 21:58:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
2011-02-07 14:51:54 +00:00
|
|
|
}
|