A module to check if a polygon self-intersects using a sweepline algorithm
Find self-intersections in geojson polygon (possibly with interior rings)
A module to check if a polygon self-intersects
Culling Functionality for 3D Classes
General purpose validation library for JavaScript
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Takes a GeoJSON feature and returns points at all self-intersections.
Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).
Underlying schema language parsed from arktype syntax.
A library of intersection algorithms covering all SVG shape types
A library of intersection algorithms covering all SVG shape types
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.
TypeScript definitions for svg-intersections
GeoJSON Utilities for JavaScript
Fast point-in-polygon intersection for large numbers of polygons.
Area Proportional Venn and Euler Diagrams
TypeScript definitions for polygon-lookup
Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.
This library allows you to find all intersections in a given set of segments.
Checks if two geometries have no overlapping areas.
determine if a point is inside a polygon with a ray intersection counting algorithm
Runtime validation for static types
Checks if two geometries overlap in any way.
Underlying schema language parsed from arktype syntax.