A module to check if a polygon self-intersects using the bentley-ottmann algorithm
JavaScript
0
0
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of homfen/bentley-ottmann-intersections
Fast robust predicates for computational geometry
The smallest and simplest JavaScript priority queue
Run scripts that set and use environment variables across platforms
A strict ESLint config for my JavaScript projects
the most correct and second fastest glob implementation in JavaScript
json loader module for webpack
JavaScript library for mobile-friendly interactive maps
the Istanbul command line interface
Rollup plugin to minify generated es bundle
The progressive JavaScript framework for building modern web UI.
template compiler for Vue 2.0
Packs ECMAScript/CommonJs/AMD modules for the browser. Allows you to split your codebase into multiple bundles, which can be loaded on demand. Supports loaders to preprocess files, i.e. json, jsx, es7, css, less, ... and your custom stuff.
CLI for webpack & friends
Serves a webpack app. Updates the browser on changes.
Fast Splay tree for Node and browser
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.
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet