[
https://issues.apache.org/jira/browse/LUCENE-8860?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16910787#comment-16910787
]
Igor Motov commented on LUCENE-8860:
------------------------------------
I tried looking into this issue but I don't think we have enough information in
the inner node to make such determination. For example, if I index two
polygons: one L shaped polygon and another small triangle placed inside the
L-shape (see blue and green tessellated versions on fig 1):
!fig1.png!
Then all I have on the inner node level are minPackedValues and maxPackedValue
(depicted as purple rectangles on fig 2) this doesn't give me enough
information to determine if my query bounding box (red rectangle on fig 2)
intersects with blue triangle or not.
!fig2.png!
So, unless I misunderstood the proposal, I am not really sure how to achieve
that on the inner node level.
> 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
>
>
> 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]
