On Fri, Mar 27, 2015 at 12:27 AM, Mike Hansen <mhan...@gmail.com> 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 of all the nested polygons so I > can pre-compute the minimum and maximum distances from that point to > the edge of the polygon and use that to also reduce the number of > containment checks to do. I expect that there will be on the order to > 500-1000 documents considered for each search. > Oh right, they are *nested*; I overlooked that. I like your binary-search plan — makes sense. ~ David Smiley Freelance Apache Lucene/Solr Search Consultant/Developer http://www.linkedin.com/in/davidwsmiley
