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 22:46:02 +0000 (UTC)
Organization: FOGALE nanotech
Lines: 7
Message-ID: <gtvoba$hrd$1@fred.mathworks.com>
References: <b9bb3ca1-66f4-4c5f-9553-cd970bfb7eb1@v4g2000vba.googlegroups.com> <gtvnh1$nrf$1@fred.mathworks.com>
Reply-To: "Bruno Luong" <b.luong@fogale.findmycountry>
NNTP-Posting-Host: webapp-05-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1241736362 18285 172.30.248.35 (7 May 2009 22:46:02 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Thu, 7 May 2009 22:46:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 390839
Xref: news.mathworks.com comp.soft-sys.matlab:538381


"Matt " <xys@whatever.com> 
> 
> Convex hull of what? 

No need for precision. A convex hull is generally defined as {x : A*x <= b }. That's enough to work with. Of course, it must be bounded so as the maximizing triangle exists.

Bruno