1 views collected around this technical thread.
This article introduces the GeoHash algorithm, explains how latitude and longitude are recursively bisected into binary strings, compressed with Base32, and demonstrates its use for efficiently locating nearby drivers in ride‑hailing services while discussing precision trade‑offs and edge cases.
This article explains the GeoHash algorithm, describing how latitude‑longitude coordinates are converted into binary strings and Base32 codes, how these codes enable efficient proximity searches such as finding nearby ride‑hailing passengers, and discusses the limitations of the approach.
This article introduces the Beidou Grid Code, its theoretical foundation in GeoSOT, detailed hierarchical encoding rules, implementation challenges using MySQL and JPA, and showcases practical urban management applications such as case reporting, hotspot analysis, indoor positioning, and data security.
Geohash encodes latitude‑longitude pairs into short base‑32 strings by recursively bisecting coordinate ranges and interleaving bits, allowing fast proximity queries via prefix matching, with precision controlled by string length, and is supported natively in Redis and useful for location‑based services.
This article introduces space-filling curves such as Z‑ordering, Hilbert, and XZ‑Ordering, explaining their mapping algorithms and how they transform multidimensional spatial data into one‑dimensional indices for efficient storage and querying in key‑value databases, while discussing challenges and practical examples.
By encoding billions of GPS points and ten thousand district polygons into GeoHash cells, using exact matches, approximate filtering, neighbor‑cell lookup tables, and a final precise geometry test, the authors cut the required operations from 2×10^20 to about 1.8×10^12, enabling full processing in under a day.
The article explains how geo‑fencing relies on fast point‑in‑polygon checks, compares the basic ray‑casting method with brute‑force performance, and shows how spatial R‑tree indexing—both on polygon bounding boxes and on individual edges—dramatically speeds up queries even for millions of complex polygons.
This article explains the GeoHash algorithm, how it converts latitude‑longitude coordinates into hierarchical string codes, the precision trade‑offs of different code lengths, the binary encoding process, the use of space‑filling curves, and practical considerations when applying GeoHash for nearby point‑of‑interest searches.