Create quadtrees from lines/polygons/points #2
Description
It'd be nice to be able to create a quadtree from vector data. User could specify the minimum cell size, and then any quadrant that had a segment running through it would split until the minimum cell size is met.
For points, there could be some different ways to do it. You could split a quadrant whenever there's more than one (or some user-defined threshold) point in the quadrant. You could make the value binary, or, if more than one point is allowed per quadrant, the value could be the number of points.
Another interesting idea is to use the value of points rather than the point location. This would actually be very similar to what I'm doing now with rasters - at each step it'd check the values of the points and use that to decide whether or not to split. Not entirely sure how useful this would be, but it sounds cool.