Dec 9, 2025 · 3 min read · As we've seen, calculating locations in 2D space using latitude and longitude can be compute-intensive and time-consuming. However, queries and lookups in 1D are significantly faster. Therefore, we are exploring methods to map 2D coordinates (lat, lo...
Join discussionAug 26, 2025 · 15 min read · Introduction When developing games, physics simulations, or any interactive application with moving objects, collision detection becomes a critical performance bottleneck. The question "are any of these objects touching?" seems simple, but as your ob...
Join discussion
Apr 24, 2025 · 3 min read · Chào các bạn, đã có khi nào bạn đi hội họp xong, anh em bỗng có ý tưởng đi ăn, rồi bạn lên google map tìm kiếm quán ăn trong khu vực gần hiện tại hay chưa. Bạn có thắc mắc google làm cách nào có thể nhanh chóng tìm ra được quán ăn gần nhất không. Hôm...
Join discussion
May 29, 2024 · 13 min read · In Part 1 of our series, "Building a Proximity Service to Discover Nearby Gems," we laid the groundwork by defining the functional and non-functional requirements, performing back-of-the-envelope estimations, and proposing a high-level design. Now, i...
Join discussion
May 8, 2024 · 4 min read · 前情提要 大概是初中吧，我当时在给游戏开发模组，做了个界面，界面中面板之间要求不能堆叠，因为堆叠后不好处理点击事件等，我当时是通过遍历所有的面板去判断的，后来才知道可以用四叉树优化类似的需求。 还是得说一句，四叉树确实能优化这个需求，但提升不一定会明显，毕竟四叉树的时间复杂度是 logN，和 N 相比，只有在数据量大的时候才会有明显效果。 四叉树 那么四叉树是怎么提升效率的呢？先看一下原本的实现： function intersects (range, cur) { return !( ...
Join discussion
Sep 17, 2023 · 4 min read · My journey into map development began with the goal of implementing Mapbox into my Android project. Along the way, I discovered a game-changer: the Quadtree data structure. Although I hadn't directly applied Quadtree to my map development project, th...
Join discussion