Robust Munkres
A lightweight and efficient implementation of the Munkres (Hungarian) algorithm for optimal assignment in square and rectangular matrices.
Munkres (aka Hungarian) algorithm for JS
An implementation of (Kuhn-)Munkres algorithm.
Fast robust predicates for computational geometry
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Exactly computes the orientation of a tuple of points
Robust polynomial regression using LMedS
vm2 is a sandbox that can run untrusted code with whitelisted Node's built-in modules.
Evaluates the sum of two nonoverlapping increasing sequences of floats
Exact subtraction of non-increasing overlapping sequences
Exact arithmetic test to check if point is contained in sphere
A robust and multipurpose Graph object for JavaScript.
Multiplies a nonoverlapping increasing sequence of floats by a single float
Tests whether one path is inside another path
Compare alphanumeric strings the same way a human would, using a natural order algorithm
determine if a point is inside a polygon with a ray intersection counting algorithm
Exact arithmetic test for line segment intersection
High Performance Layer 1 / Layer 2 Caching with Keyv Storage
Advanced Domain-Driven Design
Simple, robust, BitTorrent tracker (client & server) implementation
Exactly computes the dot product between two vectors
Simple, robust, BitTorrent peer wire protocol implementation
Compress a robust sequence