nav_region.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299
  1. /**************************************************************************/
  2. /* nav_region.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. #include "nav_region.h"
  31. #include "nav_map.h"
  32. void NavRegion::set_map(NavMap *p_map) {
  33. if (map == p_map) {
  34. return;
  35. }
  36. if (map) {
  37. map->remove_region(this);
  38. }
  39. map = p_map;
  40. polygons_dirty = true;
  41. connections.clear();
  42. if (map) {
  43. map->add_region(this);
  44. }
  45. }
  46. void NavRegion::set_enabled(bool p_enabled) {
  47. if (enabled == p_enabled) {
  48. return;
  49. }
  50. enabled = p_enabled;
  51. // TODO: This should not require a full rebuild as the region has not really changed.
  52. polygons_dirty = true;
  53. };
  54. void NavRegion::set_use_edge_connections(bool p_enabled) {
  55. if (use_edge_connections != p_enabled) {
  56. use_edge_connections = p_enabled;
  57. polygons_dirty = true;
  58. }
  59. }
  60. void NavRegion::set_transform(Transform3D p_transform) {
  61. if (transform == p_transform) {
  62. return;
  63. }
  64. transform = p_transform;
  65. polygons_dirty = true;
  66. #ifdef DEBUG_ENABLED
  67. if (map && Math::rad_to_deg(map->get_up().angle_to(transform.basis.get_column(1))) >= 90.0f) {
  68. ERR_PRINT_ONCE("Attempted to update a navigation region transform rotated 90 degrees or more away from the current navigation map UP orientation.");
  69. }
  70. #endif // DEBUG_ENABLED
  71. }
  72. void NavRegion::set_navigation_mesh(Ref<NavigationMesh> p_navigation_mesh) {
  73. #ifdef DEBUG_ENABLED
  74. if (map && p_navigation_mesh.is_valid() && !Math::is_equal_approx(double(map->get_cell_size()), double(p_navigation_mesh->get_cell_size()))) {
  75. ERR_PRINT_ONCE(vformat("Attempted to update a navigation region with a navigation mesh that uses a `cell_size` of %s while assigned to a navigation map set to a `cell_size` of %s. The cell size for navigation maps can be changed by using the NavigationServer map_set_cell_size() function. The cell size for default navigation maps can also be changed in the ProjectSettings.", double(p_navigation_mesh->get_cell_size()), double(map->get_cell_size())));
  76. }
  77. if (map && p_navigation_mesh.is_valid() && !Math::is_equal_approx(double(map->get_cell_height()), double(p_navigation_mesh->get_cell_height()))) {
  78. ERR_PRINT_ONCE(vformat("Attempted to update a navigation region with a navigation mesh that uses a `cell_height` of %s while assigned to a navigation map set to a `cell_height` of %s. The cell height for navigation maps can be changed by using the NavigationServer map_set_cell_height() function. The cell height for default navigation maps can also be changed in the ProjectSettings.", double(p_navigation_mesh->get_cell_height()), double(map->get_cell_height())));
  79. }
  80. #endif // DEBUG_ENABLED
  81. RWLockWrite write_lock(navmesh_rwlock);
  82. pending_navmesh_vertices.clear();
  83. pending_navmesh_polygons.clear();
  84. if (p_navigation_mesh.is_valid()) {
  85. p_navigation_mesh->get_data(pending_navmesh_vertices, pending_navmesh_polygons);
  86. }
  87. polygons_dirty = true;
  88. }
  89. int NavRegion::get_connections_count() const {
  90. if (!map) {
  91. return 0;
  92. }
  93. return connections.size();
  94. }
  95. Vector3 NavRegion::get_connection_pathway_start(int p_connection_id) const {
  96. ERR_FAIL_NULL_V(map, Vector3());
  97. ERR_FAIL_INDEX_V(p_connection_id, connections.size(), Vector3());
  98. return connections[p_connection_id].pathway_start;
  99. }
  100. Vector3 NavRegion::get_connection_pathway_end(int p_connection_id) const {
  101. ERR_FAIL_NULL_V(map, Vector3());
  102. ERR_FAIL_INDEX_V(p_connection_id, connections.size(), Vector3());
  103. return connections[p_connection_id].pathway_end;
  104. }
  105. Vector3 NavRegion::get_random_point(uint32_t p_navigation_layers, bool p_uniformly) const {
  106. if (!get_enabled()) {
  107. return Vector3();
  108. }
  109. const LocalVector<gd::Polygon> &region_polygons = get_polygons();
  110. if (region_polygons.is_empty()) {
  111. return Vector3();
  112. }
  113. if (p_uniformly) {
  114. real_t accumulated_area = 0;
  115. RBMap<real_t, uint32_t> region_area_map;
  116. for (uint32_t rp_index = 0; rp_index < region_polygons.size(); rp_index++) {
  117. const gd::Polygon &region_polygon = region_polygons[rp_index];
  118. real_t polyon_area = region_polygon.surface_area;
  119. if (polyon_area == 0.0) {
  120. continue;
  121. }
  122. region_area_map[accumulated_area] = rp_index;
  123. accumulated_area += polyon_area;
  124. }
  125. if (region_area_map.is_empty() || accumulated_area == 0) {
  126. // All polygons have no real surface / no area.
  127. return Vector3();
  128. }
  129. real_t region_area_map_pos = Math::random(real_t(0), accumulated_area);
  130. RBMap<real_t, uint32_t>::Iterator region_E = region_area_map.find_closest(region_area_map_pos);
  131. ERR_FAIL_COND_V(!region_E, Vector3());
  132. uint32_t rrp_polygon_index = region_E->value;
  133. ERR_FAIL_UNSIGNED_INDEX_V(rrp_polygon_index, region_polygons.size(), Vector3());
  134. const gd::Polygon &rr_polygon = region_polygons[rrp_polygon_index];
  135. real_t accumulated_polygon_area = 0;
  136. RBMap<real_t, uint32_t> polygon_area_map;
  137. for (uint32_t rpp_index = 2; rpp_index < rr_polygon.points.size(); rpp_index++) {
  138. real_t face_area = Face3(rr_polygon.points[0].pos, rr_polygon.points[rpp_index - 1].pos, rr_polygon.points[rpp_index].pos).get_area();
  139. if (face_area == 0.0) {
  140. continue;
  141. }
  142. polygon_area_map[accumulated_polygon_area] = rpp_index;
  143. accumulated_polygon_area += face_area;
  144. }
  145. if (polygon_area_map.is_empty() || accumulated_polygon_area == 0) {
  146. // All faces have no real surface / no area.
  147. return Vector3();
  148. }
  149. real_t polygon_area_map_pos = Math::random(real_t(0), accumulated_polygon_area);
  150. RBMap<real_t, uint32_t>::Iterator polygon_E = polygon_area_map.find_closest(polygon_area_map_pos);
  151. ERR_FAIL_COND_V(!polygon_E, Vector3());
  152. uint32_t rrp_face_index = polygon_E->value;
  153. ERR_FAIL_UNSIGNED_INDEX_V(rrp_face_index, rr_polygon.points.size(), Vector3());
  154. const Face3 face(rr_polygon.points[0].pos, rr_polygon.points[rrp_face_index - 1].pos, rr_polygon.points[rrp_face_index].pos);
  155. Vector3 face_random_position = face.get_random_point_inside();
  156. return face_random_position;
  157. } else {
  158. uint32_t rrp_polygon_index = Math::random(int(0), region_polygons.size() - 1);
  159. const gd::Polygon &rr_polygon = region_polygons[rrp_polygon_index];
  160. uint32_t rrp_face_index = Math::random(int(2), rr_polygon.points.size() - 1);
  161. const Face3 face(rr_polygon.points[0].pos, rr_polygon.points[rrp_face_index - 1].pos, rr_polygon.points[rrp_face_index].pos);
  162. Vector3 face_random_position = face.get_random_point_inside();
  163. return face_random_position;
  164. }
  165. }
  166. bool NavRegion::sync() {
  167. bool something_changed = polygons_dirty /* || something_dirty? */;
  168. update_polygons();
  169. return something_changed;
  170. }
  171. void NavRegion::update_polygons() {
  172. if (!polygons_dirty) {
  173. return;
  174. }
  175. polygons.clear();
  176. surface_area = 0.0;
  177. polygons_dirty = false;
  178. if (map == nullptr) {
  179. return;
  180. }
  181. RWLockRead read_lock(navmesh_rwlock);
  182. if (pending_navmesh_vertices.is_empty() || pending_navmesh_polygons.is_empty()) {
  183. return;
  184. }
  185. int len = pending_navmesh_vertices.size();
  186. if (len == 0) {
  187. return;
  188. }
  189. const Vector3 *vertices_r = pending_navmesh_vertices.ptr();
  190. polygons.resize(pending_navmesh_polygons.size());
  191. real_t _new_region_surface_area = 0.0;
  192. // Build
  193. int navigation_mesh_polygon_index = 0;
  194. for (gd::Polygon &polygon : polygons) {
  195. polygon.owner = this;
  196. polygon.surface_area = 0.0;
  197. Vector<int> navigation_mesh_polygon = pending_navmesh_polygons[navigation_mesh_polygon_index];
  198. navigation_mesh_polygon_index += 1;
  199. int navigation_mesh_polygon_size = navigation_mesh_polygon.size();
  200. if (navigation_mesh_polygon_size < 3) {
  201. continue;
  202. }
  203. const int *indices = navigation_mesh_polygon.ptr();
  204. bool valid(true);
  205. polygon.points.resize(navigation_mesh_polygon_size);
  206. polygon.edges.resize(navigation_mesh_polygon_size);
  207. real_t _new_polygon_surface_area = 0.0;
  208. for (int j(2); j < navigation_mesh_polygon_size; j++) {
  209. const Face3 face = Face3(
  210. transform.xform(vertices_r[indices[0]]),
  211. transform.xform(vertices_r[indices[j - 1]]),
  212. transform.xform(vertices_r[indices[j]]));
  213. _new_polygon_surface_area += face.get_area();
  214. }
  215. polygon.surface_area = _new_polygon_surface_area;
  216. _new_region_surface_area += _new_polygon_surface_area;
  217. for (int j(0); j < navigation_mesh_polygon_size; j++) {
  218. int idx = indices[j];
  219. if (idx < 0 || idx >= len) {
  220. valid = false;
  221. break;
  222. }
  223. Vector3 point_position = transform.xform(vertices_r[idx]);
  224. polygon.points[j].pos = point_position;
  225. polygon.points[j].key = map->get_point_key(point_position);
  226. }
  227. if (!valid) {
  228. ERR_BREAK_MSG(!valid, "The navigation mesh set in this region is not valid!");
  229. }
  230. }
  231. surface_area = _new_region_surface_area;
  232. }