From the Last Lecture Line segment intersection by cqe15118

VIEWS: 0 PAGES: 1

									                                                          From the Last Lecture:
            Heapsort
                                                        Line segment intersection
                                   Heap
                                                    • J. L. Bentley and T. A. Ottmann, "Algorithms for
                                                      reporting and counting geometric intersections”,
                                                      Transactions on Computing, vol. 28, pp. 643-647,
                      Lecture 15
                                                      1979.
                                                    • An intersection can be found in O(n log n) time
                                                      using a technique known as line-sweep (or plane-
    Balanced                                          sweep).
Binary Search Trees
                               Riley 9.4-9.6, 9.8   • Crucial assumption: Two involved binary search
                               Cormen 6, 13           trees are balanced.
                                                    • How do we ensure this?

                                                                       Lecture 15 - Håkan Jonsson        2

								
To top