Package com.irurueta.navigation.lateration
package com.irurueta.navigation.lateration
Contains classes to estimate positions when intersecting circles or spheres by using the lateration algorithm.
-
ClassDescriptionLinearly solves the lateration problem using an homogeneous LMSE solution.Linearly solves the lateration problem using an homogeneous LMSE solution.HomogeneousLinearLeastSquaresLaterationSolver<P extends com.irurueta.geometry.Point<?>>Linearly solves the lateration problem using an homogeneous LMSE solution.Linearly solves the lateration problem using an inhomogeneous solution.Linearly solves the lateration problem.InhomogeneousLinearLeastSquaresLaterationSolver<P extends com.irurueta.geometry.Point<P>>Linearly solves the lateration problem using an inhomogeneous solution.Exception raised if lateration fails.LaterationSolver<P extends com.irurueta.geometry.Point<?>>Solves the lateration problem.LaterationSolverListener<P extends com.irurueta.geometry.Point<?>>Listener to be notified of events such as when lateration solving starts or ends.Trilateration solver type.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.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.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.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.Solves a Trilateration problem with an instance of the least squares optimizer.Solves a Trilateration problem with an instance of the least squares optimizer.NonLinearLeastSquaresLaterationSolver<P extends com.irurueta.geometry.Point<?>>Solves a Trilateration problem with an instance of the least squares optimizer.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.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.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.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.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.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.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.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.RobustLaterationSolver<P extends com.irurueta.geometry.Point<?>>This is an abstract class to robustly solve the lateration problem by finding the best pairs of positions and distances among the provided ones.RobustLaterationSolverListener<P extends com.irurueta.geometry.Point<?>>Listener to be notified of events produced by a robust lateration solver when solving starts, ends or when progress changes.