This preview shows page 1. Sign up to view the full content.
Unformatted text preview: while loop to search for the next shortest point tothe current (lower) point in the lower layer if these two points already form a base then use the next shortest distance when point is found, compare the two distance of that point to the two previous upper points form the triangle } The time complexity of this algorithm is O(m*n). 2. I made it to search for the nearest point in the upper or lower plane without having two triangles using the same base. 3. Mine does not always generate the optimal triangulation because it failed some test cases....
View
Full
Document
This note was uploaded on 02/19/2012 for the course ENGR 361 taught by Professor Drexel during the Spring '12 term at Bloomsburg.
 Spring '12
 Drexel

Click to edit the document details