PDA

View Full Version : Convex Hull Problem



blooddrunk
November 6th, 2008, 10:48 PM
Hi! I have to implement the Divide&Conquer version of the Convex Hull algorithm. I ran into a bit of trouble, which I can't work out for days.

After splitting the set of points into two and recursively running it, there comes a part when the two arrays/list have to be merged. This is the part I do not understand. I read that one has to find the tangents but how do you do that? What is the algorithm to actually find those tangents?

10x in advance