Path: blob/master/modules/navigation_2d/2d/nav_region_builder_2d.cpp
11353 views
/**************************************************************************/1/* nav_region_builder_2d.cpp */2/**************************************************************************/3/* This file is part of: */4/* GODOT ENGINE */5/* https://godotengine.org */6/**************************************************************************/7/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */8/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */9/* */10/* Permission is hereby granted, free of charge, to any person obtaining */11/* a copy of this software and associated documentation files (the */12/* "Software"), to deal in the Software without restriction, including */13/* without limitation the rights to use, copy, modify, merge, publish, */14/* distribute, sublicense, and/or sell copies of the Software, and to */15/* permit persons to whom the Software is furnished to do so, subject to */16/* the following conditions: */17/* */18/* The above copyright notice and this permission notice shall be */19/* included in all copies or substantial portions of the Software. */20/* */21/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */22/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */23/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */24/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */25/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */26/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */27/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */28/**************************************************************************/2930#include "nav_region_builder_2d.h"3132#include "../nav_map_2d.h"33#include "../nav_region_2d.h"34#include "../triangle2.h"35#include "nav_region_iteration_2d.h"3637#include "core/config/project_settings.h"3839using namespace Nav2D;4041void NavRegionBuilder2D::build_iteration(NavRegionIterationBuild2D &r_build) {42PerformanceData &performance_data = r_build.performance_data;4344performance_data.pm_polygon_count = 0;45performance_data.pm_edge_count = 0;46performance_data.pm_edge_merge_count = 0;47performance_data.pm_edge_connection_count = 0;48performance_data.pm_edge_free_count = 0;4950_build_step_process_navmesh_data(r_build);5152_build_step_find_edge_connection_pairs(r_build);5354_build_step_merge_edge_connection_pairs(r_build);5556_build_update_iteration(r_build);57}5859void NavRegionBuilder2D::_build_step_process_navmesh_data(NavRegionIterationBuild2D &r_build) {60Vector<Vector2> _navmesh_vertices = r_build.navmesh_data.vertices;61Vector<Vector<int>> _navmesh_polygons = r_build.navmesh_data.polygons;6263if (_navmesh_vertices.is_empty() || _navmesh_polygons.is_empty()) {64return;65}6667PerformanceData &performance_data = r_build.performance_data;68Ref<NavRegionIteration2D> region_iteration = r_build.region_iteration;6970const Transform2D ®ion_transform = region_iteration->transform;71LocalVector<Nav2D::Polygon> &navmesh_polygons = region_iteration->navmesh_polygons;7273const int vertex_count = _navmesh_vertices.size();7475const Vector2 *vertices_ptr = _navmesh_vertices.ptr();76const Vector<int> *polygons_ptr = _navmesh_polygons.ptr();7778navmesh_polygons.resize(_navmesh_polygons.size());7980real_t _new_region_surface_area = 0.0;81Rect2 _new_region_bounds;8283bool first_vertex = true;8485for (uint32_t i = 0; i < navmesh_polygons.size(); i++) {86Polygon &polygon = navmesh_polygons[i];87polygon.id = i;88polygon.owner = region_iteration.ptr();89polygon.surface_area = 0.0;9091Vector<int> polygon_indices = polygons_ptr[i];9293int polygon_size = polygon_indices.size();94if (polygon_size < 3) {95continue;96}9798const int *indices_ptr = polygon_indices.ptr();99100bool polygon_valid = true;101102polygon.vertices.resize(polygon_size);103104{105real_t _new_polygon_surface_area = 0.0;106107for (int j(2); j < polygon_size; j++) {108const Triangle2 triangle = Triangle2(109region_transform.xform(vertices_ptr[indices_ptr[0]]),110region_transform.xform(vertices_ptr[indices_ptr[j - 1]]),111region_transform.xform(vertices_ptr[indices_ptr[j]]));112113_new_polygon_surface_area += triangle.get_area();114}115116polygon.surface_area = _new_polygon_surface_area;117_new_region_surface_area += _new_polygon_surface_area;118}119120for (int j(0); j < polygon_size; j++) {121int vertex_index = indices_ptr[j];122if (vertex_index < 0 || vertex_index >= vertex_count) {123polygon_valid = false;124break;125}126127const Vector2 point_position = region_transform.xform(vertices_ptr[vertex_index]);128polygon.vertices[j] = point_position;129130if (first_vertex) {131first_vertex = false;132_new_region_bounds.position = point_position;133} else {134_new_region_bounds.expand_to(point_position);135}136}137138if (!polygon_valid) {139polygon.surface_area = 0.0;140polygon.vertices.clear();141ERR_FAIL_COND_MSG(!polygon_valid, "Corrupted navigation mesh set on region. The indices of a polygon are out of range.");142}143}144145region_iteration->surface_area = _new_region_surface_area;146region_iteration->bounds = _new_region_bounds;147148performance_data.pm_polygon_count = navmesh_polygons.size();149}150151Nav2D::PointKey NavRegionBuilder2D::get_point_key(const Vector2 &p_pos, const Vector2 &p_cell_size) {152const int x = static_cast<int>(Math::floor(p_pos.x / p_cell_size.x));153const int y = static_cast<int>(Math::floor(p_pos.y / p_cell_size.y));154155PointKey p;156p.key = 0;157p.x = x;158p.y = y;159return p;160}161162Nav2D::EdgeKey NavRegionBuilder2D::get_edge_key(const Vector2 &p_vertex1, const Vector2 &p_vertex2, const Vector2 &p_cell_size) {163EdgeKey ek(get_point_key(p_vertex1, p_cell_size), get_point_key(p_vertex2, p_cell_size));164return ek;165}166167void NavRegionBuilder2D::_build_step_find_edge_connection_pairs(NavRegionIterationBuild2D &r_build) {168PerformanceData &performance_data = r_build.performance_data;169170const Vector2 &map_cell_size = r_build.map_cell_size;171Ref<NavRegionIteration2D> region_iteration = r_build.region_iteration;172LocalVector<Nav2D::Polygon> &navmesh_polygons = region_iteration->navmesh_polygons;173174HashMap<EdgeKey, EdgeConnectionPair, EdgeKey> &connection_pairs_map = r_build.iter_connection_pairs_map;175connection_pairs_map.clear();176177region_iteration->internal_connections.clear();178region_iteration->internal_connections.resize(navmesh_polygons.size());179180region_iteration->external_edges.clear();181182int free_edges_count = 0;183int edge_merge_error_count = 0;184185for (Polygon &poly : region_iteration->navmesh_polygons) {186for (uint32_t p = 0; p < poly.vertices.size(); p++) {187const int next_point = (p + 1) % poly.vertices.size();188const EdgeKey ek = get_edge_key(poly.vertices[p], poly.vertices[next_point], map_cell_size);189190HashMap<EdgeKey, EdgeConnectionPair, EdgeKey>::Iterator pair_it = connection_pairs_map.find(ek);191if (!pair_it) {192pair_it = connection_pairs_map.insert(ek, EdgeConnectionPair());193performance_data.pm_edge_count += 1;194++free_edges_count;195}196EdgeConnectionPair &pair = pair_it->value;197if (pair.size < 2) {198// Add the polygon/edge tuple to this key.199Connection new_connection;200new_connection.polygon = &poly;201new_connection.edge = p;202new_connection.pathway_start = poly.vertices[p];203new_connection.pathway_end = poly.vertices[next_point];204205pair.connections[pair.size] = new_connection;206++pair.size;207if (pair.size == 2) {208--free_edges_count;209}210211} else {212// The edge is already connected with another edge, skip.213edge_merge_error_count++;214}215}216}217218if (edge_merge_error_count > 0 && GLOBAL_GET_CACHED(bool, "navigation/2d/warnings/navmesh_edge_merge_errors")) {219WARN_PRINT("Navigation region synchronization had " + itos(edge_merge_error_count) + " edge error(s).\nMore than 2 edges tried to occupy the same map rasterization space.\nThis causes a logical error in the navigation mesh geometry and is commonly caused by overlap or too densely placed edges.\nConsider baking with a higher 'cell_size', greater geometry margin, and less detailed bake objects to cause fewer edges.\nConsider lowering the 'navigation/2d/merge_rasterizer_cell_scale' in the project settings.\nThis warning can be toggled under 'navigation/2d/warnings/navmesh_edge_merge_errors' in the project settings.");220}221222performance_data.pm_edge_free_count = free_edges_count;223}224225void NavRegionBuilder2D::_build_step_merge_edge_connection_pairs(NavRegionIterationBuild2D &r_build) {226PerformanceData &performance_data = r_build.performance_data;227228Ref<NavRegionIteration2D> region_iteration = r_build.region_iteration;229230HashMap<EdgeKey, EdgeConnectionPair, EdgeKey> &connection_pairs_map = r_build.iter_connection_pairs_map;231232for (const KeyValue<EdgeKey, EdgeConnectionPair> &pair_it : connection_pairs_map) {233const EdgeConnectionPair &pair = pair_it.value;234if (pair.size == 2) {235// Connect edge that are shared in different polygons.236const Connection &c1 = pair.connections[0];237const Connection &c2 = pair.connections[1];238region_iteration->internal_connections[c1.polygon->id].push_back(c2);239region_iteration->internal_connections[c2.polygon->id].push_back(c1);240performance_data.pm_edge_merge_count += 1;241242} else {243ERR_FAIL_COND_MSG(pair.size != 1, vformat("Number of connection != 1. Found: %d", pair.size));244245const Connection &connection = pair.connections[0];246247ConnectableEdge ce;248ce.ek = pair_it.key;249ce.polygon_index = connection.polygon->id;250ce.edge = connection.edge;251ce.pathway_start = connection.pathway_start;252ce.pathway_end = connection.pathway_end;253254region_iteration->external_edges.push_back(ce);255}256}257}258259void NavRegionBuilder2D::_build_update_iteration(NavRegionIterationBuild2D &r_build) {260ERR_FAIL_NULL(r_build.region);261// Stub. End of the build.262}263264265