Package Licenses
MIT
Dependency Licenses
MIT49
| Package | Relation | Dependencies | Published |
|---|---|---|---|
| big-rat • 1.0.4A big integer rational number | INDIRECT | 3 | |
| binary-search-bounds • 2.0.5Better binary searching | INDIRECT | 0 | |
| bit-twiddle • 0.0.2Bit twiddling hacks for JavaScript | INDIRECT | 0 | |
| bit-twiddle • 1.0.2Bit twiddling hacks for JavaScript | INDIRECT | 0 | |
| bn.js • 4.12.2Big number implementation in pure javascript | INDIRECT | 0 | |
| box-intersect • 1.0.2Any dimensional box intersection | INDIRECT | 3 | |
| cdt2d • 1.0.0Constrained Delaunay Triangulation in 2D | DIRECT | 8 | |
| clean-pslg • 1.1.2Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph | DIRECT | 18 | |
| compare-angle • 1.0.1Compares two angles with a common edge | INDIRECT | 8 | |
| cwise-compiler • 1.1.3cwise's internal compiler | INDIRECT | 1 | |
| double-bits • 1.1.1Inspect binary representation of IEEE754 doubles | INDIRECT | 0 | |
| dup • 1.0.0Initialize an array of arrays to a constant | INDIRECT | 0 | |
| edges-to-adjacency-list • 1.0.0Convert a list of edges to an adjacency list | INDIRECT | 1 | |
| functional-red-black-tree • 1.0.1A fully persistent balanced binary search tree | INDIRECT | 0 | |
| gamma • 0.1.0the gamma function (Γ) | INDIRECT | 0 | |
| interval-tree-1d • 1.0.41D interval tree data structure | INDIRECT | 1 | |
| invert-permutation • 1.0.0Inverts permutations | INDIRECT | 0 | |
| iota-array • 1.0.0Generates an array of consecutive integers starting at 0 | INDIRECT | 0 | |
| is-buffer • 1.1.6Determine if an object is a Buffer | INDIRECT | 0 | |
| ndarray-extract-contour • 1.0.1Generic contour extraction library for surface nets/dual contouring | INDIRECT | 3 | |
| ndarray • 1.0.19Multidimensional Arrays | DIRECT | 2 | |
| nextafter • 1.0.0Find the floating point number immediately after any given number | INDIRECT | 1 | |
| permutation-parity • 1.0.0Computes the parity of a permutation | INDIRECT | 3 | |
| permutation-rank • 1.0.0Ranks and unranks permutations | INDIRECT | 4 | |
| planar-dual • 1.0.2Find the faces of a planar graph | INDIRECT | 10 | |
| planar-graph-to-polyline • 1.0.6Convert a planar graph to a collection of nest polylines | DIRECT | 18 | |
| point-in-big-polygon • 2.0.1Industrial strength point in polygon test | INDIRECT | 10 | |
| rat-vec • 1.1.1Exact rational vector arithmetic | INDIRECT | 4 | |
| robust-in-sphere • 1.2.1Exact arithmetic test to check if point is contained in sphere | INDIRECT | 5 | |
| robust-orientation • 1.2.1Exactly computes the orientation of a tuple of points | INDIRECT | 5 | |
| robust-product • 1.0.0Exactly multiplies two non-overlapping increasing sequences | INDIRECT | 4 | |
| robust-scale • 1.0.2Multiplies a nonoverlapping increasing sequence of floats by a single float | INDIRECT | 2 | |
| robust-segment-intersect • 1.0.1Exact arithmetic test for line segment intersection | INDIRECT | 6 | |
| 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 | |
| signum • 0.0.0Returns the sign of a number | INDIRECT | 0 | |
| simplicial-complex • 0.3.3Topological indexing for simplicial complexes | INDIRECT | 2 | |
| simplify-planar-graph • 2.0.1Simplifies a planar graph | DIRECT | 9 | |
| slab-decomposition • 1.0.3Slab decomposition data structure for 2D vertical ray queries | INDIRECT | 8 | |
| surface-nets • 1.0.2General purpose level set extraction | DIRECT | 12 | |
| triangulate-hypercube • 1.0.1Triangulates a hypercube into simplices | INDIRECT | 7 | |
| triangulate-polyline • 1.0.3Triangulates a complex polygon | DIRECT | 9 | |
| 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 | |
| typedarray-pool • 1.2.0Reuse typed arrays | INDIRECT | 2 | |
| union-find • 0.0.4A union-find data structure for maintaining disjoint sets. | 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 | |
| zero-crossings • 1.0.1Finds all zero crossings in a 1D ndarray | INDIRECT | 2 |