Uses of Class
com.irurueta.navigation.lateration.RobustLaterationSolver

Packages that use RobustLaterationSolver

Package	Description
com.irurueta.navigation.lateration	Contains classes to estimate positions when intersecting circles or spheres by using the lateration algorithm.

Uses of RobustLaterationSolver in com.irurueta.navigation.lateration

Subclasses of RobustLaterationSolver in com.irurueta.navigation.lateration

Modifier and Type	Class	Description
class	LMedSRobustLateration2DSolver	Robustly solves the lateration problem by finding the best pairs of 2D positions and distances among the provided ones using LMedS algorithm to discard outliers.
class	LMedSRobustLateration3DSolver	Robustly solves the lateration problem by finding the best pairs of 3D positions and distances among the provided ones using LMedS algorithm to discard outliers.
class	MSACRobustLateration2DSolver	Robustly solves the lateration problem by finding the best pairs of 2D positions and distances among the provided ones using MSAC algorithm to discard outliers.
class	MSACRobustLateration3DSolver	Robustly solves the lateration problem by finding the best pairs of 3D positions and distances among the provided ones using MSAC algorithm to discard outliers.
class	PROMedSRobustLateration2DSolver	Robustly solves the lateration problem by finding the best pairs of 2D positions and distances among the provided ones using PROMedS algorithm to discard outliers.
class	PROMedSRobustLateration3DSolver	Robustly solves the lateration problem by finding the best pairs of 3D positions and distances among the provided ones using PROMedS algorithm to discard outliers.
class	PROSACRobustLateration2DSolver	Robustly solves the lateration problem by finding the best pairs of 2D positions and distances among the provided ones using PROSAC algorithm to discard outliers.
class	PROSACRobustLateration3DSolver	Robustly solves the lateration problem by finding the best pairs of 3D positions and distances among the provided ones using PROSAC algorithm to discard outliers.
class	RANSACRobustLateration2DSolver	Robustly solves the lateration problem by finding the best pairs of 2D positions and distances among the provided ones using RANSAC algorithm to discard outliers.
class	RANSACRobustLateration3DSolver	Robustly solves the lateration problem by finding the best pairs of 3D positions and distances among the provided ones using RANSAC algorithm to discard outliers.
class	RobustLateration2DSolver	This is an abstract class to robustly solve the lateration problem by finding the best pairs of 2D positions and distances among the provided ones.
class	RobustLateration3DSolver	This is an abstract class to robustly solve the lateration problem by finding the best pairs of 3D positions and distances among the provided ones.

Methods in com.irurueta.navigation.lateration with parameters of type RobustLaterationSolver

Modifier and Type	Method	Description
void	RobustLaterationSolverListener.onSolveEnd(RobustLaterationSolver<P> solver)	Called when solving ends.
void	RobustLaterationSolverListener.onSolveNextIteration(RobustLaterationSolver<P> solver, int iteration)	Called when solver iterates to refine a possible solution.
void	RobustLaterationSolverListener.onSolveProgressChange(RobustLaterationSolver<P> solver, float progress)	Called when solving progress changes significantly.
void	RobustLaterationSolverListener.onSolveStart(RobustLaterationSolver<P> solver)	Called when solving starts.