6 replies to this topic

[fread]

I have an assignment on the convex hull problem. There are numerous approaches available on-line, but i cant seem to figure out where to start on paper or the shape of the algorithm. Anyone here ever dealt with the "Convex Hull" problem.

[WingedPanther]

How many dimensions are you doing this in?

[fread]

I suppose the implementation would be in one dimension. Although wikipedia describes it in a plane which is 2d. He gave no handouts or guides. He said look it up on-line.

[WingedPanther]

It would have to be at least 2d, but could be 3d (bounding by planes).

[fread]

Its in two dimensions i confirmed this in class today.

[WingedPanther]

Just a thought, I'd find the point with the highest x value and use that as the starting point on my hull. Then I'd check the slope between that point and all others. The two with the smallest positive and negative slopes would be my next two points on either side, and proceed something like that.

[fread]

i working up a similar approach on paper. ill let you know how it goes...