Path: news.mathworks.com!not-for-mail
From: "Bruno Luong" <b.luong@fogale.findmycountry>
Newsgroups: comp.soft-sys.matlab
Subject: Re: The largest Triangle that can fit in convex hull
Date: Thu, 7 May 2009 21:48:01 +0000 (UTC)
Organization: FOGALE nanotech
Lines: 12
Message-ID: <gtvkuh$443$1@fred.mathworks.com>
References: <b9bb3ca1-66f4-4c5f-9553-cd970bfb7eb1@v4g2000vba.googlegroups.com> <a3eecd7c-3fb1-4f8f-ba6c-0e39057b0279@j12g2000vbl.googlegroups.com> <gtvifq$dur$1@fred.mathworks.com> <gtvjn5$979$1@fred.mathworks.com>
Reply-To: "Bruno Luong" <b.luong@fogale.findmycountry>
NNTP-Posting-Host: webapp-03-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1241732881 4227 172.30.248.38 (7 May 2009 21:48:01 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Thu, 7 May 2009 21:48:01 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 390839
Xref: news.mathworks.com comp.soft-sys.matlab:538366


"John D'Errico" <woodchips@rochester.rr.com> wrote in message <gtvjn5$979$1@fred.mathworks.com>...

> 
> I'll claim that this is an O(N^3) operation, as
> pointed out in my response.
> 

John, I'll claim that by book keeping correctly the couple of vertexes, the third one can be found in constant time (no need to go the full round the hull to find it). Think like a basic move of simplex method. ;-)

Do I miss something?

Bruno