This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: where every pseudotriangle has only one concave chain. Since we add at most 6 new pseudotriangles any line intersects at most O (log n ) of these special pseudotriangles. Show how to triangulate the special pseudotriangles using additional points, such that any line intersects at most O (log 2 n ) triangles. Δ (i) (ii) ±igure 1: The baysizes of the red chain of Δ in (i) are from left to rigth: 7,3,1,6. Picture (ii) shows how to decompose a pseudotriangle into pseudotriangles 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
 Spring '10
 ErikDemaine
 Polygons, Data Structures, WBBST, concave chain

Click to edit the document details