Interesting - but there are license entanglements. I'm not in the non-commercial space :(

On Thu, Mar 27, 2014 at 3:45 PM, Sybren A. Stüvel <sybren@stuvel.eu> wrote:

Hi David,--On 27 March 2014 19:45, David Sauter <delwin@gmail.com> wrote:

I've got a current implementation that works using BG and r-tree but it's using an AABB that completely encompass the query area so I've got a lot of false positives to weed through. I'm looking for a cleaner way to query a large data set.Is there any way to query the r-tree with a non-axis aligned bounding box? If not is there a known way to do this query that I'm just overlooking?

The data set consists of X/Y plane squares of various sizes and at various coordinates within a known range. The tricky part is that I need to cull all but those that touch a small square area projected along a non-axis aligned vector.

I can't give you a Boost::Geometry answer, but I do know that the RAPID library implements a very efficient Oriented Bounding Box (OBB) tree implementation. You can find it at http://gamma.cs.unc.edu/OBB/

Best,

_______________________________________________

Geometry mailing list

Geometry@lists.boost.org

http://lists.boost.org/mailman/listinfo.cgi/geometry