Question: Let P, Q be two polygons (not necessarily convex). Consider the planar subdivision (lets call it M) that is formed by overlaying P and Q.

 Let P, Q be two polygons (not necessarily convex). Consider the

Let P, Q be two polygons (not necessarily convex). Consider the planar subdivision (lets call it M) that is formed by overlaying P and Q. That is, two points q, q' are in the same face fi of M iff we can walk from q to q' without crossing any segment of aP nor any segment of aQ. Suggest an O((n + k) log n) time algorithm for computing a DCEL structure of M. Let P, Q be two polygons (not necessarily convex). Consider the planar subdivision (lets call it M) that is formed by overlaying P and Q. That is, two points q, q' are in the same face fi of M iff we can walk from q to q' without crossing any segment of aP nor any segment of aQ. Suggest an O((n + k) log n) time algorithm for computing a DCEL structure of M

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!