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

Fast nd point clustering.

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

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

Look up HTML tag names via HTML Element constructors, and vice versa.

Map of invalid numeric character references to their replacements, according to HTML

No description provided.

Get all entry-points for an npm package. Supports the `exports` field in `package.json`.

An extension of svg.js which allows to select elements with mouse

Official n8n node to interface with Qdrant - https://qdrant.tech

InfluxDB 2.x client

A fast polyline and polygon clipping library.

[](https://npm.im/@dnd-kit/dom)

This codebase implements an approximate curve with a set of control points and parameters that has smooth transitions in the curvature.

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

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

Exactly computes the orientation of a tuple of points

TypeScript definitions for kdbush

Takes a collection of features and returns a standard deviational ellipse.

Creates a grid of points within a bounding box.