[
https://issues.apache.org/jira/browse/LUCENE-8860?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16914594#comment-16914594
]
Igor Motov commented on LUCENE-8860:
------------------------------------
Thanks! It is clear now. I think I understood the part about the bounding box
queries and I opened PR based on it. Unfortunately, I don't see how to extend
this to the polygons queries. If we take a look at the fig3, the bounding box
for the red query completely encapsulates the green polygon's bounding box and
yet, we cannot make any conclusion about their intersection based on this
information.
!fig3.png!
> LatLonShapeBoundingBoxQuery could make more decisions on inner nodes
> --------------------------------------------------------------------
>
> Key: LUCENE-8860
> URL: https://issues.apache.org/jira/browse/LUCENE-8860
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Priority: Minor
> Attachments: fig1.png, fig2.png, fig3.png
>
> Time Spent: 10m
> Remaining Estimate: 0h
>
> Currently LatLonShapeBoundingBoxQuery with the INTERSECTS relation only
> returns CELL_INSIDE_QUERY if the query contains ALL minimum bounding
> rectangles of the indexed triangles.
> I think we could return CELL_INSIDE_QUERY if the box contains either of the
> edges of all MBRs of indexed triangles since triangles are guaranteed to
> touch all edges of their MBR by definition. In some cases this would help
> save decoding triangles and running costly point-in-triangle computations.
--
This message was sent by Atlassian Jira
(v8.3.2#803003)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
