[
https://issues.apache.org/jira/browse/SOLR-2268?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12968556#action_12968556
]
Lance Norskog commented on SOLR-2268:
-------------------------------------
A second variation: a multiValued field of vertex pairs which contain a
polygon. The incoming point searches for vertex point. This is faster than the
bitwise filter, but uses more space for larger polygons. The bitwise filter
uses constant memory for each document.
> Add support for Point in Polygon searches
> -----------------------------------------
>
> Key: SOLR-2268
> URL: https://issues.apache.org/jira/browse/SOLR-2268
> 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: [email protected]
For additional commands, e-mail: [email protected]
