Summary: Find rectangles containing a given dot

Description:
Given a set of rectangles and a set of dots, the algorithm implemented in
this modules finds for every dot, which rectangles contain it.

The algorithm complexity is O(R * log(R) * log(R) + D * log(R)) being R the
number of rectangles and D the number of dots.

Its usage is very simple:

URL: http://search.cpan.org/dist/Algorithm-RectanglesContainingDot
License: GPL+ or Artistic

Maintainer: nobody