Package com.here.platform.location.core.mapmatching

Class SimpleConnectivityTransitionProbabilityStrategy<O,V,E>

java.lang.Object
com.here.platform.location.core.mapmatching.internal.TransitionProbabilityStrategyBase<O,V,NoTransition>
com.here.platform.location.core.mapmatching.SimpleConnectivityTransitionProbabilityStrategy<O,V,E>
All Implemented Interfaces:
com.here.platform.location.core.mapmatching.TransitionProbabilityStrategy<O,V,NoTransition>
public class SimpleConnectivityTransitionProbabilityStrategy<O,V,E> extends com.here.platform.location.core.mapmatching.internal.TransitionProbabilityStrategyBase<O,V,NoTransition>
Deprecated.
Please use DistanceTransitionProbabilityStrategy. Since SDK 2.48.
A simplistic implementation to compute transition probabilities for dense probe points.

Computes a transition probability by classifying the connectivity between road segments using a topology graph. Each case is associated with a constant value for the transition probability.

This class distinguishes three cases: - SameVertex: The two segments are the same - Neighboring: The two segments are directly connected - Distant/Disconnected: The two segments are not directly connected

param: graph The graph representing road topology param: probabilityParameters The probability values for each of the known cases

Note:
Although it produces reasonable results when the map data and the probe data are of high quality, this is not meant for implementing a general purpose map matcher.