Find self-intersections in geojson polygon (possibly with interior rings)

Takes a GeoJSON feature and returns points at all self-intersections.

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.

Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph

Triangulation and Boolean Operations for 2D Polygons. Supported operations: intersection, union, difference, XOR, and self-intersections for all polygon varieties.

A module to check if a polygon self-intersects using a sweepline algorithm

Find self-intersections in a polygon

Bentley-Ottman Algorithm for Validating Self-Intersections in Polygons

Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph

Boolean Operations for 2D Polygons. Supported operations: intersection, union, difference, XOR, and self-intersections for all polygon varieties.

Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).

Culling Functionality for 3D Classes

The fastest and smallest JavaScript polygon triangulation library for your WebGL apps

Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.

General purpose validation library for JavaScript

A library of intersection algorithms covering all SVG shape types

Add a __self prop to all JSX Elements

A command line utility to work with Sentry. https://docs.sentry.io/hosted/learn/cli/

Underlying schema language parsed from arktype syntax.

Checks if two geometries have no overlapping areas.