Details
-
Improvement
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
6.0
-
None
-
New
Description
mikemccand's benchmark for polygon search shows that constructing Geo3D polygon queries is quite expensive compared to other technologies. My belief is that this is due largely to how an interior point for determination of clockwise/counterclockwise are found: this is currently searched for randomly across the entire globe.
I suspect that we could replace this algorithm with a random algorithm that uses one of the polygon's edge points and looks randomly within a small distance of that point. This would greatly reduce the number of failed attempts to find a "pole" (as I call it).