Uses of Class
com.infomatiq.jsi.Point

Packages that use Point

Package	Description
com.infomatiq.jsi
com.infomatiq.jsi.rtree
de.topobyte.jsi

Uses of Point in com.infomatiq.jsi

Methods in com.infomatiq.jsi that return Point

Modifier and Type	Method and Description
Point	Rectangle.centre()

Methods in com.infomatiq.jsi with parameters of type Point

Modifier and Type	Method and Description
void	Rectangle.add(Point p) Computes the union of this rectangle and the passed point, storing the result in this rectangle.
float	Rectangle.distance(Point p) Return the distance between this rectangle and the passed point.
void	SpatialIndex.nearest(Point p, TIntProcedure v, float furthestDistance) Finds the nearest rectangles to the passed rectangle and calls v.execute(id) for each one.
void	SpatialIndex.nearestN(Point p, TIntProcedure v, int n, float distance) Finds the N nearest rectangles to the passed rectangle, and calls execute(id, distance) on each one, in order of increasing distance.
void	SpatialIndex.nearestNUnsorted(Point p, TIntProcedure v, int n, float distance) Same as nearestN, except the found rectangles are not returned in sorted order.
void	Point.set(Point other) Copy from another point into this one

Uses of Point in com.infomatiq.jsi.rtree

Methods in com.infomatiq.jsi.rtree with parameters of type Point

Modifier and Type	Method and Description
void	RTree.nearest(Point p, TIntProcedure v, float furthestDistance)
void	RTree.nearestN_orig(Point p, TIntProcedure v, int count, float furthestDistance) Deprecated. Use new NearestN or NearestNUnsorted instead. This implementation of nearestN is only suitable for small values of N (ie less than 10).
void	RTree.nearestN(Point p, TIntProcedure v, int count, float furthestDistance)
void	RTree.nearestNUnsorted(Point p, TIntProcedure v, int count, float furthestDistance)

Uses of Point in de.topobyte.jsi

Methods in de.topobyte.jsi with parameters of type Point

Modifier and Type	Method and Description
Set<T>	GenericSpatialIndex.nearest(Point p, float distance) Acquire a set of all elements that are in less or equal distance of p than distance.
Set<T>	GenericRTree.nearest(Point p, float distance)
void	GenericSpatialIndex.nearest(Point p, TObjectProcedure<T> procedure, float distance) Execute procedure on all elements that are in less or equal distance of p than distance.
void	GenericRTree.nearest(Point p, TObjectProcedure<T> procedure, float distance)