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.

Vendure plugin for integration with the Goedgepickt order picking platform

<!-- Links here are NOT rewritten on publish. Any link to another file in this repo must be an absolute GitHub URL rooted at: https://github.com/fullcalendar/temporal-polyfill/blob/main/ (use /tree/main/ instead of /blob/main/ when linking a dir

Modern byte, encoding, converter registry, and PEM utilities for TypeScript projects.

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

Finds points that fall within polygon(s).

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

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.

A very fast geospatial point clustering library.

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

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

Fast nd point clustering.

Takes a FeatureCollection of points and calculates the median center.

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

MPL shipping carrier adapter for Shopickup

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

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