Finds all polygons within a radius of a center position, avoiding overlapping polygons.
This method is optimized for a small search radius and small number of result polygons.
Candidate polygons are found by searching the navigation graph beginning at the start polygon.
The value of the center point is used as the start point for cost calculations.
It is not projected onto the surface of the mesh, so its y-value will affect the costs.
Intersection tests occur in 2D. All polygons and the search circle are projected onto
the xz-plane. So the y-value of the center point does not affect intersection tests.
Finds all polygons within a radius of a center position, avoiding overlapping polygons.
This method is optimized for a small search radius and small number of result polygons. Candidate polygons are found by searching the navigation graph beginning at the start polygon.
The value of the center point is used as the start point for cost calculations. It is not projected onto the surface of the mesh, so its y-value will affect the costs.
Intersection tests occur in 2D. All polygons and the search circle are projected onto the xz-plane. So the y-value of the center point does not affect intersection tests.