nearestAll

Returns all geometries with the minimum distance to the query geometry.

Cartesian distance is calculated between the actual geometries, not their bounding boxes.

Parameters

Name	Type	Description
geometry	Geometry	Geometry for which the nearest neighbors are queried

Returns

G[]

An array of all nearest geometries with the same minimum distance to the query geometry, or an empty array if the tree is empty

Throws

• GEOSError if any of the considered candidates for the nearest geometry is one of unsupported geometry types (curved)

Examples

const geometries = [
    point([ 0, 5 ]), lineString([ [ 3, 4 ], [ 5, 5 ], [ 4, 3 ] ]),
    point([ 5, 0 ]), lineString([ [ 4, -3 ], [ 5, -5 ], [ 3, -4 ] ]),
    point([ 0, -5 ]), lineString([ [ -3, -4 ], [ -5, -5 ], [ -4, -3 ] ]),
    point([ -5, 0 ]), lineString([ [ -3, 4 ], [ -5, 5 ], [ -4, 3 ] ]),
];
const tree = strTreeIndex(geometries);

const g1 = point([ 0, 0 ]);
const matches1 = tree.nearestAll(g1);
// all geometries as they are all 5 units away from the `g1`

const g2 = point([ 4.5, 1.5 ]);
const matches2 = tree.nearestAll(g2);
// [ <POINT (5 0)>, <LINESTRING (3 4, 5 5, 4 3)> ]

const g3 = point([ 3, 3 ]);
const matches3 = tree.nearestAll(g3);
// [ <LINESTRING (3 4, 5 5, 4 3)> ]

const geometries = [ point([ 0, 5 ]), lineString([ [ 3, 4 ], [ 5, 5 ], [ 4, 3 ] ]), point([ 5, 0 ]), lineString([ [ 4, -3 ], [ 5, -5 ], [ 3, -4 ] ]), point([ 0, -5 ]), lineString([ [ -3, -4 ], [ -5, -5 ], [ -4, -3 ] ]), point([ -5, 0 ]), lineString([ [ -3, 4 ], [ -5, 5 ], [ -4, 3 ] ]), ]; const tree = strTreeIndex(geometries); const g1 = point([ 0, 0 ]); const matches1 = tree.nearestAll(g1); // all geometries as they are all 5 units away from the `g1` const g2 = point([ 4.5, 1.5 ]); const matches2 = tree.nearestAll(g2); // [ <POINT (5 0)>, <LINESTRING (3 4, 5 5, 4 3)> ] const g3 = point([ 3, 3 ]); const matches3 = tree.nearestAll(g3); // [ <LINESTRING (3 4, 5 5, 4 3)> ]