This is a JavaScript library for computing Delaunay triangulations in 2D or 3D, working both in Node.js and browsers. It's designed for developers needing robust geometric algorithms, particularly those working on graphics, computational geometry, or spatial analysis applications.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/delaunay-triangulate
Removes duplicates from a sorted array in place
Incremental n-dimensional convex hull algorithm
Renders axes for WebGL plots
tap-producing test harness for node and browsers
Computes the parity of a permutation
Topological indexing for simplicial complexes
Ready-to-go game shell
Exact arithmetic test to check if point is contained in sphere
Exactly computes the orientation of a tuple of points
Create a WebGL context now!
Javascript Matrix and Vector library for High Performance WebGL apps
Attaches an orbit-camera to a game-shell with default key bindings
ECMAScript parsing infrastructure for multipurpose analysis
Draws a simplicial complex in WebGL
Fast Delaunay Triangulation in JavaScript
Delaunay triangulation in arbitrary dimensions
Support the repos that depend on this repository
Top contributors
mikolalysenko
28 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet