Package eu.iv4xr.framework.extensions.pathfinding
package eu.iv4xr.framework.extensions.pathfinding
This package provides classes to do pathfinding over a graph. It contains
classes such as:
-
AStar
implementing the A* graph-pathfinding algorithm. The target graph can be anything that implement theNavigatable
interface. -
Navigatable
is an interface for defining a graph that is searchable by the pathfinder(s) provided by this package. -
SimpleNavGraph
is an implementation ofNavigatable
that facilitates pathfinding over a surface defined by a surface-mesh. -
SurfaceNavGraph
is an extension ofSimpleNavGraph
that additionally provides support for surface exploration.
-
InterfaceDescriptionCanDealWithDynamicObstacle<Obstacle>A feature of a navigation graph that allows obstacles to be added.Navigatable<NodeId>Describes a graph-like structure that can be navigated by a pathfinder.Pathfinder<NodeId>Common interface for pathfinding.Pathfinder2<NodeId>Just another interface for a graph-based pathfinder as an alternative to
Pathfinder
.XPathfinder<NodeId>Extension of a graph-basedPathfinder2
that also provides methods supporting exploration over the represented navigation graph. -
ClassDescriptionAStar<NodeId>A* pathfinding algorithmLayeredAreasNavigation<NodeId,Nav extends XPathfinder<NodeId> & CanDealWithDynamicObstacle<NodeId>>Support navigation over multiple areas, linearly stacked in layers.Priotisable<T>Wraps around a type to add a float value on which can be sorted.This class is provides an implementation of a navigation graph (an instance of
Navigatable
) that facilitates pathfinding over a 3D-surface defined by a surface-mesh with obstacles.Representing a navigation graph over a 2D tiled-world.A navigation-graph over a 3D-surface. -
EnumDescriptionA vertex is a BORDER-vertex if it lies in a border-edge.