Path: news.mathworks.com!not-for-mail
From: "Bruno Luong" <b.luong@fogale.findmycountry>
Newsgroups: comp.soft-sys.matlab
Subject: Re: finding minimum distance in a set of points
Date: Sat, 2 Aug 2008 11:25:04 +0000 (UTC)
Organization: FOGALE nanotech
Lines: 16
Message-ID: <g71g6g$1r8$1@fred.mathworks.com>
References: <g6v8fd$ntc$1@fred.mathworks.com> <bc2dfbf2-bf15-49ed-aac3-dab1d24e6c3b@34g2000hsh.googlegroups.com>  <5449ab65-b826-44bd-a160-c20959eccbb1@i76g2000hsf.googlegroups.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 1217676304 1896 172.30.248.35 (2 Aug 2008 11:25:04 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Sat, 2 Aug 2008 11:25:04 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 390839
Xref: news.mathworks.com comp.soft-sys.matlab:483271



Rune Allnor <allnor@tele.ntnu.no> wrote in message
<5449ab65-b826-44bd-a160-c20959eccbb1@i76g2000hsf.googlegroups.com>...
> On 2 Aug, 12:28, "Bruno Luong"
<b.lu...@fogale.findmycountry> wrote:
> 
> > In 2D, Delaunay complexity is O(N) is any case.
> 
> Could you prove that, please?
> 

Not me, but here is the reference paper:

P. McMullen. The maximum number of faces of a convex
polytope. Mathematika, 17:179&#8211;184, 1970.

Bruno