A very fast static 2D index for points based on kd-tree.
Finds your current position on planet earth using the wifi access points in your vicinity
Customizable nD polyline interpolation, re-sampling, splitting & nearest point computation
Extract elementary geometries from a geojson inheriting properties.
Get point data from SVG shapes. Convert point data to an SVG path
turf grid module
simplify 2D polyline
Computes the Euclidean distance between two arrays.
Fast 2D convex hull (Graham Scan)
Computes the Manhattan (city block) distance between two arrays.
chaikin's smoothing algorithm for 2D lines
humanize the distance between 2 Points
nD Poisson-disc sampling w/ support for spatial density functions and custom PRNGs
This is a utility function to calculate the bounding box of series of 2D points
Quickly pack a nested 2D array into a typed array – useful for flattening point data into a WebGL-friendly format
gets a plane's normal from 3 points
turf voronoi module
given two points, it returns the angle in degrees from one to the other
powered by npms.io 🚀