Path: news.mathworks.com!not-for-mail
From: "amit " <amit_tilwankar@yahoo.com>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Finding similar entries
Date: Wed, 21 May 2008 17:15:03 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 16
Message-ID: <g11lan$2ps$1@fred.mathworks.com>
References: <fq0ple$qos$1@fred.mathworks.com> <fq17qb$2b2$1@fred.mathworks.com> <fq1k3m$jl$1@fred.mathworks.com> <fq1o6c$1v5$1@fred.mathworks.com> <fq1s5q$oot$1@fred.mathworks.com> <fq1t1t$9ql$1@fred.mathworks.com>
Reply-To: "amit " <amit_tilwankar@yahoo.com>
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 1211390103 2876 172.30.248.38 (21 May 2008 17:15:03 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Wed, 21 May 2008 17:15:03 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 885523
Xref: news.mathworks.com comp.soft-sys.matlab:469719


"Bruno Luong" <b.luong@fogale.fr> wrote in message
<fq1t1t$9ql$1@fred.mathworks.com>...
> "Yi Cao" <y.cao@cranfield.ac.uk> wrote in message
> <fq1s5q$oot$1@fred.mathworks.com>...
> > The main difficulty of the problem is that to fully store 
> > distances of all pairs requires more than 2 Gb memory: 
> > (25000*24999)/2*8=2.4999e9. 
> 
> No need to compute distance for all pairs, Delaunay
> triangulation is the trick.
> 
> Bruno


I want to find out similarity between all pairs; Please tell
me how to implement Delaunay triangulation in Matlab?