static int segmentIntersect(lua_State *L)
{
int n = lua_gettop(L); // Number of arguments
if (n != 2)
return luaL_error(L, "Got %d arguments expected 2 (self, segment)", n);
Circle c = Circle_pull(L, 1);
Segment2 s = Segment2_pull(L, 2);
lua_pushboolean(L, c.intersect(s));
return 1;
}
bool KDTreeLeaf::intersectAll(Circle& intersector, std::list<CircleHitResult>* hitResults, BBox& intersectorBox, hpuint depth) {
// Leaf node
std::vector<Triangle>::iterator pos = m_triangles->begin();
std::vector<Triangle>::iterator end = m_triangles->end();
bool hit = false;
for (; pos != end; pos++) {
Triangle triangle = *pos;
if (intersector.intersect(triangle, hitResults)) {
hit = true;
}
}
return hit;
}
// Calculations
bool RectShape2::intersection(const Circle& c, Points2& ) const
{
return c.intersect(iRect);
}
CircleTriangleIntersectionTest::CircleTriangleIntersectionTest() {
InvoluteGear* gear1 = new InvoluteGear();
InvoluteGear* gear2 = new InvoluteGear();
// Test cases
Circle circle0 = Circle(hpvec3(0.0, 0.0, 0.0), hpvec3(0.0, 0.0, 1.0), 1.0);
Circle circle1 = Circle(hpvec3(0.0, 0.0, 1.0), hpvec3(0.0, 0.0, 1.0), 1.0);
Circle circle2 = Circle(hpvec3(0.0, 0.0, 0.026), hpvec3(0.0, 0.0, 1.0), 1.10031);
Circle circle3 = Circle(hpvec3(0.0, 0.0, 0.021), hpvec3(0.0, 0.0, 1.0), 2.0);
Circle circle4 = Circle(hpvec3(0.0, 0.0, 0.1), hpvec3(1.0, 0.0, 0.0), 1.0);
Circle circle5 = Circle(hpvec3(1.1, 4.3, 3.7), hpvec3(-0.7, 1.1, 0.5), 0.37);
std::vector<Circle> circles;
circles.push_back(circle0);
circles.push_back(circle1);
circles.push_back(circle2);
circles.push_back(circle3);
circles.push_back(circle4);
circles.push_back(circle5);
{
std::cout << "Running Circle tests:" << std::endl;
bool totalResult = true;
std::list<CircleHitResult>* hitResults = new std::list<CircleHitResult>;
for (unsigned int c = 0; c < circles.size(); c++) {
Circle circle = circles[c];
circle.m_normal = glm::normalize(circle.m_normal);
hpvec3 orthogonalToNormal1 = glm::normalize(glm::cross(circle.m_normal, circle.m_normal + hpvec3(5.8, 2.1, 3.1)));
hpvec3 orthogonalToNormal2 = glm::normalize(glm::cross(circle.m_normal, orthogonalToNormal1));
// Triangle with same center point
Triangle triangle0 = Triangle(circle.m_center,
hpvec3(17.1, 4.2, 7.1),
hpvec3(3.9, 0.9, 2.9));
LoggingUtils::printVec("orthogonalToNormal1", orthogonalToNormal1);
LoggingUtils::printVec("orthogonalToNormal2", orthogonalToNormal2);
// Triangle that is included in circle
Triangle triangle1 = Triangle(circle.m_center + orthogonalToNormal1 * circle.m_radius * 0.5f,
circle.m_center + orthogonalToNormal2 * circle.m_radius * 0.5f,
circle.m_center);
// Triangle that intersects circle in at least one edge point
Triangle triangle2 = Triangle(circle.m_center + orthogonalToNormal1 * circle.m_radius,
hpvec3(1.0, 1.0, 3.0),
hpvec3(-1.0, 2.0, 1.0));
// Triangle that is in the same plane but too far away
Triangle triangle3 = Triangle(circle.m_center + orthogonalToNormal1 * circle.m_radius * 2.0f,
circle.m_center + orthogonalToNormal1 * circle.m_radius * 4.0f,
circle.m_center + orthogonalToNormal2 * circle.m_radius * 2.0f);
// Triangle that is parallel to circle
Triangle triangle4 = Triangle(circle.m_center + circle.m_normal + orthogonalToNormal1 * circle.m_radius,
circle.m_center + circle.m_normal + orthogonalToNormal2 * circle.m_radius,
circle.m_center + circle.m_normal);
// Triangle that cuts through the circle plane
Triangle triangle5 = Triangle(circle.m_center - circle.m_normal * circle.m_radius,
circle.m_center + circle.m_normal * circle.m_radius,
circle.m_center + orthogonalToNormal2 * circle.m_radius);
// Triangle that is included in circle
Triangle triangle6 = Triangle(circle.m_center + orthogonalToNormal1 * circle.m_radius * 5.0f,
circle.m_center + orthogonalToNormal2 * circle.m_radius * 5.0f,
circle.m_center - orthogonalToNormal2 * circle.m_radius * 5.0f - orthogonalToNormal1 * circle.m_radius * 5.0f);
// Triangle that os
std::vector<Triangle> triangles;
triangles.push_back(triangle0);
triangles.push_back(triangle1);
triangles.push_back(triangle2);
triangles.push_back(triangle3);
triangles.push_back(triangle4);
triangles.push_back(triangle5);
triangles.push_back(triangle6);
// Define the vector that holds the results
bool results[7] = {1, 1, 1, 0, 0, 1, 1};
for (unsigned int t = 0; t < triangles.size(); t++) {
bool result = circle.intersect(triangles[t], hitResults);
bool matchesSolution = (result == results[t]);
// }
std::cout << "Result: [" << c << ", " << t << "]: " << result << " -> " << matchesSolution << std::endl;
if (!matchesSolution) totalResult = false;
}
}
if (totalResult) {
std::cout << "Success: All tests finished successfully!" << std::endl;
} else {
std::cout << "Error: At least one test failed!" << std::endl;
}
}
}