Path: news.mathworks.com!not-for-mail
From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: The largest Triangle that can fit in convex hull
Date: Thu, 7 May 2009 23:02:03 +0000 (UTC)
Organization: Xoran Technologies
Lines: 12
Message-ID: <gtvp9b$ka8$1@fred.mathworks.com>
References: <b9bb3ca1-66f4-4c5f-9553-cd970bfb7eb1@v4g2000vba.googlegroups.com> <gtvnh1$nrf$1@fred.mathworks.com> <gtvoba$hrd$1@fred.mathworks.com>
Reply-To: <HIDDEN>
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 1241737323 20808 172.30.248.38 (7 May 2009 23:02:03 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Thu, 7 May 2009 23:02:03 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1440443
Xref: news.mathworks.com comp.soft-sys.matlab:538383


"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <gtvoba$hrd$1@fred.mathworks.com>...
> "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.
-------


The most general definition of a convex hull of a region S is the smallest convex region enclosing S. In particular, the convex hull need not be polyhedral and need not have vertices, e.g. the convex hull of an ellipse, or some more complicated curve.

Your posts seem to be assuming that the convex hull will have vertices...