Exactly constructs the intersection of two line segments
JavaScript
7
2
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/exact-segment-intersect
tap-producing test harness for node and browsers
Compress a robust sequence
Multiplies a nonoverlapping increasing sequence of floats by a single float
Exact arithmetic test for line segment intersection
Evaluates the sum of two nonoverlapping increasing sequences of floats
Multiplies two floating point numbers together producing a non-overlapping increasing sequence of floats
Compares a pair of non-overlapping increasing sequences
General purpose robust determinant computation
Exactly multiplies two non-overlapping increasing sequences
Exact subtraction of non-increasing overlapping sequences
Tests if a sequence of floats is a robust non-overlapping increasing sequence
Support the repos that depend on mikolalysenko/exact-segment-intersect
This library may not be fast, but it is robust. Robust in the fact that it will find all of the self-intersections in a polygon - minus of course shared endpoints.
Top contributors
mikolalysenko
9 contributions
tmpvar
2 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet