n-body-pairs

n-body-pairs
============
Given a collection of spheres with equal radii, find all pairwise intersections.

Usage
=====
First install using npm:

npm install n-body-pairs

Then use it as follows:

``javascript
//Load the library
var nbp = require("n-body-pairs")

//Create some points
var points = [
[0, 0, 0],
[1, 0, 0],
[0, 1, 0],
[0, 0, 100000000],
[0, 0, 100000001]
]

//Report all pairs of points which are within 1.1 units of eachother
nbp(points, 1.1, function(i,j) {
console.log("Overlap ("+i+","+j+"):", points[i], points[j])
})
//Prints:
//
// Overlap (0,3): [ 0, 0, 0 ] [ 0, 0, 1 ]
// Overlap (2,0): [ 0, 1, 0 ] [ 0, 0, 0 ]
// Overlap (1,0): [ 1, 0, 0 ] [ 0, 0, 0 ]
// Overlap (4,5): [ 0, 0, 100000000 ] [ 0, 0, 100000001 ]
//
`

$3

* points is an array of points
* radius is the radius of the overlap query
* callback(a,b) is a function which is called on each pair of points. If it returns a truthy value, then iteration is terminated.
* storage an optional storage data structure, created using allocateStorage. If not specified, it is created upon running the algorithm.

Time Complexity: O(points.length dimension 2^dimension * log(points.length) + number of intersections)

Space Complexity: Size of storage is O(points.length * 2^dimension)

$3

* max_points is the initial capacity of the storage
* dimension is the dimension of the point set

Returns: A new storage object for resolving the overlap queries

$3

* storage is the data structure to resize
* max_points is the new capacity of the storage
* dimension` is the dimension of the point set

Credits
=======
(c) 2013 Mikola Lysenko. BSD License