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

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

Fastest Levenshtein distance implementation in JS.

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

Calculates the distance along a rhumb line between two points.

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.

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

Compute the euclidean distance between two vectors

Sort an Object or package.json based on the well-known package.json keys

Easy autofixable import sorting

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

A string similarity function using the Jaro-Winkler distance metric.

Calculates the distance from a point to the edges of a polygon or multi-polygon.

JSS plugin that ensures style properties extend each other instead of override

Distance and similarity functions to compare vectors

Levenshtein edit distance

PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies

Estimate points on a bezier curve or a set of connexted bezier curves