Adesh Nalpet Adimurthy

Data-driven structures for spatial indexing Adesh Nalpet Adimurthy · Follow Published in Towards Data Science · 10 min read · 16 hours ago — If you have been following the Spatial Index Series, it started with the need for multi-dimensional indexes and an introduction to space-filling curves, followed by a deep dive into grid systems (GeoHash and Google S2) and tessellation (Uber H3). In this post, let’s explore the R-Tree data structure (data-driven structure), which

Use of Tessellation for Spatial Indexing and how Uber H3 works Adesh Nalpet Adimurthy · Follow Published in Towards Data Science · 15 min read · Jun 17, 2024 — This post is a continuation of Spatial Index: Grid Systems where we will set the foundation for tessellation and head into the details of Uber H3 0. Foundation Tessellation or tiling is the process of covering/dividing a space into smaller, non-overlapping shapes that fit together

Grid Systems in spatial indexing using GeoHash and Google S2 Adesh Nalpet Adimurthy · Follow Published in Towards Data Science · 12 min read · Jun 12, 2024 — This post is a continuation of Stomping Grounds: Spatial Indexes, but don’t worry if you missed the first part—you’ll still find plenty of new insights right here. 3. Geohash Geohash: Invented in 2008 by Gustavo Niemeyer, it encodes a geographic location into a short string of