This project is part of the @thi.ng/umbrella monorepo.

• About
  • Distance metrics
  • Neighborhoods
    • Nearest
    • KNearest
    • Radial
• Status
• Support packages
• Related packages
• Installation
• Dependencies
• Usage examples
• API
• Authors
• License

N-dimensional distance metrics & K-nearest neighborhoods for point queries.

The package provides the IDistance interface for custom distance metric implementations & conversions from/to raw distance values. The following preset metrics are provided too:

Neighborhoods can be used to select n-D spatial items around a given target location and an optional catchment radius (infinite by default). Neighborhoods also use one of the given distance metrics and implement the widely used IDeref interface to obtain the final query results.

Custom neighborhood selections can be defined via the INeighborhood interface. Currently, there are two different implementations available, each providing several factory functions to instantiate and provide defaults for different dimensions. See documentation and examples below.

An INeighborhood implementation for nearest neighbor queries around a given target location, initial query radius and IDistance metric to determine proximity.

An INeighborhood implementation for K-nearest neighbor queries around a given target location, initial query radius and IDistance metric to determine proximity. The K-nearest neighbors will be accumulated via an internal heap and results can be optionally returned in order of proximity (via .deref() or .values()). For K=1 it will be more efficient to use Nearest to avoid the additional overhead.

An unbounded and unsorted version of KNearest, selecting all items around the target location and given search radius. Qualifying neighbors will be accumulated in order of processing via an internal array.

STABLE - used in production

Search or submit any issues for this package

Work is underway integrating this approach into the spatial indexing data structures provided by the @thi.ng/geom-accel package.

• @thi.ng/distance-transform - Binary image to Distance Field transformation

• @thi.ng/geom-accel - n-D spatial indexing data structures with a shared ES6 Map/Set-like API
• @thi.ng/k-means - Configurable k-means & k-medians (with k-means++ initialization) for n-D vectors
• @thi.ng/vectors - Optimized 2d/3d/4d and arbitrary length vector operations, support for memory mapping/layouts

yarn add @thi.ng/distance

ES module import:

<script type="module" src="https://cdn.skypack.dev/@thi.ng/distance"></script>

Skypack documentation

For Node.js REPL:

const distance = await import("@thi.ng/distance");

Package sizes (brotli'd, pre-treeshake): ESM: 1.26 KB

• @thi.ng/api
• @thi.ng/checks
• @thi.ng/errors
• @thi.ng/heaps
• @thi.ng/math
• @thi.ng/vectors

Several demos in this repo's /examples directory are using this package.

A selection:

Screenshot	Description	Live demo	Source
	K-nearest neighbor search in an hash grid	Demo	Source

Generated API docs

import * as d from "@thi.ng/distance";

const items = { a: 5, b: 16, c: 9.5, d: 2, e: 12 };

// collect the 3 nearest numbers for target=10 and using
// infinite selection radius and squared distance metric (defaults)
const k = d.knearestN(10, 3);
// consider each item for inclusion
Object.entries(items).forEach(([id, x]) => k.consider(x, id));

// retrieve result tuples of [distance, value]
k.deref()
// [ [ 25, 'a' ], [ 4, 'e' ], [ 0.25, 'c' ] ]

// result values only
k.values()
// [ 'a', 'e', 'c' ]

// neighborhood around 10, K=3 w/ max radius 5
// also use Eucledian distance and sort results by proximity
const k2 = d.knearestN(10, 3, 5, d.EUCLEDIAN1, true);
Object.entries(items).forEach(([id, x]) => k2.consider(x, id));

k2.deref()
// [ [ 0.5, 'c' ], [ 2, 'e' ], [ 5, 'a' ] ]

• Karsten Schmidt

If this project contributes to an academic publication, please cite it as:

@misc{thing-distance,
  title = "@thi.ng/distance",
  author = "Karsten Schmidt",
  note = "https://thi.ng/distance",
  year = 2021
}

© 2021 - 2023 Karsten Schmidt // Apache License 2.0