A module to check if a polygon self-intersects using a sweepline algorithm
A very simple script to compute all self-intersections in a GeoJSON polygon.
Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph
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.
Triangulation and Boolean Operations for 2D Polygons. Supported operations: intersection, union, difference, XOR, and self-intersections for all polygon varieties.