Exactly computes the sum of a pair of non-overlapping sequences of floats.
JavaScript
4
1
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/robust-sum
tap-producing test harness for node and browsers
Tests if a sequence of floats is a robust non-overlapping increasing sequence
Support the repos that depend on mikolalysenko/robust-sum
Exactly computes the orientation of a tuple of points
Splits a convex polygon by a plane
Exactly multiplies two non-overlapping increasing sequences
Exact arithmetic test to check if point is contained in sphere
General purpose robust determinant computation
Exactly computes the dot product between two vectors
Exactly computes the determinant of a 2x2 matrix as a nonoverlapping increasing series
Exactly computes the determinant of a 3x3 matrix
Compares two angles with a common edge
Exactly constructs the intersection of two line segments
Convert a planar graph to a collection of nest polylines
Maintain a spherical triangulation under incremental vertex insertions
subdivide an arc into line segments
Top contributors
mikolalysenko
13 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet