Package Licenses
MIT
Dependency Licenses
MIT25
Package | Relation | Dependencies | Published |
---|---|---|---|
alpha-complex • 1.0.0Computes the alpha complex of a point set in any dimension | DIRECT | 18 | |
bit-twiddle • 1.0.2Bit twiddling hacks for JavaScript | INDIRECT | 0 | |
boundary-cells • 2.0.2Enumerates all boundary cells in a simplicial complex | INDIRECT | 0 | |
cell-orientation • 1.0.1Computes the orientation of a cell | INDIRECT | 0 | |
circumcenter • 1.0.0Computes circumcenters of simplices | INDIRECT | 8 | |
circumradius • 1.0.0Computes the circum radius of a simplex | INDIRECT | 9 | |
compare-cell • 1.0.0An ordering for sets of integers | INDIRECT | 0 | |
compare-oriented-cell • 1.0.1Test if two sets of integers are equal up to an even permutation | INDIRECT | 2 | |
delaunay-triangulate • 1.1.6Delaunay triangulations in any dimension | INDIRECT | 11 | |
dup • 1.0.0Initialize an array of arrays to a constant | INDIRECT | 0 | |
incremental-convex-hull • 1.0.1Incremental n-dimensional convex hull algorithm | INDIRECT | 9 | |
reduce-simplicial-complex • 1.0.0Cancels oppositely oriented cells in a simplicial complex | INDIRECT | 3 | |
robust-compress • 1.0.0Compress a robust sequence | INDIRECT | 0 | |
robust-determinant • 1.1.0General purpose robust determinant computation | INDIRECT | 5 | |
robust-linear-solve • 1.0.0Exactly solve a low dimensional linear system | INDIRECT | 6 | |
robust-orientation • 1.2.1Exactly computes the orientation of a tuple of points | INDIRECT | 5 | |
robust-scale • 1.0.2Multiplies a nonoverlapping increasing sequence of floats by a single float | INDIRECT | 2 | |
robust-subtract • 1.0.0Exact subtraction of non-increasing overlapping sequences | INDIRECT | 0 | |
robust-sum • 1.0.0Evaluates the sum of two nonoverlapping increasing sequences of floats | INDIRECT | 0 | |
simplicial-complex-boundary • 1.0.1Extracts the boundary of a simplicial complex | DIRECT | 5 | |
simplicial-complex • 1.0.0Topological indexing for simplicial complexes | INDIRECT | 2 | |
two-product • 1.0.2Multiplies two floating point numbers together producing a non-overlapping increasing sequence of floats | INDIRECT | 0 | |
two-sum • 1.0.0Computes a non-overlapping sequence representing the sum of two floating point numbers. | INDIRECT | 0 | |
union-find • 1.0.2A union-find data structure for maintaining disjoint sets. | INDIRECT | 0 | |
uniq • 1.0.1Removes duplicates from a sorted array in place | INDIRECT | 0 |