You are viewing a plain text version of this content. The canonical link for it is here.

Posted to dev@lucene.apache.org by "Karl Wright (JIRA)" <ji...@apache.org> on 2016/04/12 12:02:25 UTC

[jira] [Created] (LUCENE-7203) Improve O(N^2) GeoPolygon intersection computation performance

Karl Wright created LUCENE-7203:
-----------------------------------

             Summary: Improve O(N^2) GeoPolygon intersection computation performance
                 Key: LUCENE-7203
                 URL: https://issues.apache.org/jira/browse/LUCENE-7203
             Project: Lucene - Core
          Issue Type: Improvement
          Components: modules/spatial3d
    Affects Versions: master
            Reporter: Karl Wright
            Assignee: Karl Wright


Computing shape intersections with a polygon has an O(N^2) loop in it.  This can be removed if two bounds are discovered ahead of time to use instead.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org