Namespace Mars.Components.Environments.Cartesian.Routing

Classes

CartesianRoutingService<TObstacle>

The

CartesianRoutingService

can find a shortest route between points by using the generated routing points as supporting points for its route search.

GeometryCoordinatesRoutingPointsGenerator

Finds routing points that are close to every geometry coordinate but not intersecting with the geometry and only within the envelope.

HomogenousRoutingPointsGenerator

Creates evenly distributed points within the defined envelope.

RandomRoutingPointsGenerator

Randomly generates points within the geometry envelope and discards those that intersect with the geometries.

SectionalRandomRoutingPointsGenerator

Interfaces

IRoutingPointsGenerator

To efficiently find a route within a cartesian area, we need routing points of a mesh to build a graph for the route search.