Uses of Interface
com.irurueta.geometry.Point

Packages that use Point

Package	Description
com.irurueta.geometry	This package contains classes to work with basic geometric entities such as 2D or 3D points, lines, planes, 2D or 3D triangles or polygons, circles, spheres, rotations, transformations etc.

Uses of Point in com.irurueta.geometry

Classes in com.irurueta.geometry with type parameters of type Point

Modifier and Type	Class	Description
class	Box<P extends Point<P>>	Abstract representation of a box for a point in an n-dimensional representation.
class	KDTree<P extends Point<P>>	Implementation of a k-D tree in an arbitrary dimension.
static class	KDTree.BoxNode<P extends Point<P>>	Contains a node of a KD Tree.
interface	Point<P extends Point<P>>	Interface defining a point (either in 2D or 3D, or any other further dimensions that might be defined).

Classes in com.irurueta.geometry that implement Point

Modifier and Type	Class	Description
class	HomogeneousPoint2D	Subclass of Point2D defining an homogeneous 2D point.
class	HomogeneousPoint3D	Subclass of Point3D defining an homogeneous 3D point.
class	InhomogeneousPoint2D	Subclass of Point2D defining an inhomogeneous 2D point.
class	InhomogeneousPoint3D	Subclass of Point3D defining an inhomogeneous 3D point.
class	Point2D	Abstract class defining the base interface that all 2D points should have. 2D points describe points in a 2D space such as images.
class	Point3D	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.

Fields in com.irurueta.geometry declared as Point

Modifier and Type	Field	Description
protected P	Box.hi	High coordinate values.
protected P	Box.lo	Low coordinate values.
private P[]	KDTree.pts	Array of points containing input collection of points.

Methods in com.irurueta.geometry with parameters of type Point

Modifier and Type	Method	Description
int	KDTree.locateNear(P pt, double r, P[] plist, int nmax)	Locates near points to provided one up to a certain radius of search defined in a bounding box.
void	KDTree.nNearest(int jpt, P[] pn, double[] dn, int n)	Gets n nearest points to a given point index in the input collection.
void	KDTree.nNearest(P pt, P[] pn, double[] dn, int n)	Gets n nearest points to a given point in the input collection.