Re: Spatial Search with Nested Polygons

2015-03-26 Thread Mike Hansen
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

Spatial Search with Nested Polygons

2015-03-26 Thread Mike Hansen
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