This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: time spent searching the WBBST for the homein chain in tb is O (log( i / i +1 )). The sum telescopes, and its result is the dierence in the logs of two pseudotriangle sizes, which is no larger than O (log n ). The rayshooting algorithm traverses no more than O (log n ) triangles in total, giving the total runtime of O (log n ). 1 MIT OpenCourseWare http://ocw.mit.edu 6.851 Advanced Data Structures Spring 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms ....
View Full
Document
 Spring '10
 ErikDemaine
 Data Structures

Click to edit the document details