Calculate all points inside any triangle
Fast robust predicates for computational geometry
Creates an interpolated grid of points using the Inverse Distance Weighting method.
TypeScript definitions for delaunator
Takes a set of points and creates a Triangulated Irregular Network.
Creates a triangular grid within a bounding box.
Takes a triangular plane as a polygon and a point within that triangle, and returns the z-value at that point.
Estimate points on a bezier curve or a set of connexted bezier curves
TypeScript definitions for earcut
Interactive react component for displaying javascript arrays and JSON objects.
Estimate points on a SVG path
Operations for two-dimensional polygons.
Creates a honeycomb-like grid of hexagons within a bounding box.
Draw polyline with regl
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
TypeScript definitions for d3-polygon
Fill a polygon with lines
Largest Triangle Three Buckets downsample algorithm by Sveinn Steinarsson reshaped into a node.js module
A very fast geospatial point clustering library.
Fast and robust triangle-triangle intersection test with high precision for cross and coplanar triangles based on the algorithm by Devillers & Guigue.
Takes a FeatureCollection of points and calculates the median center.
Provides functions for time series data downsampling for visual representation
Convert a series of points to a monotone cubic spline
Minimal weight downsample N array of numbers to K array of numbers squashed up.