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.
Sort array of points based on how close they are to a givin point
Fastest Levenshtein distance implementation in JS.
Calculates the distance along a rhumb line between two points.
Calculate the influence or weight of points over an area based on their distances.
Match human-quality input to potential matches by edit distance.
Calculates the distance between a given point and the nearest point on a line.
Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.
Measure the difference between two strings using the Levenshtein distance algorithm
Sort an Object or package.json based on the well-known package.json keys
Compute the euclidean distance between two vectors
A string similarity function using the Jaro-Winkler distance metric.
JSS plugin that ensures style properties extend each other instead of override
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Easy autofixable import sorting
Levenshtein edit distance
Distance and similarity functions to compare vectors
PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies
Browser-side SDF font generator
turf destination module
Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax
A JS library for finding optimal label position inside a polygon
[](https://npm.im/@dnd-kit/geometry)
Sort and scale the points of a path encoded with the Google Polyline Algorithm by distance to one another.
Library for sorting a set of elements based on their lexicographic order and the average distance between them