binkle on Nostr: what about 3 arrays of ranges representing the extent in each dimension of axis ...
what about 3 arrays of ranges representing the extent in each dimension of axis aligned bounding boxes. You could use binary search in each direction to determine whether any given object is inside one or more boxes.
That seems like it would be pretty fast and cache locality would be pretty good. Also the data would be sparse (only the a pair per-range) so it cuts down on the storage required
Published at
2024-09-18 17:09:31Event JSON
{
"id": "e07d65cab5df2e5bc3ed4b43603a84826302ca1c60a1251224280c9979ecba99",
"pubkey": "b3482fd6b7d6ee4fd5b25a54f73d7eeb2047979b85c0ab2b029274a0c3dea86e",
"created_at": 1726679371,
"kind": 1,
"tags": [
[
"proxy",
"https://clubcyberia.co/objects/cc314b9e-c0e8-45ea-8a3f-2f9d9ddd2c39",
"activitypub"
]
],
"content": "what about 3 arrays of ranges representing the extent in each dimension of axis aligned bounding boxes. You could use binary search in each direction to determine whether any given object is inside one or more boxes. \n\nThat seems like it would be pretty fast and cache locality would be pretty good. Also the data would be sparse (only the a pair per-range) so it cuts down on the storage required",
"sig": "77e60b588268cadd12e00372eb064c2c82b35f7fd63c9a2d7b221ae27aa9d6eeb297a7de86b1c421cf7d6a621b8c2342a6bd4d72f5546d3a826e2cbfdc007602"
}
