incremental-convex-hull
Incremental n-dimensional convex hull algorithm
Incremental n-dimensional convex hull algorithm
test if two n-dimensional bounding boxes overlap
Multidimensional arrays with a simple interface
Multivariate normal distribution density function
n-dimensional kdb tree spatial index for hyperlogs
compute the aabb of an n-dimensional line segment
angle between the center and each corner of a regular minimal polygon in n dimensions
maximize an n-dimensional landscape using the battleship search algorithm
Crops n-dimensional images
A JS module for calculating several distances between two (n-dimensional) points
n-dimensional vector arithmetic
Unofficial tool for interacting with Yahoo Japan's NGT Neighborhood Graph and Tree for Indexing High-dimensional Data
Abstract class to implement Vector syntax (a.k.a. N-Dimensional Arrays)
a super simple package for finding the "center" of a set of points
Caps an N-dimensional array to a maximum total volume (the product of its dimensions) while preserving proportions.
Easy, fast and WASM/WebGPU accelerated vector embedding for the web platform. Locally via ONNX/Transformers.js and via API. Compatible with Browsers, Workers, Web Extensions, Node.js & co.
Easy, fast and WASM/WebGPU accelerated vector embedding for the web platform. Locally via ONNX/Transformers.js and via API. Compatible with Browsers, Workers, Web Extensions, Node.js & co.
Fast dot product calculation for the web platform.
Scales an N-dimensional array to perfectly fit within a bounding box, maintaining proportions.
A numerical solver for non-linear systems of equations, utilizing the n-dimensional Newton-Raphson method.