[This is preliminary documentation and is subject to change.]
Assembly: cai-nav (in cai-nav.dll) Version: 0.4.0.0 (0.4.0.0)
|C#||Visual Basic||Visual C++|
The center point to start from which to start the search. (Must be valid.)
The radius of the search circle.
The filter to apply to the query.
The references of the polygons touched by the circle. [(polyRef) * resultCount] (Optional)
The references of the parent polygons for each result. Zero if a result polygon has no parent. [(parentRef) * resultCount] (Optional)
The number of polygons found.
Return ValueThe NavStatus flags for the query.
This method is optimized for a small query radius and small number of result polygons.
The order of the result is from least to highest cost.
At least one result buffer must be provided.
The primary use case for this method is for performing Dijkstra searches. Candidate polygons are found by searching the graph beginning at the start polygon.
The same intersection test restrictions that apply to the FindPoly methods apply to this method.
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 effect 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 effect intersection tests.
If the buffers are is too small to hold the entire result, they will be filled to capacity.