box-intersect-1d
Find all intersections in a collection of intervals.
Example
Full intersection
Here is how you can use this module to detect all intersections in a collection of intervals:
var boxIntersect1D = var boxes = 0 1 0 2 10 100 5 8 15 7 boxIntersect1D
Output
overlap: [ 0, 1 ] [ 0, 2 ]
overlap: [ 1.5, 7 ] [ 0, 2 ]
overlap: [ 5, 8 ] [ 1.5, 7 ]
Red-blue intersection
If you want to compare intersections between two different sets of intervals you can use the .bipartite
version of the test:
var boxIntersect1D = var red = 0 1 0 2 10 100 5 8 15 7 var blue = 0 100 1 2 -1 5 boxIntersect1D
Output
overlap: [ 0, 2 ] [ -1, 5 ]
overlap: [ 0, 2 ] [ 0, 100 ]
overlap: [ 0, 1 ] [ -1, 5 ]
overlap: [ 0, 1 ] [ 0, 100 ]
overlap: [ 0, 2 ] [ 1, 2 ]
overlap: [ 0, 1 ] [ 1, 2 ]
overlap: [ 1.5, 7 ] [ -1, 5 ]
overlap: [ 1.5, 7 ] [ 0, 100 ]
overlap: [ 1.5, 7 ] [ 1, 2 ]
overlap: [ 5, 8 ] [ -1, 5 ]
overlap: [ 5, 8 ] [ 0, 100 ]
overlap: [ 10, 100 ] [ 0, 100 ]
Install
npm install box-intersect-1d
API
var boxIntersect1D =
boxIntersect1D.full(boxes, visit)
Find all pairs of boxes which intersect
boxes
is an array of intervals represented by[lo,hi]
value pairsvisit(i,j)
is called for every pair over overlapping intervals with the index of the intervals. Ifvisit
returns any value other thanundefined
, then this terminates early with that value.
boxIntersect1D.bipartite(red, blue, visit)
Find all intersections between two sets of intervals
red
andblue
are two collections of intervals as described abovevisit(r,b)
is called once for every pair of intervals inred
andblue
which overlap.r
andb
are the indices of the overlapping boxes.
Credits
(c) 2014 Mikola Lysenko. MIT License