Spatial subdivision with fast indexing on a sphere is quite useful for mapping. We want map tiles to be of close to constant size and shape, and find the tile f

Spatial subdivision with fast indexing on a sphere is quite useful for mapping. We want map tiles to be of close to constant size and shape, and find the tile for any point on Earth. Usually, subdividing the faces of a Platonic solid is the way to go. This post describes tessellation of triangles on the faces of an octahedron. The dual approach is squares on the faces of a cube. A good implementation of this is s2 [1]. [1] http://s2geometry.io/ http://s2geometry.io/