Summary

Keywords

6-851-advanced-data-structures-spring-2012 fractional cascading kinetic predecessor kinetic priority queue moving data o(log n) orthogonal range searching

Full Transcript

MIT 6.851 Advanced Data Structures, Spring 2012 View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Fractional cascading in 3D orthogonal range searching in O(log n) time. Moving data, e.g., where 2D points move at known velocity and acceleration: kinetic predecessor and kinetic priority queues. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

30-Day Beginner Guitar Challenge for New Players

Master the Guitar in 30 Days: Your Ultimate Beginner Challenge! Unleash your inner guitarist with step-by-step lessons designed to transform you from novice to confident player. Join Your Guitar Academy and kickstart your musical journey today!

⭐ 4.3

36 ratings

7 hours