Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
godotengine
GitHub Repository: godotengine/godot
Path: blob/master/modules/navigation_3d/3d/nav_region_builder_3d.cpp
10278 views
1
/**************************************************************************/
2
/* nav_region_builder_3d.cpp */
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
#include "nav_region_builder_3d.h"
32
33
#include "../nav_map_3d.h"
34
#include "../nav_region_3d.h"
35
#include "nav_region_iteration_3d.h"
36
37
using namespace Nav3D;
38
39
void NavRegionBuilder3D::build_iteration(NavRegionIterationBuild3D &r_build) {
40
PerformanceData &performance_data = r_build.performance_data;
41
42
performance_data.pm_polygon_count = 0;
43
performance_data.pm_edge_count = 0;
44
performance_data.pm_edge_merge_count = 0;
45
performance_data.pm_edge_connection_count = 0;
46
performance_data.pm_edge_free_count = 0;
47
48
_build_step_process_navmesh_data(r_build);
49
50
_build_step_find_edge_connection_pairs(r_build);
51
52
_build_step_merge_edge_connection_pairs(r_build);
53
54
_build_update_iteration(r_build);
55
}
56
57
void NavRegionBuilder3D::_build_step_process_navmesh_data(NavRegionIterationBuild3D &r_build) {
58
Vector<Vector3> _navmesh_vertices = r_build.navmesh_data.vertices;
59
Vector<Vector<int>> _navmesh_polygons = r_build.navmesh_data.polygons;
60
61
if (_navmesh_vertices.is_empty() || _navmesh_polygons.is_empty()) {
62
return;
63
}
64
65
PerformanceData &performance_data = r_build.performance_data;
66
Ref<NavRegionIteration3D> region_iteration = r_build.region_iteration;
67
68
const Transform3D &region_transform = region_iteration->transform;
69
LocalVector<Nav3D::Polygon> &navmesh_polygons = region_iteration->navmesh_polygons;
70
71
const int vertex_count = _navmesh_vertices.size();
72
73
const Vector3 *vertices_ptr = _navmesh_vertices.ptr();
74
const Vector<int> *polygons_ptr = _navmesh_polygons.ptr();
75
76
navmesh_polygons.resize(_navmesh_polygons.size());
77
78
real_t _new_region_surface_area = 0.0;
79
AABB _new_region_bounds;
80
81
bool first_vertex = true;
82
83
for (uint32_t i = 0; i < navmesh_polygons.size(); i++) {
84
Polygon &polygon = navmesh_polygons[i];
85
polygon.id = i;
86
polygon.owner = region_iteration.ptr();
87
polygon.surface_area = 0.0;
88
89
Vector<int> polygon_indices = polygons_ptr[i];
90
91
int polygon_size = polygon_indices.size();
92
if (polygon_size < 3) {
93
continue;
94
}
95
96
const int *indices_ptr = polygon_indices.ptr();
97
98
bool polygon_valid = true;
99
100
polygon.vertices.resize(polygon_size);
101
102
{
103
real_t _new_polygon_surface_area = 0.0;
104
105
for (int j(2); j < polygon_size; j++) {
106
const Face3 face = Face3(
107
region_transform.xform(vertices_ptr[indices_ptr[0]]),
108
region_transform.xform(vertices_ptr[indices_ptr[j - 1]]),
109
region_transform.xform(vertices_ptr[indices_ptr[j]]));
110
111
_new_polygon_surface_area += face.get_area();
112
}
113
114
polygon.surface_area = _new_polygon_surface_area;
115
_new_region_surface_area += _new_polygon_surface_area;
116
}
117
118
for (int j(0); j < polygon_size; j++) {
119
int vertex_index = indices_ptr[j];
120
if (vertex_index < 0 || vertex_index >= vertex_count) {
121
polygon_valid = false;
122
break;
123
}
124
125
const Vector3 point_position = region_transform.xform(vertices_ptr[vertex_index]);
126
polygon.vertices[j] = point_position;
127
128
if (first_vertex) {
129
first_vertex = false;
130
_new_region_bounds.position = point_position;
131
} else {
132
_new_region_bounds.expand_to(point_position);
133
}
134
}
135
136
if (!polygon_valid) {
137
polygon.surface_area = 0.0;
138
polygon.vertices.clear();
139
ERR_FAIL_COND_MSG(!polygon_valid, "Corrupted navigation mesh set on region. The indices of a polygon are out of range.");
140
}
141
}
142
143
region_iteration->surface_area = _new_region_surface_area;
144
region_iteration->bounds = _new_region_bounds;
145
146
performance_data.pm_polygon_count = navmesh_polygons.size();
147
}
148
149
Nav3D::PointKey NavRegionBuilder3D::get_point_key(const Vector3 &p_pos, const Vector3 &p_cell_size) {
150
const int x = static_cast<int>(Math::floor(p_pos.x / p_cell_size.x));
151
const int y = static_cast<int>(Math::floor(p_pos.y / p_cell_size.y));
152
const int z = static_cast<int>(Math::floor(p_pos.z / p_cell_size.z));
153
154
PointKey p;
155
p.key = 0;
156
p.x = x;
157
p.y = y;
158
p.z = z;
159
return p;
160
}
161
162
Nav3D::EdgeKey NavRegionBuilder3D::get_edge_key(const Vector3 &p_vertex1, const Vector3 &p_vertex2, const Vector3 &p_cell_size) {
163
EdgeKey ek(get_point_key(p_vertex1, p_cell_size), get_point_key(p_vertex2, p_cell_size));
164
return ek;
165
}
166
167
void NavRegionBuilder3D::_build_step_find_edge_connection_pairs(NavRegionIterationBuild3D &r_build) {
168
PerformanceData &performance_data = r_build.performance_data;
169
170
const Vector3 &map_cell_size = r_build.map_cell_size;
171
Ref<NavRegionIteration3D> region_iteration = r_build.region_iteration;
172
LocalVector<Nav3D::Polygon> &navmesh_polygons = region_iteration->navmesh_polygons;
173
174
HashMap<EdgeKey, EdgeConnectionPair, EdgeKey> &connection_pairs_map = r_build.iter_connection_pairs_map;
175
connection_pairs_map.clear();
176
177
region_iteration->internal_connections.clear();
178
region_iteration->internal_connections.resize(navmesh_polygons.size());
179
180
region_iteration->external_edges.clear();
181
182
int free_edges_count = 0;
183
184
for (Polygon &poly : region_iteration->navmesh_polygons) {
185
for (uint32_t p = 0; p < poly.vertices.size(); p++) {
186
const int next_point = (p + 1) % poly.vertices.size();
187
const EdgeKey ek = get_edge_key(poly.vertices[p], poly.vertices[next_point], map_cell_size);
188
189
HashMap<EdgeKey, EdgeConnectionPair, EdgeKey>::Iterator pair_it = connection_pairs_map.find(ek);
190
if (!pair_it) {
191
pair_it = connection_pairs_map.insert(ek, EdgeConnectionPair());
192
performance_data.pm_edge_count += 1;
193
++free_edges_count;
194
}
195
EdgeConnectionPair &pair = pair_it->value;
196
if (pair.size < 2) {
197
// Add the polygon/edge tuple to this key.
198
Connection new_connection;
199
new_connection.polygon = &poly;
200
new_connection.edge = p;
201
new_connection.pathway_start = poly.vertices[p];
202
new_connection.pathway_end = poly.vertices[next_point];
203
204
pair.connections[pair.size] = new_connection;
205
++pair.size;
206
if (pair.size == 2) {
207
--free_edges_count;
208
}
209
210
} else {
211
// The edge is already connected with another edge, skip.
212
ERR_FAIL_COND_MSG(pair.size >= 2, "Navigation region synchronization error. More than 2 edges tried to occupy the same map rasterization space. This is a logical error in the navigation mesh caused by overlap or too densely placed edges.");
213
}
214
}
215
}
216
217
performance_data.pm_edge_free_count = free_edges_count;
218
}
219
220
void NavRegionBuilder3D::_build_step_merge_edge_connection_pairs(NavRegionIterationBuild3D &r_build) {
221
PerformanceData &performance_data = r_build.performance_data;
222
223
Ref<NavRegionIteration3D> region_iteration = r_build.region_iteration;
224
225
HashMap<EdgeKey, EdgeConnectionPair, EdgeKey> &connection_pairs_map = r_build.iter_connection_pairs_map;
226
227
for (const KeyValue<EdgeKey, EdgeConnectionPair> &pair_it : connection_pairs_map) {
228
const EdgeConnectionPair &pair = pair_it.value;
229
if (pair.size == 2) {
230
// Connect edge that are shared in different polygons.
231
const Connection &c1 = pair.connections[0];
232
const Connection &c2 = pair.connections[1];
233
region_iteration->internal_connections[c1.polygon->id].push_back(c2);
234
region_iteration->internal_connections[c2.polygon->id].push_back(c1);
235
performance_data.pm_edge_merge_count += 1;
236
237
} else {
238
ERR_FAIL_COND_MSG(pair.size != 1, vformat("Number of connection != 1. Found: %d", pair.size));
239
240
const Connection &connection = pair.connections[0];
241
242
ConnectableEdge ce;
243
ce.ek = pair_it.key;
244
ce.polygon_index = connection.polygon->id;
245
ce.edge = connection.edge;
246
ce.pathway_start = connection.pathway_start;
247
ce.pathway_end = connection.pathway_end;
248
249
region_iteration->external_edges.push_back(ce);
250
}
251
}
252
}
253
254
void NavRegionBuilder3D::_build_update_iteration(NavRegionIterationBuild3D &r_build) {
255
ERR_FAIL_NULL(r_build.region);
256
// Stub. End of the build.
257
}
258
259