A module to check if a polygon self-intersects using the bentley-ottmann algorithm
This library allows you to find all intersections in a given set of segments.
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.
A module to check if a polygon self-intersects using a sweepline algorithm
Find self-intersections in geojson polygon (possibly with interior rings)
Bentley JavaScript core components
Culling Functionality for 3D Classes
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
General purpose validation library for JavaScript
iModel.js native module
A library of intersection algorithms covering all SVG shape types
Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).
Takes a GeoJSON feature and returns points at all self-intersections.
Underlying schema language parsed from arktype syntax.
A library of intersection algorithms covering all SVG shape types
iModel.js native module
CifUnits BIS Domains
Schema RPC Interface common interface
LinearReferencing BIS Domains
CifBridge BIS Domains
CifRail BIS Domains
PhysicalMaterial BIS Domains
RoadRailUnits BIS Domains
Units BIS Domains