fast-triangle-triangle-intersection
Fast and robust triangle-triangle intersection test with high precision for cross and coplanar triangles based on the algorithm by Devillers & Guigue.
Fast and robust triangle-triangle intersection test with high precision for cross and coplanar triangles based on the algorithm by Devillers & Guigue.
ILists is a pair of key iterable list and value iterable list, with unique keys.
ILists is a pair of key iterable list and value iterable list, with unique keys {web}.
A pack of functions for working with Sets {web}.
A sorted array is a collection of values, arranged in an order.
A sorted array is a collection of values, arranged in an order {web}.
A collection of methods for working with Objects {web}.
Reference Implementation of the Dufour-Peyton Intersection Algorithm. Calculates the Intersections of Arbitrary Polygons with a Geospatial Raster.
Bezier curve intersection algorithm and utilities
geo json operation
Low-Level GeoSpatial Masking Functions
A libraray for Isochrone, Routing & geoprocessing GeoJson Data
An abstract layer that would make using intersection observer easier