| Modifier and Type | Method and Description |
|---|---|
Point2d |
GeometricObject2d.calculateCentroid()
Calculate the centroid of the shape
|
| Modifier and Type | Method and Description |
|---|---|
void |
GeometricObject2d.scale(Point2d centre,
float sc)
Scale the shape by the given amount about the given point.
|
| Modifier and Type | Field and Description |
|---|---|
Point2d |
Line2d.begin
Start point of line
|
Point2d |
Line2d.end
End point of line
|
Point2d |
Line2d.IntersectionResult.intersectionPoint
The point at which the lines intersect (if the type is INTERSECTING)
|
| Modifier and Type | Method and Description |
|---|---|
Point2d |
Line2d.begin() |
Point2d |
Line2d.calculateCentroid() |
Point2d |
Line2d.end() |
Point2d |
Line2d.getBeginPoint()
Get the start point
|
Point2d |
Line2d.getEndPoint()
Get the end point
|
Point2d |
Line2d.reflectAroundLine(Point2d pointToReflect)
Reflects a point around a this line.
|
Point2d |
Line2d.setEndPoint()
Get the end point
|
| Modifier and Type | Method and Description |
|---|---|
static double |
Line2d.distance(Point2d p1,
Point2d p2)
Get the Euclidean distance between two points
|
float |
Line2d.distanceToLine(Point2d p)
Returns the shortest distance between the point and this line.
|
Line2d |
Line2d.getNormal(Point2d p)
Returns a line that is at 90 degrees to the original line and also passes
through the given point.
|
boolean |
Line2d.isInLine(Point2d p,
float tolerance)
Tests whether the given point lies on this line.
|
boolean |
Line2d.isOnLine(Point2d p,
float tolerance)
Tests whether the given point lies on this line.
|
Point2d |
Line2d.reflectAroundLine(Point2d pointToReflect)
Reflects a point around a this line.
|
void |
Line2d.scale(Point2d centre,
float sc) |
void |
Line2d.setBeginPoint(Point2d begin)
Set the start point
|
void |
Line2d.setEndPoint(Point2d end)
Set the end point
|
| Constructor and Description |
|---|
IntersectionResult(Point2d point)
Construct the IntersectionResult with the given intersection point
|
Line2d(Point2d begin,
Point2d end)
Construct a line
|
| Modifier and Type | Method and Description |
|---|---|
Point2d |
Polyline.begin() |
Point2d |
Path2d.begin()
Get the beginning of the path
|
Point2d |
Polyline.end() |
Point2d |
Path2d.end()
Get the end of the path
|
| Constructor and Description |
|---|
Polyline(Point2d... points)
Construct a
Polyline from points |
| Constructor and Description |
|---|
Polyline(List<? extends Point2d> points)
Construct a
Polyline from points |
Polyline(List<? extends Point2d> points,
boolean copy)
Construct a
Polyline from the points, possibly copying the points
first |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractPoint2d
Abstract base for
Point2d implementations that retains the underlying
precision. |
class |
Point2dImpl
Simple concrete implementation of a two dimensional point.
|
| Modifier and Type | Field and Description |
|---|---|
List<Point2d> |
PointList.points
The points in the
PointList |
| Modifier and Type | Method and Description |
|---|---|
Point2d |
PointList.calculateCentroid()
Get the centre of gravity of the
PointList |
Point2d |
Point2d.copy()
Clone the point
|
static Point2d |
Point2dImpl.createRandomPoint()
Create a random point in ([0..1], [0..1]).
|
static Point2d |
Point2dImpl.createRandomPoint(Random rng)
Create a random point in ([0..1], [0..1]) with the given random number
generator.
|
static Point2d |
Point2dImpl.fromDoubleArray(double[] calculateCentroid) |
Point2d |
PointList.get(int i)
Get the ith point
|
Point2d[] |
PointListConnections.getConnections(Point2d pt,
PointList pl)
Get the points connected to the given point.
|
Point2d |
Point2dImpl.minus(Point2d a) |
Point2d |
Point2d.minus(Point2d a)
Take point point from another point such that return = this - a
|
Point2d |
AbstractPoint2d.minus(Point2d a) |
Point2d |
Point2d.transform(Jama.Matrix m)
Transform the point by the given matrix
|
Point2d |
AbstractPoint2d.transform(Jama.Matrix transform) |
| Modifier and Type | Method and Description |
|---|---|
Iterator<Point2d> |
PointList.iterator() |
| Modifier and Type | Method and Description |
|---|---|
void |
PointListConnections.addConnection(PointList pl,
Point2d from,
Point2d to)
Add a connection between two points in the given
PointList. |
Point2dImpl |
PointListConnections.calculateNormal(Point2d pt,
PointList pointList)
Calculate the normal vector at a given vertex.
|
Line2d |
PointListConnections.calculateNormalLine(Point2d pt,
PointList pointList,
float scale)
Calculate a normal line for a given vertex.
|
void |
Point2dImpl.copyFrom(Point2d p) |
void |
Point2d.copyFrom(Point2d p)
Copy the values of the given point into this point.
|
void |
AbstractPoint2d.copyFrom(Point2d p) |
Point2d[] |
PointListConnections.getConnections(Point2d pt,
PointList pl)
Get the points connected to the given point.
|
Point2d |
Point2dImpl.minus(Point2d a) |
Point2d |
Point2d.minus(Point2d a)
Take point point from another point such that return = this - a
|
Point2d |
AbstractPoint2d.minus(Point2d a) |
void |
PointList.rotate(Point2d origin,
double angle)
Rotate the
PointList about the given origin with the given angle
(in radians) |
void |
PointList.scale(Point2d centre,
float sc)
Scale the
PointList by the given amount about the given point. |
void |
Point2dImpl.translate(Point2d v) |
void |
Point2d.translate(Point2d v)
Translate the position of the point by the given amounts
|
void |
AbstractPoint2d.translate(Point2d v) |
| Constructor and Description |
|---|
Point2dImpl(Point2d p)
Construct a Point2dImpl with the (x,y) coordinates given via another
point.
|
PointList(Point2d... points)
Construct a
PointList from points |
| Constructor and Description |
|---|
PointList(Collection<? extends Point2d> points)
Construct a
PointList from points |
PointList(Collection<? extends Point2d> points,
boolean copy)
Construct a
PointList from the points, possibly copying the
points first |
| Modifier and Type | Field and Description |
|---|---|
protected Point2d |
Circle.centre |
Point2d[] |
Triangle.vertices
The vertices of the triangle
|
| Modifier and Type | Method and Description |
|---|---|
Point2d |
Triangle.calculateCentroid() |
Point2d |
RotatedRectangle.calculateCentroid() |
Point2d |
Rectangle.calculateCentroid() |
Point2d |
Polygon.calculateCentroid()
Calculate the centroid of the polygon.
|
Point2d |
Ellipse.calculateCentroid() |
Point2d |
Circle.calculateCentroid() |
Point2d |
Polygon.closestPoint(Point2d pt)
Find the closest point on the polygon to the given point
|
Point2d |
Triangle.firstVertex() |
Point2d |
Rectangle.getBottomRight() |
Point2d |
Rectangle.getTopLeft() |
Point2d |
Triangle.secondVertex() |
Point2d |
Triangle.thirdVertex() |
| Modifier and Type | Method and Description |
|---|---|
List<Point2d> |
Polygon.getVertices()
Get the vertices of the polygon
|
Map<Line2d,Point2d> |
Triangle.intersectionSides(Line2d line)
The intersection of this triangle with the line defined by y = mx + c.
|
| Modifier and Type | Method and Description |
|---|---|
void |
Polygon.addVertex(Point2d pt)
Add a vertex to the polygon
|
Point2d |
Polygon.closestPoint(Point2d pt)
Find the closest point on the polygon to the given point
|
boolean |
Triangle.isInside(Point2d point) |
boolean |
Shape.isInside(Point2d point)
Test whether the point p is inside the shape.
|
boolean |
RotatedRectangle.isInside(Point2d point) |
boolean |
Rectangle.isInside(Point2d point) |
boolean |
Polygon.isInside(Point2d point)
Test whether the point p is inside the polygon using the winding rule
algorithm.
|
boolean |
Ellipse.isInside(Point2d point) |
boolean |
Circle.isInside(Point2d point) |
boolean |
Triangle.isInsideOnLine(Point2d point)
Like
Triangle.isInside(Point2d) but counts being "on the line" as being
inside also |
RotatedRectangle |
Rectangle.rotate(Point2d p,
double angle)
Rotate the
Rectangle about the given pivot with the given angle
(in radians) |
void |
Triangle.scale(Point2d centre,
float sc) |
void |
RotatedRectangle.scale(Point2d centre,
float sc) |
void |
Rectangle.scale(Point2d centre,
float sc) |
void |
Polygon.scale(Point2d centre,
float sc)
Scale the polygon by the given amount about the given point.
|
void |
Ellipse.scale(Point2d centre,
float sc) |
void |
Circle.scale(Point2d centre,
float sc) |
| Constructor and Description |
|---|
Circle(Point2d centre,
float radius)
Construct a circle with the given position and radius
|
Polygon(Point2d... vertices)
Construct a Polygon from vertices
|
Rectangle(Point2d topLeft,
Point2d bottomRight)
Construct a Rectangle with the given parameters.
|
Triangle(Point2d[] vertices)
Construct a Triangle with the given vertices.
|
Triangle(Point2d vertex1,
Point2d vertex2,
Point2d vertex3)
Construct a Triangle with the given vertices.
|
| Constructor and Description |
|---|
Polygon(Collection<? extends Point2d> vertices)
Construct a Polygon from vertices
|
Polygon(Collection<? extends Point2d> vertices,
boolean copy)
Construct a Polygon from the vertices, possibly copying the vertices
first
|
| Modifier and Type | Field and Description |
|---|---|
Point2d |
ConvexityDefect.deepestPoint
The deepest point on the shape polygon
|
Point2d |
ConvexityDefect.end
The ending point on the convex hull
|
protected Point2d |
ProcrustesAnalysis.referenceCog |
Point2d |
ConvexityDefect.start
The starting point on the convex hull
|
| Modifier and Type | Method and Description |
|---|---|
protected static PointList |
GeneralisedProcrustesAnalysis.alignPointsAndAverage(List<PointList> shapes,
PointList reference,
double referenceScaling,
Point2d referenceCog) |
| Modifier and Type | Method and Description |
|---|---|
protected static Point2d |
GrahamScan.getLowestPoint2d(List<Point2d> Point2ds)
Returns the Point2ds with the lowest y coordinate.
|
| Modifier and Type | Method and Description |
|---|---|
protected static Set<Point2d> |
GrahamScan.getSortedPoint2dSet(List<Point2d> Point2ds)
Returns a sorted set of Point2ds from the list
Point2ds. |
| Modifier and Type | Method and Description |
|---|---|
protected static GrahamScan.Turn |
GrahamScan.getTurn(Point2d a,
Point2d b,
Point2d c)
Returns the GrahamScan#Turn formed by traversing through the ordered
Point2ds
a, b and c. |
| Modifier and Type | Method and Description |
|---|---|
protected static boolean |
GrahamScan.areAllCollinear(List<Point2d> Point2ds)
Returns true iff all Point2ds in
Point2ds are collinear. |
static Polygon |
GrahamScan.getConvexHull(List<Point2d> Point2ds)
Returns the convex hull of the Point2ds created from the list
Point2ds. |
protected static Point2d |
GrahamScan.getLowestPoint2d(List<Point2d> Point2ds)
Returns the Point2ds with the lowest y coordinate.
|
protected static Set<Point2d> |
GrahamScan.getSortedPoint2dSet(List<Point2d> Point2ds)
Returns a sorted set of Point2ds from the list
Point2ds. |
| Modifier and Type | Method and Description |
|---|---|
Point2d |
HomographyModel.predict(Point2d data) |
Point2d |
FundamentalModel.predict(Point2d data) |
Point2d |
AffineTransformModel.predict(Point2d p) |
| Modifier and Type | Method and Description |
|---|---|
static IndependentPair<Point2d,Point2d> |
TransformUtilities.normalise(IndependentPair<Point2d,Point2d> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
static IndependentPair<Point2d,Point2d> |
TransformUtilities.normalise(IndependentPair<Point2d,Point2d> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
static List<? extends IndependentPair<Point2d,Point2d>> |
TransformUtilities.normalise(List<? extends IndependentPair<Point2d,Point2d>> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
static List<? extends IndependentPair<Point2d,Point2d>> |
TransformUtilities.normalise(List<? extends IndependentPair<Point2d,Point2d>> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
| Modifier and Type | Method and Description |
|---|---|
Point2d |
HomographyModel.predict(Point2d data) |
Point2d |
FundamentalModel.predict(Point2d data) |
Point2d |
AffineTransformModel.predict(Point2d p) |
static Jama.Matrix |
TransformUtilities.scaleMatrixAboutPoint(double sx,
double sy,
Point2d point)
Create a scaling centered around a point.
|
static Jama.Matrix |
TransformUtilities.translateToPointMatrix(Point2d from,
Point2d to)
Given two points, get a transform matrix that takes points from point a
to point b
|
| Modifier and Type | Method and Description |
|---|---|
static Jama.Matrix |
TransformUtilities.affineMatrix(List<? extends IndependentPair<Point2d,Point2d>> data)
Construct an affine transform using a least-squares fit of the provided
point pairs.
|
static Jama.Matrix |
TransformUtilities.affineMatrix(List<? extends IndependentPair<Point2d,Point2d>> data)
Construct an affine transform using a least-squares fit of the provided
point pairs.
|
abstract double |
HomographyRefinement.computeError(Jama.Matrix h,
List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Compute the error value being optimised between the two point sets.
|
abstract double |
HomographyRefinement.computeError(Jama.Matrix h,
List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Compute the error value being optimised between the two point sets.
|
double |
FundamentalModel.Fundamental8PtResidual.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
FundamentalModel.Fundamental8PtResidual.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
FundamentalModel.EpipolarResidual.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
FundamentalModel.EpipolarResidual.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
FundamentalModel.SampsonGeometricResidual.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
FundamentalModel.SampsonGeometricResidual.computeResidual(IndependentPair<Point2d,Point2d> data) |
boolean |
HomographyModel.estimate(List<? extends IndependentPair<Point2d,Point2d>> data)
DLT estimation of least-squares solution of 3D homogeneous homography
|
boolean |
HomographyModel.estimate(List<? extends IndependentPair<Point2d,Point2d>> data)
DLT estimation of least-squares solution of 3D homogeneous homography
|
boolean |
FundamentalModel.estimate(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
FundamentalModel.estimate(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
AffineTransformModel.estimate(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
AffineTransformModel.estimate(List<? extends IndependentPair<Point2d,Point2d>> data) |
static Jama.Matrix |
TransformUtilities.fundamentalMatrix8Pt(List<? extends IndependentPair<Point2d,Point2d>> data)
The un-normalised 8-point algorithm for estimation of the Fundamental
matrix.
|
static Jama.Matrix |
TransformUtilities.fundamentalMatrix8Pt(List<? extends IndependentPair<Point2d,Point2d>> data)
The un-normalised 8-point algorithm for estimation of the Fundamental
matrix.
|
static Jama.Matrix |
TransformUtilities.fundamentalMatrix8PtNorm(List<? extends IndependentPair<Point2d,Point2d>> data)
The normalised 8-point algorithm for estimating the Fundamental matrix
|
static Jama.Matrix |
TransformUtilities.fundamentalMatrix8PtNorm(List<? extends IndependentPair<Point2d,Point2d>> data)
The normalised 8-point algorithm for estimating the Fundamental matrix
|
protected abstract org.apache.commons.math3.fitting.leastsquares.MultivariateJacobianFunction |
FundamentalRefinement.getFunctions(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data,
FundamentalRefinement.Parameterisation p) |
protected abstract org.apache.commons.math3.fitting.leastsquares.MultivariateJacobianFunction |
FundamentalRefinement.getFunctions(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data,
FundamentalRefinement.Parameterisation p) |
protected abstract org.apache.commons.math3.analysis.MultivariateMatrixFunction |
HomographyRefinement.getJacobianFunction(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
protected abstract org.apache.commons.math3.analysis.MultivariateMatrixFunction |
HomographyRefinement.getJacobianFunction(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
static Pair<Jama.Matrix> |
TransformUtilities.getNormalisations(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Generates the data for normalisation of the points such that each matched
point is centered about the origin and also scaled be be within
Math.sqrt(2) of the origin.
|
static Pair<Jama.Matrix> |
TransformUtilities.getNormalisations(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Generates the data for normalisation of the points such that each matched
point is centered about the origin and also scaled be be within
Math.sqrt(2) of the origin.
|
protected abstract org.apache.commons.math3.analysis.MultivariateVectorFunction |
HomographyRefinement.getValueFunction(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
protected abstract org.apache.commons.math3.analysis.MultivariateVectorFunction |
HomographyRefinement.getValueFunction(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
static Jama.Matrix |
TransformUtilities.homographyMatrix(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Compute the least-squares estimate (the normalised Direct Linear
Transform approach) of the homography between a set of matching data
points.
|
static Jama.Matrix |
TransformUtilities.homographyMatrix(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Compute the least-squares estimate (the normalised Direct Linear
Transform approach) of the homography between a set of matching data
points.
|
static Jama.Matrix |
TransformUtilities.homographyMatrixNorm(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Compute the least-squares estimate (the normalised Direct Linear
Transform approach) of the homography between a set of matching data
points.
|
static Jama.Matrix |
TransformUtilities.homographyMatrixNorm(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Compute the least-squares estimate (the normalised Direct Linear
Transform approach) of the homography between a set of matching data
points.
|
static IndependentPair<Point2d,Point2d> |
TransformUtilities.normalise(IndependentPair<Point2d,Point2d> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
static IndependentPair<Point2d,Point2d> |
TransformUtilities.normalise(IndependentPair<Point2d,Point2d> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
static List<? extends IndependentPair<Point2d,Point2d>> |
TransformUtilities.normalise(List<? extends IndependentPair<Point2d,Point2d>> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
static List<? extends IndependentPair<Point2d,Point2d>> |
TransformUtilities.normalise(List<? extends IndependentPair<Point2d,Point2d>> data,
Pair<Jama.Matrix> normalisations)
Normalise the data, returning a normalised copy.
|
abstract Jama.Matrix |
HomographyRefinement.refine(Jama.Matrix initial,
List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Refine an initial guess at the homography that takes the first points in
data to the second using non-linear Levenberg Marquardt optimisation.
|
abstract Jama.Matrix |
HomographyRefinement.refine(Jama.Matrix initial,
List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Refine an initial guess at the homography that takes the first points in
data to the second using non-linear Levenberg Marquardt optimisation.
|
Jama.Matrix |
FundamentalRefinement.refine(Jama.Matrix initial,
List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Refine an initial guess at the homography that takes the first points in
data to the second using non-linear Levenberg Marquardt optimisation.
|
Jama.Matrix |
FundamentalRefinement.refine(Jama.Matrix initial,
List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data)
Refine an initial guess at the homography that takes the first points in
data to the second using non-linear Levenberg Marquardt optimisation.
|
| Constructor and Description |
|---|
Base(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
Base(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F12Epipolar(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F12Epipolar(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F12Sampson(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F12Sampson(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F13Epipolar(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F13Epipolar(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F13Sampson(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F13Sampson(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F23Epipolar(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F23Epipolar(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F23Sampson(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
F23Sampson(List<? extends IndependentPair<? extends Point2d,? extends Point2d>> data) |
| Modifier and Type | Class and Description |
|---|---|
class |
ConvexityCheck2D<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
Test that a 2d transform model preserves convexity
|
class |
ConvexityCheck2D<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
Test that a 2d transform model preserves convexity
|
class |
OrientationCheck2D<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
Test whether a given model that produces a homogenous transform is
orientation preserving
|
class |
OrientationCheck2D<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
Test whether a given model that produces a homogenous transform is
orientation preserving
|
| Modifier and Type | Method and Description |
|---|---|
List<? extends IndependentPair<Point2d,Point2d>> |
RobustHomographyEstimator.getInliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustHomographyEstimator.getInliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustFundamentalEstimator.getInliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustFundamentalEstimator.getInliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustAffineTransformEstimator.getInliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustAffineTransformEstimator.getInliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustHomographyEstimator.getOutliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustHomographyEstimator.getOutliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustFundamentalEstimator.getOutliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustFundamentalEstimator.getOutliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustAffineTransformEstimator.getOutliers() |
List<? extends IndependentPair<Point2d,Point2d>> |
RobustAffineTransformEstimator.getOutliers() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
RobustHomographyEstimator.fitData(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
RobustHomographyEstimator.fitData(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
RobustFundamentalEstimator.fitData(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
RobustFundamentalEstimator.fitData(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
RobustAffineTransformEstimator.fitData(List<? extends IndependentPair<Point2d,Point2d>> data) |
boolean |
RobustAffineTransformEstimator.fitData(List<? extends IndependentPair<Point2d,Point2d>> data) |
| Modifier and Type | Method and Description |
|---|---|
List<IndependentPair<Point2d,Point2d>> |
BucketingSampler2d.sample(int nItems) |
List<IndependentPair<Point2d,Point2d>> |
BucketingSampler2d.sample(int nItems) |
| Modifier and Type | Method and Description |
|---|---|
void |
BucketingSampler2d.setCollection(Collection<? extends IndependentPair<Point2d,Point2d>> collection) |
void |
BucketingSampler2d.setCollection(Collection<? extends IndependentPair<Point2d,Point2d>> collection) |
| Modifier and Type | Class and Description |
|---|---|
class |
AlgebraicResidual2d<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
Compute the algebraic residuals of points mapped by a 2d homogeneous
transform (i.e.
|
class |
AlgebraicResidual2d<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
Compute the algebraic residuals of points mapped by a 2d homogeneous
transform (i.e.
|
class |
SingleImageTransferResidual2d<M extends Model<Point2d,Point2d>>
Compute the 2d geometric Single Image Transfer residual.
|
class |
SingleImageTransferResidual2d<M extends Model<Point2d,Point2d>>
Compute the 2d geometric Single Image Transfer residual.
|
class |
SymmetricTransferResidual2d<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
The points in the first image are projected by the homography matrix to
produce new estimates of the second image points and the second image point
projected by the inverse homography to produce estimates of the first.
|
class |
SymmetricTransferResidual2d<M extends Model<Point2d,Point2d> & MatrixTransformProvider>
The points in the first image are projected by the homography matrix to
produce new estimates of the second image points and the second image point
projected by the inverse homography to produce estimates of the first.
|
class |
TransformedSITR2d<M extends Model<Point2d,Point2d>>
An implementation of a
SingleImageTransferResidual2d that
pre-transforms both sets of points by predetermined transforms. |
class |
TransformedSITR2d<M extends Model<Point2d,Point2d>>
An implementation of a
SingleImageTransferResidual2d that
pre-transforms both sets of points by predetermined transforms. |
| Modifier and Type | Method and Description |
|---|---|
double |
TransformedSITR2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
TransformedSITR2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
SymmetricTransferResidual2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
SymmetricTransferResidual2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
SingleImageTransferResidual2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
SingleImageTransferResidual2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
AlgebraicResidual2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
double |
AlgebraicResidual2d.computeResidual(IndependentPair<Point2d,Point2d> data) |
void |
TransformedSITR2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] errors) |
void |
TransformedSITR2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] errors) |
void |
SymmetricTransferResidual2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] residuals) |
void |
SymmetricTransferResidual2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] residuals) |
void |
SingleImageTransferResidual2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] errors) |
void |
SingleImageTransferResidual2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] errors) |
void |
AlgebraicResidual2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] residuals) |
void |
AlgebraicResidual2d.computeResiduals(List<? extends IndependentPair<Point2d,Point2d>> data,
double[] residuals) |
| Modifier and Type | Method and Description |
|---|---|
static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge> |
Voronoi.computeVoronoiGraph(List<? extends Point2d> points)
Compute the Voronoi diagram as a graph of its vertices
|
static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge> |
Voronoi.computeVoronoiGraph(List<? extends Point2d> points,
double width,
double height)
Compute the Voronoi diagram as a graph of its vertices
|
| Modifier and Type | Method and Description |
|---|---|
static List<Line2d> |
Voronoi.computeVoronoiEdges(List<? extends Point2d> points)
Compute the Voronoi diagram as a list of its edges
|
static List<Line2d> |
Voronoi.computeVoronoiEdges(List<? extends Point2d> points,
double width,
double height)
Compute the Voronoi diagram as a list of its edges
|
static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge> |
Voronoi.computeVoronoiGraph(List<? extends Point2d> points)
Compute the Voronoi diagram as a graph of its vertices
|
static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge> |
Voronoi.computeVoronoiGraph(List<? extends Point2d> points,
double width,
double height)
Compute the Voronoi diagram as a graph of its vertices
|
static List<Triangle> |
DelaunayTriangulator.triangulate(List<? extends Point2d> pxyz)
Trianglate a set of vertices.
|
| Modifier and Type | Field and Description |
|---|---|
protected List<IndependentPair<String,Point2d>> |
MultidimensionalScaling.points |
| Modifier and Type | Method and Description |
|---|---|
Point2d |
MultidimensionalScaling.getPoint(String key)
Get the predicted point for a specific element.
|
| Modifier and Type | Method and Description |
|---|---|
List<IndependentPair<String,Point2d>> |
MultidimensionalScaling.getPoints()
Get a list of the 2-D coordinates learned by the MDS algorithm for each
element in the input similarity matrix.
|