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#ifndef POLYGON_PATH_FINDER_H
32#define POLYGON_PATH_FINDER_H
33
34#include "core/io/resource.h"
35
36class PolygonPathFinder : public Resource {
37 GDCLASS(PolygonPathFinder, Resource);
38
39 struct Point {
40 Vector2 pos;
41 HashSet<int> connections;
42 float distance = 0.0;
43 float penalty = 0.0;
44 int prev = 0;
45 };
46
47 union Edge {
48 struct {
49 int32_t points[2];
50 };
51 uint64_t key = 0;
52
53 _FORCE_INLINE_ bool operator==(const Edge &p_edge) const {
54 return key == p_edge.key;
55 }
56 _FORCE_INLINE_ static uint32_t hash(const Edge &p_edge) {
57 return hash_one_uint64(p_edge.key);
58 }
59
60 Edge(int a = 0, int b = 0) {
61 if (a > b) {
62 SWAP(a, b);
63 }
64 points[0] = a;
65 points[1] = b;
66 }
67 };
68
69 Vector2 outside_point;
70 Rect2 bounds;
71
72 Vector<Point> points;
73 HashSet<Edge, Edge> edges;
74
75 bool _is_point_inside(const Vector2 &p_point) const;
76
77 void _set_data(const Dictionary &p_data);
78 Dictionary _get_data() const;
79
80protected:
81 static void _bind_methods();
82
83public:
84 void setup(const Vector<Vector2> &p_points, const Vector<int> &p_connections);
85 Vector<Vector2> find_path(const Vector2 &p_from, const Vector2 &p_to);
86
87 void set_point_penalty(int p_point, float p_penalty);
88 float get_point_penalty(int p_point) const;
89
90 bool is_point_inside(const Vector2 &p_point) const;
91 Vector2 get_closest_point(const Vector2 &p_point) const;
92 Vector<Vector2> get_intersections(const Vector2 &p_from, const Vector2 &p_to) const;
93 Rect2 get_bounds() const;
94
95 PolygonPathFinder();
96};
97
98#endif // POLYGON_PATH_FINDER_H
99