Tools for manipulating simplicial complexes in JavaScript
JavaScript
64
14
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/simplicial-complex
Bit twiddling hacks for JavaScript
tap-producing test harness for node and browsers
A union-find data structure for maintaining disjoint sets.
Support the repos that depend on mikolalysenko/simplicial-complex
Incremental n-dimensional convex hull algorithm
Concatenates two simplicial complexes
Boilerplate for frontend-focused NodeSchool lessons
Simplifies a planar graph
Cartesian product of simplicial complexes
Homological exterior derivartive with integer coefficients
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
Consistently orient manifold patches of a 2D simplicial complex
Simplifies a 2D polygonal region
n-dimensional network flow solver
Applies on iteration of Loop's subdivision surface algorithm to a triangulated mesh
Generates a grid shaped graph
Euler characteristic for simplicial complexes
Progressive triangle streams
Extract manifold patches from a mesh
Code for drawing simplicial complexes in arbitrary dimensions.
Approximate geodesic distance for triangulated meshes
Vertex stars of simplicial complexes
Iteratively split edges to get a more uniform tessellation
Iteratively split triangles to get a more uniform tessellation
Extract a patch from a mesh given a seed face using dihedral angle heuristics.
Given a heightmap, generate a "contoured" terrain mesh
generate triangulated meshes from shapefiles and geojson
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet