17 #ifndef IGNITION_MATH_TRIANGLE_HH_ 18 #define IGNITION_MATH_TRIANGLE_HH_ 45 this->
Set(_pt1, _pt2, _pt3);
55 this->pts[
clamp(_index, 0u, 2u)] = _pt;
77 T a = this->
Side(0).Length();
78 T b = this->
Side(1).Length();
79 T c = this->
Side(2).Length();
80 return (a+b) > c && (b+c) > a && (c+a) > b;
93 return Line2<T>(this->pts[0], this->pts[1]);
95 return Line2<T>(this->pts[1], this->pts[2]);
97 return Line2<T>(this->pts[2], this->pts[0]);
121 double dot00 = v0.
Dot(v0);
122 double dot01 = v0.
Dot(v1);
123 double dot02 = v0.
Dot(v2);
124 double dot11 = v1.
Dot(v1);
125 double dot12 = v1.
Dot(v2);
128 double invDenom = 1.0 / (dot00 * dot11 - dot01 * dot01);
129 double u = (dot11 * dot02 - dot01 * dot12) * invDenom;
130 double v = (dot00 * dot12 - dot01 * dot02) * invDenom;
133 return (u >= 0) && (v >= 0) && (u + v <= 1);
154 Line2<T> line1(this->pts[0], this->pts[1]);
155 Line2<T> line2(this->pts[1], this->pts[2]);
156 Line2<T> line3(this->pts[2], this->pts[0]);
159 std::set<math::Vector2<T> > points;
174 else if (points.size() == 1)
176 auto iter = points.begin();
188 auto iter = points.begin();
200 return this->
Side(0).Length() + this->
Side(1).Length() +
201 this->
Side(2).Length();
209 T a = this->
Side(0).Length();
210 T b = this->
Side(1).Length();
211 T c = this->
Side(2).Length();
215 return sqrt(s * (s-a) * (s-b) * (s-c));
Line2< T > Side(const unsigned int _index) const
Get a line segment for one side of the triangle.
Definition: Triangle.hh:90
math::Vector2< T > operator[](const size_t _index) const
Get one of points that define the triangle.
Definition: Triangle.hh:223
T Perimeter() const
Get the length of the triangle's perimeter.
Definition: Triangle.hh:198
static const size_t IGN_ZERO_SIZE_T
size_t type with a value of 0
Definition: Helpers.hh:213
double Area() const
Get the area of this triangle.
Definition: Triangle.hh:206
Two dimensional (x, y) vector.
Definition: Vector2.hh:29
bool Contains(const Line2< T > &_line) const
Check if this triangle completely contains the given line segment.
Definition: Triangle.hh:105
A two dimensional line segment.
Definition: Line2.hh:31
void Set(const unsigned int _index, const math::Vector2< T > &_pt)
Set one vertex of the triangle.
Definition: Triangle.hh:53
bool Intersects(const Line2< T > &_line, math::Vector2< T > &_ipt1, math::Vector2< T > &_ipt2) const
Get whether the given line intersects this triangle.
Definition: Triangle.hh:143
T Dot(const Vector2< T > &_v) const
Get the dot product of this vector and _v.
Definition: Vector2.hh:112
Triangle< int > Trianglei
Integer specialization of the Triangle class.
Definition: Triangle.hh:233
Triangle< double > Triangled
Double specialization of the Triangle class.
Definition: Triangle.hh:236
void Set(const math::Vector2< T > &_pt1, const math::Vector2< T > &_pt2, const math::Vector2< T > &_pt3)
Set all vertices of the triangle.
Definition: Triangle.hh:62
Triangle()=default
Default constructor.
bool Intersect(const Line2< T > &_line, double _epsilon=1e-6) const
Check if this line intersects the given line segment.
Definition: Line2.hh:176
static const size_t IGN_TWO_SIZE_T
size_t type with a value of 2
Definition: Helpers.hh:219
bool Valid() const
Get whether this triangle is valid, based on triangle inequality: the sum of the lengths of any two s...
Definition: Triangle.hh:75
Triangle class and related functions.
Definition: Triangle.hh:32
Triangle< float > Trianglef
Float specialization of the Triangle class.
Definition: Triangle.hh:239
bool Contains(const math::Vector2< T > &_pt) const
Get whether this triangle contains the given point.
Definition: Triangle.hh:113
Triangle(const math::Vector2< T > &_pt1, const math::Vector2< T > &_pt2, const math::Vector2< T > &_pt3)
Constructor.
Definition: Triangle.hh:41
T clamp(T _v, T _min, T _max)
Simple clamping function.
Definition: Helpers.hh:392