libera/#shirakumo - IRC Chatlog
Search
15:09:07
Colleen
<shinmera> Anyone 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:38
Colleen
<shinmera> as 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:39:34
Colleen
<selwyn> you could build a graph where objects are vertices and they are connected if they are less than max distance away from each other
17:42:57
Colleen
<shinmera> I'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
17:48:22
Colleen
<selwyn> and it's guaranteed that each set has every member being at most n*max distance away from each other
17:56:52
Colleen
<shinmera> No, none of those structures really give you an idea about adjacency or clustering, which is what I'm interested in.
18:05:52
Colleen
<gingerale> shinmera: What's the new library with data structures called so I can clone it?
18:12:20
Colleen
<shinmera> The 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:24
Colleen
<shinmera> gingerale: 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.
19:28:53
Colleen
<shinmera> gingerale: also looks like your emacs config still creates files with CRLF rather than LF by default.
19:35:36
Colleen
<gingerale> I checked. I have "(set-buffer-file-coding-system 'utf-8-unix)" in .emacs file
20:56:35
Colleen
<selwyn> but that presumably isn't helpful - you want the smallest number of disjoint sets
20:59:40
Colleen
<shinmera> one of the primary issues I can see is that you need very fast updates to the structure.
20:59:55
Colleen
<shinmera> objects will move a lot and new objects being added cannot be too expensive, or it would lead to lag.
21:10:41
Colleen
<selwyn> do you know if it's still possible to get a free copy of windows with azure?
21:11:16
Colleen
<shinmera> There's other ways to get copies and I can just keep cloning the same VM.
22:15:59
Colleen
<|3b|> ACTION probably doesn't have any useful ideas for data structure, but isn't really sure what you are asking for anyway...
22:16:45
Colleen
<|3b|> if you have a regular grid of points, do you want it to return either a group per point or 1 group for whole thing depending on distance?
22:28:06
Colleen
<|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