A very fast 2D concave hull algorithm in JavaScript
JavaScript
0
0
ISC License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of heotaein/concaveman
determine if a point is inside a polygon with a ray intersection counting algorithm
High-performance 2D spatial index for rectangles (based on R*-tree with bulk loading and bulk insertion algorithms)
Fast robust predicates for computational geometry
The smallest and simplest JavaScript priority queue
A strict ESLint config for my JavaScript projects
tap-producing test harness for node and browsers
Support the repos that depend on this repository
Top contributors
mourner
34 contributions
DenisCarriere
2 contributions
IanBoyanZhang
2 contributions
grassick
1 contributions
rowanwins
1 contributions
sven-strothoff
1 contributions
tmcw
1 contributions
waldyrious
1 contributions
sadaszewski
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet