genre | Marker |
author | Ola Friman |
package | FMEwork/ReleaseMeVis |
dll | MLXMarkerUtils |
definition | MLXMarkerUtils.def |
see also | TravelingSalesman |
keywords | dijkstra, marker, xmarker, shortest, optimal, path, route |
The module XMarkerShortestPath performs a Dijsktra shortest path search on a graph where the vertices are defined by the XMarkers in an XMarkerList.
The XMarkers in the input XMarkerList are used as vertices in a graph. The vertices are connected with edges if the spatial distances between the corresponding XMarkers lie between the max and min connection distances.
A weight equal to the squared spatial distance between the corresponding XMarkers is attached to each edge. The squared distance is chosen as weight to favor jumps between neighboring XMarkers and discourage larger jumps (i.e., it becomes cheaper to take two smaller steps than one large step).
The XMarkers closest to the given start and end points are supplied to a Dijkstra shortest path search and the output is an XMarkerList containing the XMarkers along the shortest path (ordered from start XMarker to end XMarker).
Add end point to list: Bool | Update: Trigger |
Add start point to list: Bool | |
Auto update: Bool | |
Distance Exponent: Double | |
End Point: Vector3 | |
Max Connection Distance: Float | |
Min Connection Distance: Float | |
Start Point: Vector3 |
If checked, the module computes anew on any parameter or input change.
Sets the starting point for the search for the shortest path.
Sets the ending point for the search for the shortest path.
Sets the minimum distance for computing neighboring markers.
Sets the maximum distance for computing neighboring markers.
Sets an explicit exponent for computing the distance weight.