What data structure is most counter-intuitive and has solved the most difficult data organization problem?
>>59904434
SUCCint loool!
>>59904434
What's that data structure for the crossing lines?
>>59904476
What do you mean?
>>59904508
The GEOMETRY one. Is that structure used to see if there are intersections between lines, or is it something used to keep information about lines after you've checked them for intersections with some algorithm?
>>59904549
I wouldn't know.
Dynamic hashed time travel for AI and user prediction/interaction?
this all look very relevant to my interests, can i get a rundown a la bog on how to learn this/prereq topics?
>>59904434
Check out bloom filters
>>59904549
It's an algorithm to find if, out of a set of lines, at least one pair intersect. Called sweeping/sweep line algorithm.
>>59904804
this
>>59905026
This. Finding intersections in a set of line segments relies on a clever algorithm; the data structures involved are not particularly interesting. (For the sweep line approach, at least.)