On Fri, Mar 27, 2015 at 12:27 AM, Mike Hansen wrote:
> There are a few things which could probably help with performance.
> Each document has only around say 30 polygons. You could do a binary
> search which would help reduce the cost. Additionally, I have a
> distinguished point contained inside
On Thu, Mar 26, 2015 at 9:06 PM, david.w.smi...@gmail.com
wrote:
> The second, (non-easy) part seems like it could be pretty slow:
>
> To determine “the smallest polygon which contains the point” for the
> current matching document, you’d have to iterate over them in
> smallest-to-largest-1 order
Hi Mike,
The second, (non-easy) part seems like it could be pretty slow:
Additionally, I'd like to have access to the
> numerical value of the smallest polygon which contains the point
> (something like makeDistanceValueSource).
To determine “the smallest polygon which contains the point” for t
I was wondering about the feasibility / difficultly of implementing a
solution to the following problem with Lucene.
For each document, I have a series of nested polygons each associated
with a numerical value. My search query gives a point, and I want to
return all of the documents whose largest
