licenses.dev

delaunay-triangulate v1.1.6

Delaunay triangulations in any dimension

Published on

Licenses

Learn more about license information.

Package Licenses

MIT

Dependency Licenses

MIT11
PackageRelationDependenciesPublished
bit-twiddle • 1.0.2Bit twiddling hacks for JavaScriptINDIRECT0
incremental-convex-hull • 1.0.1Incremental n-dimensional convex hull algorithmDIRECT9
robust-orientation • 1.2.1Exactly computes the orientation of a tuple of pointsINDIRECT5
robust-scale • 1.0.2Multiplies a nonoverlapping increasing sequence of floats by a single floatINDIRECT2
robust-subtract • 1.0.0Exact subtraction of non-increasing overlapping sequencesINDIRECT0
robust-sum • 1.0.0Evaluates the sum of two nonoverlapping increasing sequences of floatsINDIRECT0
simplicial-complex • 1.0.0Topological indexing for simplicial complexesINDIRECT2
two-product • 1.0.2Multiplies two floating point numbers together producing a non-overlapping increasing sequence of floatsINDIRECT0
two-sum • 1.0.0Computes a non-overlapping sequence representing the sum of two floating point numbers.INDIRECT0
union-find • 1.0.2A union-find data structure for maintaining disjoint sets.INDIRECT0
uniq • 1.0.1Removes duplicates from a sorted array in placeDIRECT0
Last updated on

Copy the licenses badge code for the latest version:

[![licenses](https://licenses.dev/b/npm/delaunay-triangulate)](https://licenses.dev/npm/delaunay-triangulate)
<a href="https://licenses.dev/npm/delaunay-triangulate">
  <img src="https://licenses.dev/b/npm/delaunay-triangulate" alt="licenses" />
</a>

Or the licenses badge code for the 1.1.6 version:

[![licenses](https://licenses.dev/b/npm/delaunay-triangulate/1.1.6)](https://licenses.dev/npm/delaunay-triangulate/1.1.6)
<a href="https://licenses.dev/npm/delaunay-triangulate/1.1.6">
  <img src="https://licenses.dev/b/npm/delaunay-triangulate/1.1.6" alt="licenses" />
</a>
GitHub