Fast robust predicates for computational geometry in JavaScript
JavaScript
304
17
The Unlicense
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mourner/robust-predicates
output coverage reports using Node.js' built in coverage
A strict ESLint config for my JavaScript projects
Recursively mkdir, like `mkdir -p`
Exact arithmetic test to check if point is contained in sphere
Find the floating point number immediately after any given number
Exactly computes the orientation of a tuple of points
Support the repos that depend on mourner/robust-predicates
Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Split a polygon using a polyline.
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Vendored dependencies for MUI X Charts
A small library for constraining a Delaunator triangulation
Find the triangle of a Delaunator triangulation that contains a given point
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
RVGeo is a frontend TypeScript library for simple special data computation and rendering.
Open Hybrid Positioning System
Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
A module to check if a polygon self-intersects using the bentley-ottmann algorithm
Compute visibility polygons by Triangular Expansion
Slices Polygon using a LineString
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet