Compute the Voronoi diagram of a set of two-dimensional points.

Takes two points and finds the geographic bearing between them.

Creates an interpolated grid of points using the Inverse Distance Weighting method.

snap round 2d points

Generate JavaScript-compatible regular expressions based on a given set of Unicode symbols or code points.

Returns the closest point, of a collection of points, to a line.

Mapping from Dingbat fonts, such as Symbol, Webdings and Wingdings, to Unicode code points

Takes two points and calculates a point midway between them geodesically.

Takes a GeoJSON feature and returns points at all self-intersections.

Exactly computes the orientation of a tuple of points

Takes a feature or set of features and returns all positions as points.

Calculate the perfect catenary between two points

Merges a specified property from a FeatureCollection of points into a FeatureCollection of polygons.

Takes a set of points and partition them into clusters using the k-means algorithm.

Takes a collection of points and a bounding box, and returns a collection of Voronoi polygons.

Takes a set of points and partition them into clusters according to DBSCAN's data clustering algorithm.

Draws error bars around points

Draggable data points for Chart.js

A library for efficiently querying points along cubic Bezier curves.

Takes two points and finds the bearing angle between them along a Rhumb line.