2D Point to Line Segment distance function

Clusters an array of vectors into k clusters using k-means (using random initial centroids and Euclidean as the distance function).

generate a triangle mesh from a distance function

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

Measure the difference between two strings using the Levenshtein distance algorithm

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

Highly optimized javascript distance function for triangles

Fast utilities for ray-casting against triangles or boxes or a distance function / implicit surface

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

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.

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

An Implementation of Jaro Distance Algorithm by Matthew A. Jaro

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Signed distance function for arbitrary tetrahedron, suitable for marching cubes etc. Includes fast function to check if tetrahedron contains point.

Given a signed distance function and ray, trace a scene to find the first point of intersection.

Compute the euclidean distance between two vectors

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

Calculate the hamming distance of two hex strings or buffers