RTreeNearestN Method

Finds the N nearest rectangles to the passed point. If multiple rectangles are equally near, they will all (but total limited to N) be returned.

Namespace: VelocityDBExtensions.Spatial
Assembly: VelocityDBExtensions (in VelocityDBExtensions.dll) Version: 11.1.0.0 (11.1.0)

Syntax

public PriorityQueueRTree NearestN(
	Point p,
	uint count,
	double furthestDistance
)

Public Function NearestN ( 
	p As Point,
	count As UInteger,
	furthestDistance As Double
) As PriorityQueueRTree

public:
PriorityQueueRTree^ NearestN(
	Point p, 
	unsigned int count, 
	double furthestDistance
)

member NearestN : 
        p : Point * 
        count : uint32 * 
        furthestDistance : float -> PriorityQueueRTree

p: Type: VelocityDBExtensions.SpatialPoint
the point we are looking for
count: Type: SystemUInt32
max number of rectangles to look for
furthestDistance: Type: SystemDouble
The furthest distance away from the rectangle to search. Rectangles further than this will not be found.

Type: PriorityQueueRTree
a PriorityQue containing the found recatngles and their priorities (distances from point)

RTreeAddLanguageSpecificTextSet("LST7C19BEAD_0?cpp=::|nu=.");NearestN Method