15:09:07shinmeraAnyone know of a data structure particularly suited for finding groups of objects that are all within a max distance from any other object within that group
15:09:38shinmeraas in, I want to iterate over disjoint sets of objects wherein every object within each set is less than a max-distance away from every other object within that set.
17:42:57shinmeraI'm wondering about this because usually you want to do a broad phase search that gives you sets of possible collisions, rather than going over every object and then doing a broad phase against objects in the neighborhood
18:10:12shinmeraHere's what I have so far https://plaster.tymoon.eu/view/3719#3719
18:10:23shinmera|3b|: I think you'd probably have some good insight on this as well ^
18:12:20shinmeraThe point of standardising the region struct is so that all implementations can use that one structure to receive information about the size of the area to query.
18:30:24shinmeragingerale: https://github.com/Shirakumo/3d-spaces it's here for now. I just copy pasted the files, will make them work with the interface tomorrow.
22:28:06|3b|in the paste, that RADIUS looks more like a diameter (if that matters), and i'd probably initialize Z to 0 when copying from vec2 in ensure-region
22:31:48|3b|and should REGION be coercing X,Y,Z to floats?