Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
godotengine
GitHub Repository: godotengine/godot
Path: blob/master/scene/resources/2d/polygon_path_finder.h
9898 views
1
/**************************************************************************/
2
/* polygon_path_finder.h */
3
/**************************************************************************/
4
/* This file is part of: */
5
/* GODOT ENGINE */
6
/* https://godotengine.org */
7
/**************************************************************************/
8
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
9
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
10
/* */
11
/* Permission is hereby granted, free of charge, to any person obtaining */
12
/* a copy of this software and associated documentation files (the */
13
/* "Software"), to deal in the Software without restriction, including */
14
/* without limitation the rights to use, copy, modify, merge, publish, */
15
/* distribute, sublicense, and/or sell copies of the Software, and to */
16
/* permit persons to whom the Software is furnished to do so, subject to */
17
/* the following conditions: */
18
/* */
19
/* The above copyright notice and this permission notice shall be */
20
/* included in all copies or substantial portions of the Software. */
21
/* */
22
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
23
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
24
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
25
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
26
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
27
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
28
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
29
/**************************************************************************/
30
31
#pragma once
32
33
#include "core/io/resource.h"
34
35
class PolygonPathFinder : public Resource {
36
GDCLASS(PolygonPathFinder, Resource);
37
38
struct Point {
39
Vector2 pos;
40
HashSet<int> connections;
41
float distance = 0.0;
42
float penalty = 0.0;
43
int prev = 0;
44
};
45
46
union Edge {
47
struct {
48
int32_t points[2];
49
};
50
uint64_t key = 0;
51
52
_FORCE_INLINE_ bool operator==(const Edge &p_edge) const {
53
return key == p_edge.key;
54
}
55
_FORCE_INLINE_ static uint32_t hash(const Edge &p_edge) {
56
return hash_one_uint64(p_edge.key);
57
}
58
59
Edge(int a = 0, int b = 0) {
60
if (a > b) {
61
SWAP(a, b);
62
}
63
points[0] = a;
64
points[1] = b;
65
}
66
};
67
68
Vector2 outside_point;
69
Rect2 bounds;
70
71
Vector<Point> points;
72
HashSet<Edge, Edge> edges;
73
74
bool _is_point_inside(const Vector2 &p_point) const;
75
76
void _set_data(const Dictionary &p_data);
77
Dictionary _get_data() const;
78
79
protected:
80
static void _bind_methods();
81
82
public:
83
void setup(const Vector<Vector2> &p_points, const Vector<int> &p_connections);
84
Vector<Vector2> find_path(const Vector2 &p_from, const Vector2 &p_to);
85
86
void set_point_penalty(int p_point, float p_penalty);
87
float get_point_penalty(int p_point) const;
88
89
bool is_point_inside(const Vector2 &p_point) const;
90
Vector2 get_closest_point(const Vector2 &p_point) const;
91
Vector<Vector2> get_intersections(const Vector2 &p_from, const Vector2 &p_to) const;
92
Rect2 get_bounds() const;
93
94
PolygonPathFinder();
95
};
96
97