blob: 2cbe3e949d2896c35d77a17a98049e6d27859bf3 (
plain)
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
64
65
66
67
68
69
70
71
|
#ifndef POLYGON_PATH_FINDER_H
#define POLYGON_PATH_FINDER_H
#include "resource.h"
class PolygonPathFinder : public Resource {
OBJ_TYPE(PolygonPathFinder,Resource);
struct Point {
Vector2 pos;
Set<int> connections;
float distance;
float penalty;
int prev;
};
struct Edge {
int points[2];
_FORCE_INLINE_ bool operator<(const Edge& p_edge) const {
if (points[0]==p_edge.points[0])
return points[1]<p_edge.points[1];
else
return points[0]<p_edge.points[0];
}
Edge(int a=0, int b=0) {
if (a>b) {
SWAP(a,b);
}
points[0] = a;
points[1] = b;
}
};
Vector2 outside_point;
Rect2 bounds;
Vector<Point> points;
Set<Edge> edges;
bool _is_point_inside(const Vector2& p_point) const;
void _set_data(const Dictionary& p_data);
Dictionary _get_data() const;
protected:
static void _bind_methods();
public:
void setup(const Vector<Vector2>& p_points, const Vector<int>& p_connections);
Vector<Vector2> find_path(const Vector2& p_from, const Vector2& p_to);
void set_point_penalty(int p_point,float p_penalty);
float get_point_penalty(int p_point) const;
bool is_point_inside(const Vector2& p_point) const;
Vector2 get_closest_point(const Vector2& p_point) const;
Vector<Vector2> get_intersections(const Vector2& p_from, const Vector2& p_to) const;
Rect2 get_bounds() const;
PolygonPathFinder();
};
#endif // POLYGON_PATH_FINDER_H
|