MIT6_851S10_assn03

MIT6_851S10_assn03 - where every pseudo-triangle has only...

Info icon This preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
6.851 Advanced Data Structures (Spring’10) Prof. Erik Demaine Dr. Andr´ e Schulz TA: Aleksandar Zlateski Problem 3 Due: Thursday, Feb. 25 Be sure to read the instructions on the assignments section of the class web page. Ray Shooting in Simple Polygons. 1. Let w 1 , w 2 , . . . , w k be positive weights we want to store in a weight balanced binary search tree (WBBST). We denote j k w j by W . To built the WBBST we find the unique element w r such that the sums j<r w j and j>r w j are both at most W/ 2. We make the element w r the root of the WBBST and recurse on the two remaining subsets (left and right of w r ). (a) Show that we can search for an item with weight w i in the WBBST in O (1+log( W/w i )) time. (b) To search through all home-in situations that occur during the ray shooting algorithm we use a WBBST for every concave chain of the balanced pseudo-triangulation. For an edge we choose as weight its bay-size (= number of edges of the opposing polygon). Show that we can answer the searches for all home-in situations using O (log n ) time in total. 2. By adding additional interior points we can transform a balanced pseudo-triangulation into a pseudo-triangulation
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: where every pseudo-triangle has only one concave chain. Since we add at most 6 new pseudo-triangles any line intersects at most O (log n ) of these special pseudo-triangles. Show how to triangulate the special pseudo-triangles using additional points, such that any line intersects at most O (log 2 n ) triangles. Δ (i) (ii) ±igure 1: The bay-sizes of the red chain of Δ in (i) are from left to rigth: 7,3,1,6. Picture (ii) shows how to decompose a pseudo-triangle into pseudo-triangles with at most one concave chain using additional points. 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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern