[
https://issues.apache.org/jira/browse/LUCENE-7669?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15852732#comment-15852732
]
Robert Muir commented on LUCENE-7669:
-------------------------------------
{quote}
Maybe a more general way to solve this problem would be to use multiple grids
in case of multipolygons whose sub polygons are far from each other, for
instance the Netherlands plus the Caribbean Netherlands. We could organize
those multiple grids in a KD tree similarly to Polygon2D.
{quote}
I also think this is heading down the wrong path. We had a grid for polygon
search before, and worked hard to remove it. Its good that you made a faster
grid, but we should work to remove it yet again.
Instead of optimizing optimizations for rare cases like dutch colonialism and
searches of the fiji islands, we should e.g. look at speeding up polygon2d's
kd-tree so the general case is faster.
> Rectangle.fromPolygon could compute smaller bounding boxes
> ----------------------------------------------------------
>
> Key: LUCENE-7669
> URL: https://issues.apache.org/jira/browse/LUCENE-7669
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Priority: Minor
> Attachments: LUCENE-7669.patch
>
>
> Currently it computes the smallest bounding box that does not cross the
> dateline. However allowing to cross the dateline could allow to create
> smaller bounding boxes. For instance, because of that, the bounding box of
> the Russia polygon has a width of 360 longitude degrees. By allowing
> rectangles that cross the dateline, we could get a polygon whose width is
> only 171 longitude degrees. This is useful combined with LUCENE-7661 since it
> means the grid would have higher resolution.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
