We closed this forum 18 June 2010. It has served us well since 2005 as the ALPHA forum did before it from 2002 to 2005. New discussions are ongoing at the new URL http://forum.processing.org. You'll need to sign up and get a new user account. We're sorry about that inconvenience, but we think it's better in the long run. The content on this forum will remain online.

Index › Programming Questions & Help › OpenGL and 3D Libraries › for a more concise algorithm

yiyangchen2009 YaBB Newbies Offline Posts: 20	for a more concise algorithm Mar 12th, 2009, 3:33pm   Hello everyone. Suppose I was given n vertice on a x-y plane,and I want to make an convex hull of them. In this case,an algorithm of less complexity is in need.How to do that in a less complicated way? Thank you.

JohnG Ex Member	Re: for a more concise algorithm Reply #1 - Mar 12th, 2009, 4:07pm   There are many algorithms for doing it, all with varying levels of complexity. As far as I know the simplest method you're going to find will have a complexity of O(n log n). A quick google will give you a couple of examples of algorithms with such an average case time.

yiyangchen2009 YaBB Newbies Offline Posts: 20	Re: for a more concise algorithm Reply #2 - Mar 12th, 2009, 4:19pm   Thank you! I'll try to write it myself,and welcome any other examples in processing!Thanks!