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: Fri, 8 May 2009 00:06:02 +0000 (UTC)
Organization: FOGALE nanotech
Lines: 8
Message-ID: <gtvt1a$leg$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> <gtvp9b$ka8$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 1241741162 21968 172.30.248.38 (8 May 2009 00:06:02 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Fri, 8 May 2009 00:06:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 390839
Xref: news.mathworks.com comp.soft-sys.matlab:538389


> 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.
> 

The example you gave can be still considered as intersection of half planes Matt. In the definition the matrix A and b can have infinity number of rows (A is just a linear operator between two vectorial spaces, no need to be R^m to R^n).

I assume the computer does not have infinity memory, of A and b is finite matrix. And yes, if they are finite, vertexes are indeed defined when A has finite size.

Bruno