can find a shortest route between points by using the generated routing points as supporting points for its route search.
public class CartesianRoutingService<TObstacle> : object where TObstacle : IObstacle
CartesianRoutingService(BoundingBox, IDictionary<TObstacle, Geometry>, IRoutingPointsGenerator, Int32)
Creates the routing service.
public CartesianRoutingService(BoundingBox boundingBox, IDictionary<TObstacle, Geometry> obstacles, IRoutingPointsGenerator pointsGenerator, int edgesPerNode = 10)
|BoundingBox||boundingBox||Describes the spatial extent.|
|IDictionary<TObstacle, Geometry>||obstacles||Holds all obstacles that may influence the route.|
|IRoutingPointsGenerator||pointsGenerator||Generates supporting points for the route searching graph.|
|System.Int32||edgesPerNode||Defines the density of the route searching graph.|
Finds a route of routing positions from start to goal.
public IEnumerable<Position> FindRoute(ICharacter character, Position goal)
|ICharacter||character||The characters position is used as start point for the route search. The start point is not included in the result. The character might be used to check if obstacles can be passed.|
|Position||goal||Goal position for the route search. Is included in the result.|
|IEnumerable<Position>||An enumerable of positions that lead to the goal avoiding collisions with geometries.|
public string ToGeoJson()