XPost: comp.theory, sci.math   
   From: chief@ockhamstyle.com   
      
   Gottfried Helms wrote:   
      
    > ...   
   >   
   >  for 2 dimension I would do it analoguously   
   >   
   > ...   
   >   
   >    for i=1 to n   
   >     for j=1 to n   
   > ...   
   >   
      
   As you see the complexity is proposed algorithm is at least O(n^2);   
   complexity of well known Convex Hull algorithms for 2 and 3   
   dimensions is O(n ln(n) ).   
      
   Regards   
   Mykola Rabchevskiy   
      
   [ comp.ai is moderated.  To submit, just post and be patient, or if ]   
   [ that fails mail your article to , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)