4. Geometric Structures II

preview_player
Показать описание
MIT 6.851 Advanced Data Structures, Spring 2012
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
Рекомендации по теме
Комментарии
Автор

1:50 - 31:20 3D-orthogonal range searching in O(log(n)) query! or in general O(log^(d-2)(n)) query, last time it was (d-1) in exponent.
31:20 - 1:00:35 kinetic data-structures (moving data)
1:00:35 - 1:06:35 kinetic heap analysis
1:06:35 - 1:19:45 why is the #events = O(n*log(n))? proof.
1:19:45 - 1:22:08 other kinetic DSs results

aleksagordic