godotengine/godot
1
0
Fork 0
mirror of https://github.com/godotengine/godot.git synced 2025-11-22 15:06:45 +00:00
Code Releases Wiki Activity

Remove erroneous squared version

Browse Source
This commit is contained in:
Kiro
2025-01-23 20:11:25 +01:00
parent ce88021aa0
commit 7e9cbfbcb8
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
modules/navigation/3d/nav_mesh_queries_3d.cpp
View File

@@ -298,7 +298,7 @@ void NavMeshQueries3D::_query_task_build_path_corridor(NavMeshPathQueryTask3D &p
if ((p_navigation_layers & owner->get_navigation_layers()) != 0) { if ((p_navigation_layers & owner->get_navigation_layers()) != 0) {
Vector3 pathway[2] = { connection.pathway_start, connection.pathway_end }; Vector3 pathway[2] = { connection.pathway_start, connection.pathway_end };
const Vector3 new_entry = Geometry3D::get_closest_point_to_segment(least_cost_poly.entry, pathway); const Vector3 new_entry = Geometry3D::get_closest_point_to_segment(least_cost_poly.entry, pathway);
const real_t new_traveled_distance = least_cost_poly.entry.distance_squared_to(new_entry) * poly_travel_cost + poly_enter_cost + least_cost_poly.traveled_distance; const real_t new_traveled_distance = least_cost_poly.entry.distance_to(new_entry) * poly_travel_cost + poly_enter_cost + least_cost_poly.traveled_distance;
// Check if the neighbor polygon has already been processed. // Check if the neighbor polygon has already been processed.
gd::NavigationPoly &neighbor_poly = navigation_polys[connection.polygon->id]; gd::NavigationPoly &neighbor_poly = navigation_polys[connection.polygon->id];
@@ -310,7 +310,7 @@ void NavMeshQueries3D::_query_task_build_path_corridor(NavMeshPathQueryTask3D &p
neighbor_poly.back_navigation_edge_pathway_end = connection.pathway_end; neighbor_poly.back_navigation_edge_pathway_end = connection.pathway_end;
neighbor_poly.traveled_distance = new_traveled_distance; neighbor_poly.traveled_distance = new_traveled_distance;
neighbor_poly.distance_to_destination = neighbor_poly.distance_to_destination =
new_entry.distance_squared_to(end_point) * new_entry.distance_to(end_point) *
owner->get_travel_cost(); owner->get_travel_cost();
neighbor_poly.entry = new_entry; neighbor_poly.entry = new_entry;