Kivach
Cascading donations
Add repoPopularDonorsF.A.Q.
My repos

Footer

Subscribe to our newsletter

The latest news, articles, and resources, sent to your inbox.

DiscordTelegramTwitterMediumFacebookYouTubeGitHub

All information about repositories belongs to their owners.

More information about Kivach in the introductory article.

Built on Obyte

This library detects self-intersections in 2D polygons, providing a robust solution that finds all intersection points regardless of performance. It's designed for developers working with geometric algorithms who need to identify where polygon edges cross each other, such as in GIS applications, computer graphics, or computational geometry tasks.

Total donated
Undistributed
Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies of tmpvar/2d-polygon-self-intersections

Account's avatar
mikolalysenko/exact-segment-intersect
Exactly constructs the intersection of two line segments
Account's avatar
tmpvar/robust-estimate-float
estimate the numeric value of a robust geometric predicate
Account's avatar
tape-testing/tape
tap-producing test harness for node and browsers

Support the repos that depend on this repository

Top contributors

tmpvar's profile
tmpvar
26 contributions

Recent events

Kivach works on the Obyte network, and therefore you can track all donations.

No events yet
tmpvar

tmpvar/2d-polygon-self-intersection...

find self-intersections in a 2d polygon

JavaScript
14
2
MIT License