You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
79 lines
2.4 KiB
79 lines
2.4 KiB
3 months ago
|
// David Eberly, Geometric Tools, Redmond WA 98052
|
||
|
|
// Copyright (c) 1998-2021
|
||
|
|
// Distributed under the Boost Software License, Version 1.0.
|
||
|
|
// https://www.boost.org/LICENSE_1_0.txt
|
||
|
|
// https://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
|
||
|
|
// Version: 4.0.2019.08.13
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <Mathematics/IntrSegment2Circle2.h>
|
||
|
|
#include <Mathematics/Arc2.h>
|
||
|
|
|
||
|
|
// The queries consider the arc to be a 1-dimensional object.
|
||
|
|
|
||
|
|
namespace gte
|
||
|
|
{
|
||
|
|
template <typename Real>
|
||
|
|
class TIQuery<Real, Segment2<Real>, Arc2<Real>>
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
struct Result
|
||
|
|
{
|
||
|
|
bool intersect;
|
||
|
|
};
|
||
|
|
|
||
|
|
Result operator()(Segment2<Real> const& segment, Arc2<Real> const& arc)
|
||
|
|
{
|
||
|
|
Result result;
|
||
|
|
FIQuery<Real, Segment2<Real>, Arc2<Real>> saQuery;
|
||
|
|
auto saResult = saQuery(segment, arc);
|
||
|
|
result.intersect = saResult.intersect;
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <typename Real>
|
||
|
|
class FIQuery<Real, Segment2<Real>, Arc2<Real>>
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
struct Result
|
||
|
|
{
|
||
|
|
bool intersect;
|
||
|
|
int numIntersections;
|
||
|
|
std::array<Real, 2> parameter;
|
||
|
|
std::array<Vector2<Real>, 2> point;
|
||
|
|
};
|
||
|
|
|
||
|
|
Result operator()(Segment2<Real> const& segment, Arc2<Real> const& arc)
|
||
|
|
{
|
||
|
|
Result result;
|
||
|
|
result.intersect = false;
|
||
|
|
result.numIntersections = 0;
|
||
|
|
result.parameter[0] = (Real)0;
|
||
|
|
result.parameter[0] = (Real)0;
|
||
|
|
result.point[0] = { (Real)0, (Real)0 };
|
||
|
|
result.point[1] = { (Real)0, (Real)0 };
|
||
|
|
|
||
|
|
FIQuery<Real, Segment2<Real>, Circle2<Real>> scQuery;
|
||
|
|
Circle2<Real> circle(arc.center, arc.radius);
|
||
|
|
auto scResult = scQuery(segment, circle);
|
||
|
|
if (scResult.intersect)
|
||
|
|
{
|
||
|
|
// Test whether line-circle intersections are on the arc.
|
||
|
|
for (int i = 0; i < scResult.numIntersections; ++i)
|
||
|
|
{
|
||
|
|
if (arc.Contains(scResult.point[i]))
|
||
|
|
{
|
||
|
|
result.intersect = true;
|
||
|
|
result.parameter[result.numIntersections] = scResult.parameter[i];
|
||
|
|
result.point[result.numIntersections++] = scResult.point[i];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
}
|