-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathline.cpp
More file actions
63 lines (57 loc) · 1.45 KB
/
Copy pathline.cpp
File metadata and controls
63 lines (57 loc) · 1.45 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include "primitives.hpp"
Line::Line(Point inp1, Point inp2, unsigned int c) : p1(inp1), p2(inp2), color(c)
{
p1.color = Color(color);
p2.color = Color(color);
}
Line::Line(const Point& origin, int length, int angle, Rect* parent, unsigned int c) : p1(origin), color(c)
{
auto radianAngle = getRadianFromDegree(angle);
auto opposite = length * std::sin(radianAngle);
auto adjacent = length * std::cos(radianAngle);
p2 = Point{ origin.x + static_cast<int>(adjacent), origin.y + static_cast<int>(opposite), origin.z, parent , color };
if (p1.parent != parent)
{
p1.parent = parent;
}
p1.color = Color(color);
}
std::tuple<Point, Point> Line::toGlobalCoordinate() const
{
return std::make_tuple<Point, Point>(p1.toGlobalCoordinate(), p2.toGlobalCoordinate());
}
void Line::setParent(const Rect* parent)
{
p1.parent = parent;
p2.parent = parent;
}
bool Line::connected(const Line& other) const
{
return (p1 == other.p1 || p1 == other.p2 || p2 == other.p1 || p2 == other.p2);
}
std::array<Point, 3> Line::getTriangleVertices(const Line& other) const
{
if (connected(other))
{
if (p1 == other.p1)
{
return std::array<Point, 3>{p1, p2, other.p2};
}
else if (p1 == other.p2)
{
return std::array<Point, 3>{other.p1, p2, other.p2};
}
else if (p2 == other.p1)
{
return std::array<Point, 3>{p1, p2, other.p2};
}
else
{
return std::array<Point, 3>{p1, p2, other.p1};
}
}
else
{
throw std::invalid_argument("Lines must connect.");
}
}