All Classes and Interfaces

Class
Description
Base class representing the confidence of provided accuracy from a covariance matrix expressed in the distance unit of such matrix.
Contains methods to convert covariance matrices into ellipses representing accuracy with requested confidence.
Contains methods to convert covariance matrices into ellipsoids representing accuracy with requested confidence.
This class defines additional parameters that can be defined on affine 2D transformations.
This class defines additional parameters that can be defined on affine 3D transformations.
This class performs affine transformations on 2D space.
Base class for AffineTransformation2D refiner.
This is an abstract class for algorithms to robustly find the best affine 2D transformation for collections of matching 2D points, or 2D lines.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class performs affine transformations on 3D space.
Base class for AffineTransformation3D refiner.
This is an abstract class for algorithms to robustly find the best affine 3D transformation for collections of matching 3D points, or 3D planes.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class defines the amount of rotation for 3D points or planes.
Class defining the base interface of any possible conic.
Class defining the base interface of any possible quadric.
Abstract representation of a box for a point in an n-dimensional representation.
This class defines a 2D rectangular area aligned with the horizontal and vertical axes.
This class defines a 3D box area aligned with x, y, z axes.
Contains build data of this library.
A camera defines relations between 3D and 2D worlds.
Raised when an error occurs while using a camera.
Enumeration indicating camera type.
This class defines a circle.
This is an abstract class for algorithms to robustly find the best circle that fits in a collection of 2D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Raised when providing lines which are assumed to be equal.
Raised when providing planes which are assumed to be equal.
Raised when providing points which are assumed to be equal.
Raised when provided points are co-linear (lay on a single line).
This class contains the implementation of a conic.
Exception raised when a conic cannot be computed.
This is an abstract class for algorithms to robustly find the best conic that fits in a collection of 2D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Enumerator that indicates the type of conic depending on the values of its inner parameters.
Enumerator that indicates the type of coordinates used to represent a point.
Raised when provided points are coplanar (lay on a single plane).
A pinhole camera refiner using line/plane correspondences and the Powell algorithm to try to decrease overall error in LMSE terms among inlier samples by taking the decomposed parameters of a pinhole camera.
A pinhole camera refiner using point correspondences and the Powell algorithm to try to decrease overall error in LMSE terms among inlier samples by taking the decomposed parameters of a pinhole camera.
This class implements an algorithm to estimate pinhole camera using the DLT algorithm and point correspondences.
Base abstract class for algorithms to robustly find the best pinhole camera for collections of matched planes and lines using DLT algorithm.
This class implements an algorithm to estimate pinhole cameras using the DLT algorithm and point correspondences.
Base abstract class for algorithms to robustly find the best pinhole camera for collections of matched 3D/2D points using DLT (Direct Linear Transform) algorithm.
This class contains implementation of a dual conic.
Exception raised when a dual-conic cannot be computed.
This is an abstract class for algorithms to robustly find the best dual conic that fits in a collection of 2D lines.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class contains implementation of a dual quadric.
Exception raised when a dual-quadric cannot be computed.
This is an abstract class for algorithms to robustly find the best dual quadric that fits in a collection of 3D planes.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class defines an ellipse.
This class defines an ellipsoid.
EPnP (Efficient Perspective-n-Point) implementation to estimate pinhole cameras from 2D/3D point correspondences.
A possible solution.
Base abstract class for algorithms to robustly find the best pinhole camera for collections of matched 3D/2D points using EPnP (Efficient Perspective-n-Point) algorithm.
This class performs Euclidean transformations on 2D space.
Estimator of a 2D Euclidean transformation based on point correspondences.
Listener to be notified of events such as when estimation starts or ends.
Refines a 2D Euclidean transformation by taking into account an initial estimation, inlier point matches and their residuals.
This is an abstract class to robustly find the best Euclidean transformation for collections of matching 2D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class performs Euclidean transformations on 3D space.
Estimator of a 3D Euclidean transformation based on point correspondences.
Listener to be notified of events such as when estimation starts or ends.
Refine a 3D Euclidean transformation by taking into account an initial estimation, inlier point matches and their residuals.
This is an abstract class to robustly find the best Euclidean transformation for collections mof matching 3D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This is the base exception class of this package.
Base exception for all exceptions in the com.irurueta.geometry package.
Subclass of Point2D defining an homogeneous 2D point.
Refines an homogeneous 2D point by taking into account an initial estimation, inlier samples and their residuals.
Subclass of Point3D defining an homogeneous 3D point.
Refines an homogeneous 3D point by taking into account an initial estimation, inlier samples and their residuals.
Subclass of Point2D defining an inhomogeneous 2D point.
Refines an inhomogeneous 2D point by taking into account an initial estimation, inlier samples and their residuals.
Subclass of Point3D defining an inhomogeneous 3D point.
Refines an inhomogeneous 3D point by taking into account an initial estimation, inlier samples and their residuals.
Refines an instance of type T by taking into account an initial estimation, inlier matches and their residuals.
Raised when provided pinhole camera intrinsic parameters matrix is not valid.
Exception raised if provided rotation matrix is not orthonormal.
Implementation of a k-D tree in an arbitrary dimension.
Contains a node of a KD Tree.
Implementation of a k-D tree in 2D.
Implementation of a k-D tree in 3D.
Line2D in R2.
This is an abstract class for algorithms to robustly find the best 2D line that passes through a collection of 2D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class defines a lines in 3D space.
A 2D affine transformation refiner using line correspondences.
This is an abstract class for algorithms to robustly find the best affine 2D transformation for collections of matching 2D lines.
A 2D projective transformation refiner using line correspondences.
This is an abstract class for algorithms to robustly find the best projective 2D transformation for collections of matching 2D lines.
This file contains abstract implementation for pinhole camera estimators based on line/plane correspondences.
Base class for a pinhole camera refiner using line/plane correspondences.
This is an abstract class for algorithms to robustly find the best pinhole camera for collections of matched lines and planes.
Finds the best circle for provided collection of 2D points using LMedS algorithm.
Finds the best conic for provided collection of 2D points using LMedS algorithm.
Finds the best pinhole camera for provided collections of matched lines and planes using LMedS algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using LMedS + DLT algorithms.
Finds the best dual conic for provided collection of 2D lines using LMedS algorithm.
Finds the best dual quadric for provided collection of 3D planes using LMedS algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using LMedS + EPnP algorithms.
Finds the best Euclidean 2D transformation for provided collections of matched 2D points using LMedS algorithm.
Finds the best Euclidean 3D transformation for provided collections of matched 3D points using LMedS algorithm.
Finds the best 2D line for provided collection of 2D points using LMedS algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D lines using LMedS algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D lines using LMedS algorithm.
Finds the best metric 2D transformation for provided collections of matched 2D points using LMedS algorithm.
Finds the best metric 3D transformation for provided collections of matched 3D points using LMedS algorithm.
Finds the best affine 3D transformation for provided collections of matched planes using LMedS algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D planes using LMedS algorithm.
Finds the best 3D plane for provided collection of 3D points using LMedS algorithm.
Finds the best 2D point for provided collection of 2D lines using RANSAC algorithm.
Finds the best 3D point for provided collection of 3D planes using LMedS algorithm
Finds the best affine 2D transformation for provided collections of matched 2D points using LMedS algorithm.
Finds the best affine 3D transformation for provided collections of matched 3D points using LMedS algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D points using LMedS algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D points using LMedS algorithm.
Finds the best quadric for provided collection of 3D points using LMedS algorithm.
Finds the best sphere for provided collection of 3D points using LMedS algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using LMedS + UPnP algorithms.
Raised when an estimator is locked.
This class defines the amount of rotation for 3D points or planes.
This class performs metric transformations on 2D space.
Estimator of a 2D metric transformation based on point correspondences.
Listener to be notified of events such as when estimation starts or ends.
Refine a 2D metric transformation by taking into account an initial estimation, inlier point matches and their residuals.
This is an abstract class to robustly find the best metric transformation for collections of matching 2D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class performs metric transformations on 3D space.
Estimator of a 3D metric transformation based on point correspondences.
Listener to be notified of events such as when estimation starts or ends.
Refines a 3D metric transformation by taking into account an initial estimation, inlier point matches and their residuals.
This is an abstract class to robustly find the best metric transformation for collections of matching 3D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Finds the best circle for provided collection of 2D points using MSAC algorithm.
Finds the best conic for provided collection of 2D points using MSAC algorithm.
Finds the best pinhole camera for provided collections of matched lines and planes using MSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using MSAC algorithm.
Finds the best dual conic for provided collection of 2D lines using MSAC algorithm.
Finds the best dual quadric for provided collection of 3D planes using MSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using MSAC + EPnP algorithms.
Finds the best Euclidean 2D transformation for provided collections of matched 2D points using MSAC algorithm.
Finds the best Euclidean 3D transformation for provided collections of matched 3D points using MSAC algorithm.
Finds the best 2D line for provided collection of 2D points using MSAC algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D lines using MSAC algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D lines using MSAC algorithm.
Finds the best metric 2D transformation for provided collections of matched 2D points using MSAC algorithm.
Finds the best metric 3D transformation for provided collections of matched 3D points using MSAC algorithm.
Finds the best affine 3D transformation for provided collections of matched planes using MSAC algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D planes using MSAC algorithm.
Finds the best 3D plane for provided collection of 3D points using MSAC algorithm.
Finds the best 2D point for provided collection of 2D lines using MSAC algorithm.
Finds the best 3D point for provided collection of 3D planes using MSAC algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D points using MSAC algorithm.
Finds the best affine 3D transformation for provided collections of matched 3D points using MSAC algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D points using MSAC algorithm.
Finds the best projective 3D transformation for provided collections of matched 2D points using MSAC algorithm.
Finds the best quadric for provided collection of 3D points using MSAC algorithm.
Finds the best sphere for provided collection of 3D points using MSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using MSAC + UPnP algorithms.
Raised when lines or planes are parallel and there is no intersection.
A pinhole camera refiner using line/plane correspondences and the Levenberg-Marquardt algorithm to try to decrease overall error in LMSE terms among inlier samples by taking the pinhole camera matrix as a whole without decomposition.
A pinhole camera refiner using point correspondences and the Levenberg-Marquardt algorithm to try to decrease overall error in LMSE terms among inlier samples by taking the pinhole camera matrix as a whole without decomposition.
Exception raised when a non-symmetric matrix is used.
Raised when normalizer cannot normalize points.
Thrown when something cannot be retrieved because it is not yet available.
Raised when not enough vertices are provided.
Raised when using objects (e.g. points) that are not locus of another geometric structure.
Raised when an estimator is not ready.
Raised when a given feature is not supported.
Refines an instance of type T by taking into account an initial estimation, inlier matches, their residuals and pairs of matches samples.
Exception raised when providing parallel planes.
Raised when provided vectors are parallel.
This class implements the behavior of a pinhole camera.
This class defines the interface for an estimator for pinhole cameras.
Thrown when pinhole camera estimation fails.
Listener to be notified when estimation starts, finishes or any progress changes.
Defines types of pinhole camera estimators depending on their algorithm implementation.
This class defines intrinsic parameters of a pinhole camera.
Base class for pinhole camera refiners.
This is an abstract class for algorithms to robustly find the best PinholeCamera for provided collections of matched 3D points and their corresponding projected 2D points, or collections of matched 3D planes and their corresponding projected 2D lines (depending on point correspondence or plane/line correspondence is being used).
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Class defining a plane.
A 3D affine transformation refiner using plane correspondences.
This is an abstract class for algorithms to robustly find the best affine 3D transformation for collections of matching planes.
A 3D projective transformation refiner using plane correspondences.
This is an abstract class for algorithms to robustly find the best projective 3D transformation for collections of matching planes.
This is an abstract class for algorithms to robustly find the best 3D plane that passes through a collection of 3D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Interface defining a point (either in 2D or 3D, or any other further dimensions that might be defined).
Abstract class defining the base interface that all 2D points should have. 2D points describe points in a 2D space such as images.
This class takes a collection of points and computes its average inhomogeneous coordinates and their scale so that a metric transformation is computed to transform points and normalize them.
Refines a 2D point by taking into account an initial estimation, inlier samples and their residuals.
This is an abstract class for algorithms to robustly find the best 3D point that intersects in a collection of 2D lines.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Abstract class defining the base interface that all 3D points should have. 3D points describe points in a 3D space such as the Euclidean space.
This class takes a collection of points and computes its average inhomogeneous coordinates and their scale so that a metric transformation is computed to transform points and normalize them.
Refines a 3D point by taking into account an initial estimation, inlier samples and their residuals.
This is an abstract class for algorithms to robustly find the best 3D point that intersects in a collection of 3D planes.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
A 2D affine transformation refiner using point correspondences.
This is an abstract class for algorithms to robustly find the best affine 2D transformation for collections of matching 2D points.
A 3D affine transformation refiner using point correspondences.
This is an abstract class for algorithms to robustly find the best affine 3D transformation for collections of matching 3D points.
This file contains abstract implementation for pinhole camera estimators based on point correspondences.
Base class for a pinhole camera refiner using point correspondences.
This is an abstract class for algorithms to robustly find the best pinhole camera for collections of matched 3D/2D points.
A 2D projective transformation refiner using point correspondences.
This is an abstract class for algorithms to robustly find the best projective 2D transformation for collections of matching 2D points.
A 3D projective transformation refiner using point correspondences.
This is an abstract class for algorithms to robustly find the best projective 3D transformation for collection of matching 3D points.
This class defines a polygon in 2D space.
This class defines a polygon in 3D space.
This class performs projective transformations on 2D space.
Base class for ProjectiveTransformation2D refiner.
This is an abstract class for algorithms to robustly find the best projective 2D transformation for collections of matching 2D points, or 2D lines.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class performs projective transformations on 2D space.
Base class for ProjectiveTransformation3D refiner.
This is an abstract class for algorithms to robustly find the best projective 3D transformation for collections of matching 3D points, or 3D planes.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Finds the best circle for provided collection of 2D points using PROMedS algorithm.
Finds the best conic for provided collection of 2D points using PROMedS algorithm.
Finds the best pinhole camera for provided collections of matched lines and planes using PROMedS algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using PROMedS algorithm.
Finds the best conic for provided collection of 2D lines using PROMedS algorithm.
Finds the best quadric for provided collection of 3D planes using PROMedS algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using PROMedS + EPnP algorithms.
Finds the best Euclidean 2D transformation for provided collections of matched 2D point using PROMedS algorithm.
Finds the best Euclidean 3D transformation for provided collections of matched 3D point using PROMedS algorithm.
Finds the best 2D line for provided collection of 2D points using PROMedS algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D lines using PROMedS algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D lines using PROMedS algorithm.
Finds the best metric 2D transformation for provided collections of matched 2D point using PROMedS algorithm.
Finds the best metric 3D transformation for provided collections of matched 3D point using PROMedS algorithm.
Finds the best affine 3D transformation for provided collections of matched planes using PROMedS algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D planes using PROMedS algorithm.
Finds the best 2D plane for provided collection of 3D points using PROMedS algorithm.
Finds the best 2D point for provided collection of 2D lines using PROMedS algorithm.
Finds the best 3D point for provided collection of 3D points using PROMedS algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D points using PROMedS algorithm.
Finds the best affine 3D transformation for provided collections of matched 3D points using PROSAC algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D points using PROMedS algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D points using PROMedS algorithm.
Finds the best quadric for provided collection of 3D points using PROMedS algorithm.
Finds the best sphere for provided collection of 3D points using PROMedS algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using PROMedS + UPnP algorithms.
Finds the best circle for provided collection of 2D points using PROSAC algorithm.
Finds the best conic for provided collection of 2D points using PROSAC algorithm.
Finds the best pinhole camera for provided collections of matched lines and planes using PROSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using PROSAC algorithm.
Finds the best dual conic for provided collection of 2D lines using PROSAC algorithm.
Finds the best dual quadric for provided collection of 3D planes using PROSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using PROSAC + EPnP algorithms.
Finds the best Euclidean 2D transformation for provided collections of matched 2D points using PROSAC algorithm.
Finds the best Euclidean 3D transformation for provided collections of matched 3D points using PROSAC algorithm.
Finds the best 2D line for provided collection of 2D points using PROSAC algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D lines using PROSAC algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D lines using PROSAC algorithm.
Finds the best metric 2D transformation for provided collections of matched 2D points using PROSAC algorithm.
Finds the best metric 3D transformation for provided collections of matched 3D points using PROSAC algorithm.
Finds the best affine 3D transformation for provided collections of matched planes using PROSAC algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D planes using PROSAC algorithm.
Finds the best 2D plane for provided collection of 3D points using PROSAC algorithm.
Finds the best 2D point for provided collection of 2D lines using PROSAC algorithm.
Finds the best 3D point for provided collection of 3D planes using PROSAC algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D points using PROSAC algorithm.
Finds the best affine 3D transformation for provided collections of matched 3D points using PROSAC algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D points using PROSAC algorithm.
Finds the best projective 3D transformation for provided collections of matched 3D points using PROSAC algorithm.
Finds the bes quadric for provided collection of 3D points using PROSAC algorithm.
Finds the best sphere for provided collection of 3D points using PROSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using PROSAC + UPnP algorithms.
This class contains the implementation of a quadric.
Raised when a quadric cannot be computed because the inverse matrix of a dual quadric does not exist.
This is an abstract class for algorithms to robustly find the best quadric that fits in a collection of 3D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
Contains a representation of a 3D rotation in a more precise and compact way than in matrix notation.
Finds the best circle for provided collection of 2D points using RANSAC algorithm.
Finds the best conic for provided collection of 2D points using RANSAC algorithm.
Finds the best pinhole camera for provided collections of matched lines and planes using RANSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using RANSAC algorithm.
Finds the best dual conic for provided collection of 2D lines using RANSAC algorithm.
Finds the best dual quadric for provided collection of 3D planes using RANSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using RANSAC + EPnP algorithms.
Finds the best Euclidean 2D transformation for provided collections of matched 2D points using RANSAC algorithm.
Finds the best Euclidean 3D transformation for provided collections of matched 3D points using RANSAC algorithm.
Finds the best 2D line for provided collection of 2D points using RANSAC algorithm.
Finds the best affine 2D transformation for provided collections of matched 2D lines using RANSAC algorithm.
Finds the best projective transformation for provided collections of matched 2D lines using RANSAC algorithm.
Finds the best metric 2D transformation for provided collections of matched 2D points using RANSAC algorithm.
Finds the best metric 3D transformation for provided collections of matched 3D points using RANSAC algorithm.
Finds the best affine 3D transformation for provided collections of matched planes using RANSAC algorithm.
Finds the best projective transformation for provided collections of matched 3D planes using RANSAC algorithm.
Finds the best 3D plane for provided collection of 3D points using RANSAC algorithm.
Finds the best 2D point for provided collection of 2D lines using RANSAC algorithm.
Finds the best 3D point for provided collection of 3D planes using RANSAC algorithms.
Finds the best affine 2D transformation for provided collections of matched 2D points using RANSAC algorithm.
Finds the best affine 3D transformation for provided collection of matched 3D points using RANSAC algorithm.
Finds the best projective 2D transformation for provided collections of matched 2D points using RANSAC algorithm.
Finds the best projective 3D transformation for provided collection of matched 3D points using RANSAC algorithm.
Finds the best quadric for provided collection of 3D points using RANSAC algorithm.
Finds the best sphere for provided collection of 3D points using RANSAC algorithm.
Finds the best pinhole camera for provided collections of matched 2D/3D points using RANSAC + UPnP algorithms.
This class defines a 2D rectangle aligned with the horizontal and vertical axes.
Refines an instance of type T by taking into account an initial estimation.
Exception raised when refinement fails.
Listener for a refiner.
This class defines the amount of rotation for 2D points or lines.
Abstract class representing a rotation in 3D space.
Enumeration defining type of rotation 3D.
Exception raised when doing operations on rotations.
Utility methods related to rotations.
Refines an instance of type T by taking into account an initial estimation, inlier samples, their residuals and a collection of samples.
This class defines a sphere.
This is an abstract class for algorithms to robustly find the best sphere that fits in a collection of 3D points.
Listener to be notified of events such as when estimation starts, ends or when progress changes.
This class performs transformations on 2D space.
This class performs transformations on 3D space.
This class defines a triangle in the 2D space.
This class defines a triangle in the 3D space.
This class defines a triangulator for 2D polygons.
This class defines a triangulator for 3D polygons.
Raised when a polygon cannot be triangulated.
This enumeration defines triangulator methods.
Raised when a point cannot be defined (because solution is indeterminate) or there are infinite points, etc.
UPnP (Uncalibrated Perspective-n-Point) implementation to estimate pinhole cameras from 2D/3D point correspondences.
A possible solution.
Base abstract class for algorithms to robustly find the best pinhole camera for collections of matched 3D/2D points using UPnP (Uncalibrated Perspective-n-Point) algorithm.
Helper class containing commonly used methods related to geometry.
This class defines a triangulator for 2D polygons.
This class defines a triangulator for 3D polygons.
This class implements pinhole camera estimator using a weighted algorithm and point correspondences.
This class implements pinhole camera estimator using a weighted algorithm and point correspondences.
Thrown when a pair of lists don't have equal size.