This project provides a high-performance point-in-polygon test that preprocesses complex polygons with holes for fast O(log n) membership queries using exact arithmetic. It's designed for developers working with large or geometrically intricate polygons who need robust, numerically stable boundary checks, such as in GIS, CAD, or computational geometry applications.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/point-in-big-polygon
Better binary searching
1D interval tree data structure
Exactly computes the orientation of a tuple of points
Slab decomposition data structure for 2D vertical ray queries
tap-producing test harness for node and browsers
Returns the sign of a number
Exactly test if a point is inside, outside or on the boundary of a polygon
Support the repos that depend on this repository
Top contributors
mikolalysenko
13 contributions
archmoj
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet