ParaX Points Mini App
Estimate points on a bezier curve or a set of connexted bezier curves
Estimate points on a SVG path
Draw perfect pressure-sensitive freehand strokes.
Convert a series of points to a monotone cubic spline
Fast robust predicates for computational geometry
Operations for two-dimensional polygons.
Fill a polygon with lines
TypeScript definitions for d3-polygon
Takes a set of points and creates a Triangulated Irregular Network.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
A very fast static 2D index for points based on kd-tree.
Finds points that fall within polygon(s).
A mesh replacement for `THREE.Line`. Instead of using GL_LINE, it uses a strip of billboarded triangles. This is a fork of [spite/THREE.MeshLine](https://github.com/spite/THREE.MeshLine), previously maintained by studio [Utsuboco](https://github.com/utsub
Takes a set of points and partition them into clusters according to DBSCAN's data clustering algorithm.
A very fast geospatial point clustering library.
Fast nd point clustering.
Takes a collection of points and a bounding box, and returns a collection of Voronoi polygons.
Takes a FeatureCollection of points and calculates the median center.
Creates an interpolated grid of points using the Inverse Distance Weighting method.
Takes a set of points and partition them into clusters using the k-means algorithm.
An extension of svg.js which allows to select elements with mouse
Modern byte, encoding, converter registry, and PEM utilities for TypeScript projects.
Look up HTML tag names via HTML Element constructors, and vice versa.