This preview shows page 1. Sign up to view the full content.
Unformatted text preview: rectangle connecting a point left of or at x and a point right of or at x contains a point. Now consider the two subsets of X , X x x and X x x , each with at most m points, and at most n 2 distinct x values. We recursively apply the same technique, to obtained point set that is Aborally Satised . We get the number of newly inserted points by solving the recursion N ( m, n 2 ) = 2 N ( m, n 2 ,n ) + m . The total number of accesses is then O ( N ( m,n ) + m ) = O ( m log n + m ) = O ( m log n ). 1...
View Full Document
This note was uploaded on 01/20/2012 for the course CS 6.849 taught by Professor Erikdemaine during the Fall '10 term at MIT.
- Fall '10
- Data Structures