lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Lance Norskog (JIRA)" <>
Subject [jira] Commented: (SOLR-2268) Add support for Point in Polygon searches
Date Tue, 07 Dec 2010 02:59:11 GMT


Lance Norskog commented on SOLR-2268:

2 tricks for speeding up "document holds polygons", using vertex-based hashing of lat/long
values. (It's a variation on a kind of bitwise filtering whose name I cannot remember: if
the bit is off, there is no match, but if the bit is on there may be a match.)

Master data: A field with one or more polygon descriptions.
Bitwise data: Two bit fields, latitude&longitude, with a string of bits for each vertex.
For example, given a Level Of Detail (LOD) of 1 degree, there would be 360 bits in either
bitfield. The document would have one of each bitfield. Each degree's bit is true if any polygon
has area within that bit's degree. 

The first phase of searching for point in all polygons is to check the latitude and longitude
bitfields for that point.

> Add support for Point in Polygon searches
> -----------------------------------------
>                 Key: SOLR-2268
>                 URL:
>             Project: Solr
>          Issue Type: New Feature
>            Reporter: Grant Ingersoll
>            Assignee: Grant Ingersoll
> In spatial applications, it is common to ask whether a point is inside of a polygon.
 Solr could support two forms of this: 
> # A field contains a polygon and the user supplies a point.  If it does, the doc is returned.
> # A document contains a point and the user supplies a polygon.  If the point is in the
polygon, return the document
> With both of these case, it would be good to support the negative assertion, too.

This message is automatically generated by JIRA.
You can reply to this email to add a comment to the issue online.

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message