Prepared geometry

[asinghvi17]

This is on top of the trees PR, to enable prepared geometry. The idea is that we should be able to do index = get(geometry, EdgeTreeLike, NaturalEdgeTree) and have it give us some form of edge tree we can query.

Prepared geoms will be structured as wrappers, with a single geom field and then a tuple of "preparations". Note that this can't influence the underlying geometry memory layout at all - although Prepared will default to calling tuples, maybe deactivated by a keyword tuples = false.

Preparations need to have a desired application trait / level. It's a bit tricky because things like STRtrees can apply at the polygon level, multipolygon level, and at the level of individual polygon rings (might be useful for things like a country with a lot of lakes).

We should be able to "get" or instantiate a preparation by get(geom, SpatialIndexLike#=or trait=#, STRIndex) for example, since most algorithms that can be accelerated only care that you have an accelerator, not how you got it. And the main part of the runtime is creating the index anyway.

[asinghvi17]

Warning

This pull request is not mergeable via GitHub because a downstack PR is open. Once all requirements are satisfied, merge this PR as a stack on Graphite.
Learn more

• Prepared geometry #278 👈 (View in Graphite)
• Tree based acceleration for polygon clipping / boolean ops #274 : 1 other dependent PR (#283 )
• Algorithm + manifold and accelerator passthrough in clipping functions #273
• Spatial tree interface #297
• Convert the orient predicate to AdaptivePredicates + minor predicate changes #275
• Add a TGGeometry extension for fast inexact geometric predicates #271 : 1 other dependent PR (#291 )
• [Core] Add an algorithm interface + StableTasks #269 : 1 other dependent PR (#282 )
• main

This stack of pull requests is managed by Graphite. Learn more about stacking.