Intersection Packages

An Alpine.js plugin to easily add CSS classes to an element when it enters the viewport.

Alpine JS magic helper that determines when elements overlap or intersect each other, perfect for menus, tooltips, modals, and collision detection 🥞

A BVH implementation to speed up raycasting against three.js meshes.

This will return the array of objects that are common in a set of array of objects based on single or multiple keys

This package includes a set of useful array methods that facilitates working with arrays, specifically the arrays that contain objects or arrays even falsy values (such as: 0, null, false, NaN...). This package is es5 supported.

Extremely fast set and map/reduce operations for Arrays and Sets plus CartesianProducts

Handle your array objects with ease

A utility library providing common array manipulations and React hooks.

This will return the array of objects that are common in a set of array of objects based on single or multiple keys

A collection of common algorithm ulities including Binary Search

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

Bezier curve intersection algorithm and utilities

Dynamic BVH implementation based on Erin Catto's paper.

Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.

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

Simple Javascript IntersectionObserver implementation for Ember applications.

A sorted array is a collection of values, arranged in an order {web}.

ILists is a pair of key iterable list and value iterable list, with unique keys {web}.

ILists is a pair of key iterable list and value iterable list, with unique keys.

An iterable is a sequence of values {web}.