Rafael Schouten

Yeah, that sounds inconsistent. Maybe partially intentional, as much as you can say that about a new interface over a combinatorial set of possibilities with unclear implications. (Like I thought...

Ok let's throw an error, and people can use strict=false if they need it

Dimensional data.jl already handles point lookups a bit, see `mergedims`. But polygons etc need more work. Probably we make a GeometryLookups.jl package so everyone can use them?

1. `scatter` default is good for points with color as the values. if there is another dimension like time we plot points in 3d? and the same for lines/polygons etc...

For sure. Except for the nesting, and there should be optimisations for finding polygons on these grids?

Just using `Where` is funny, like that just works as is I guess we can accelerate that for GO predicates with an Extent index, if we use a Fix2

Have you looked at the python/R vector data cubes ? If we can use something already being standardised... (The CF standard is likely pretty arcane)

Ok guess we will have to implement it...

Thanks @martinfleis that's a great write-up @asinghvi17 I just realised the nested discrete global grid can be represented with a DimTree and geometry lookups. I think it will already work...

The generic geometry lookup we have should work, but slowly? But yes we need to make it abstract and specialise a few fast cases like hexagons as @meggart mentioned they...