
Geometry : 
Subject: [geometry] Rtree segment query optimization
From: Jeremy Murphy (jeremy.william.murphy_at_[hidden])
Date: 20180410 14:33:15
Hi Adam and everyone else,
this isoriginally a theoretical question about the Rtree, but I'm also
interested in the practical aspect of how it applies to the Rtree in
Boost.Geometry.
How would I best optimize a KNN query if the data are points and the query
geometry is a segment, but I also want to only consider points that are on
the righthand side of the query segment (assuming that an orientation is
chosen for the segment and thus righthand side is defined).
I.e., is it better to use a useddefined predicate with `satisfies`, or a
builtin spatial query such as `within(Polygon)` (if that is possible)
where the Polygon is defined to cover a sufficient finite region of the
righthand side of the segment? Or some other way?
Thanks, cheers.
Jeremy
Geometry list run by mateusz at loskot.net