From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: find nearest,closest value
Date: Sat, 9 Oct 2010 15:59:04 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 10
Message-ID: <i8q3g8$o52$>
References: <gmf901$45e$> <gnaitl$5dn$> <i8o734$a2d$> <i8ofdc$ove$> <i8p8t2$p4c$>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: 1286639944 24738 (9 Oct 2010 15:59:04 GMT)
NNTP-Posting-Date: Sat, 9 Oct 2010 15:59:04 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1187260
Xref: comp.soft-sys.matlab:677109

"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <i8p8t2$p4c$>...
> Delaunay triangulation is usually the best method to find nearest vector
> Look ate TRISEARCH(), DELAUNAY() on older Matlab version and TriScatteredInterp class on newer version.
> Bruno
- - - - - - - - - - - -
  Hi, Bruno.  That sounds like an excellent idea.  However, the poster, Harry, stated a criterion that apparently amounts to an L1 metric, not L2.  Are delaunay and TriScatteredInterp amenable to such a metric?  The idea of having a circumscribed circle containing no data points sounds very L2 to me.  Very likely he could be persuaded to switch to L2 if it results in better algorithm performance.

Roger Stafford