Path: news.mathworks.com!newsfeed-00.mathworks.com!newsfeed2.dallas1.level3.net!news.level3.com!postnews.google.com!m3g2000hsc.googlegroups.com!not-for-mail
From: Rune Allnor <allnor@tele.ntnu.no>
Newsgroups: comp.soft-sys.matlab
Subject: Re: finding minimum distance in a set of points
Date: Sat, 2 Aug 2008 05:41:17 -0700 (PDT)
Organization: http://groups.google.com
Lines: 21
Message-ID: <e3533450-2671-4b94-839c-ce0d3c7b04de@m3g2000hsc.googlegroups.com>
References: <g6v8fd$ntc$1@fred.mathworks.com> <bc2dfbf2-bf15-49ed-aac3-dab1d24e6c3b@34g2000hsh.googlegroups.com> 
NNTP-Posting-Host: 212.17.141.54
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
X-Trace: posting.google.com 1217680877 30149 127.0.0.1 (2 Aug 2008 12:41:17 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sat, 2 Aug 2008 12:41:17 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: m3g2000hsc.googlegroups.com; posting-host=212.17.141.54; 
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; SV1; .NET 
Xref: news.mathworks.com comp.soft-sys.matlab:483274



On 2 Aug, 13:25, "Bruno Luong" <b.lu...@fogale.findmycountry> wrote:
> Rune Allnor <all...@tele.ntnu.no> wrote in message
>
> <5449ab65-b826-44bd-a160-c20959ecc...@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.

Have you actually read the paper or do you merely refer
to what you think it says?

Rune