A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.
MIT License
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differe...
2d collision routines
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Javascript wrapper around Triangle - A Two-Dimensional Quality Mesh Generator and Delaunay Triang...
Bentley Ottman Algorithm to Validate Convex and Simple Polygons
Clean up messy planar straight line graphs
Exact predicate to test if two line segments intersect
2D constrained Delaunay triangulation
Ready for contest use! Data structures and algorithms in pure JavaScript with zero dependency.
Line vs line, point vs line in 2D space
find self-intersections in a 2d polygon