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

TypeScript definitions for svg-intersections

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

Finds intersections between semantic version ranges.

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

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

Reference Implementation of the Dufour-Peyton Intersection Algorithm. Calculates the Intersections of Arbitrary Polygons with a Geospatial Raster.

Gets all intersections of provided fields

This library allows you to find all intersections in a given set of segments.

A library of intersection algorithms covering all SVG shape types

A library of intersection algorithms covering all SVG shape types

intersections between bezier curves of order 2, 3 and lines and rectangles

2D intersections and bounds for line segments, circles, ellipses, arcs, and Bezier curves

Takes nodes and ways and turn them into a normalized graph of intersections and ways.

Given a collection of spheres with equal radii, find all pairwise intersections.

Standalone library to get all intersections between 2 SVG paths

Geometry engine API for AEC applications - NURBS, meshes, booleans, intersections. Powered by Rust/WASM.

retikz math: zero-dependency pure computational geometry (intersections, circles, hull) shared by core and domain packages.

Delete GeoJSON polygon intersections