Comment on Ask HN: Fast data structures for disjoint intervals?Comments−hackermailman2yErik Demaine's DS class has a bunch of range trees and cascading method to speed up queries https://courses.csail.mit.edu/6.851/spring21/lectures/−alex52072yHis explanations are great and just wanted to +1 on the idea of range trees. Adding a reference here to a very lightweight read on range trees:https://courses.csail.mit.edu/6.851/spring10/scribe/lec03.pd...−grovesNLOP2yThanks, I came across some of Erik's videos in my research but I didn't realize they were part of a bigger series focused on ranges. Cascading methods are exactly the kind of ideas I'm thinking about.
Comments
Erik Demaine's DS class has a bunch of range trees and cascading method to speed up queries https://courses.csail.mit.edu/6.851/spring21/lectures/
His explanations are great and just wanted to +1 on the idea of range trees. Adding a reference here to a very lightweight read on range trees:
https://courses.csail.mit.edu/6.851/spring10/scribe/lec03.pd...
Thanks, I came across some of Erik's videos in my research but I didn't realize they were part of a bigger series focused on ranges. Cascading methods are exactly the kind of ideas I'm thinking about.