Robust and fast 2D convex hull
The monotone-convex-hull-2d library efficiently computes the convex hull of a set of 2D points using the Monotone chain algorithm in O(n log(n)) time. It is designed for developers working with computational geometry or spatial analysis, providing a robust and fast solution for finding the convex hull of point sets in JavaScript applications.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.