Sort array of points based on how close they are to a givin point

Match human-quality input to potential matches by edit distance.

Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.

Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax

[](https://npm.im/@dnd-kit/geometry)

Measures the straight-line distance between two points, like cities or landmarks.

A JS library for finding optimal label position inside a polygon

Fastest Levenshtein distance implementation in JS.

Compute the euclidean distance between two vectors

Calculates the distance along a rhumb line between two points.

Distance and similarity functions to compare vectors

Levenshtein edit distance

Alphanumeric sorting algorithm

Calculate the influence or weight of points over an area based on their distances.

Measure the difference between two strings using the Levenshtein distance algorithm

Calculates the distance between a given point and the nearest point on a line.

Fork of eslint rule that sorts keys in objects (https://eslint.org/docs/rules/sort-keys) with autofix enabled

Prettier plugin to sort JSON files alphanumerically by key

Sort an array on an object property

Fast and powerful array sorting. Sort an array of objects by one or more properties. Any number of nested properties or custom comparison functions may be used.