Article View: sci.math.num-analysis
Article #434RE: finding neighbors
From: Markus Kohler
Date: Fri, 14 Aug 1992 09:56
Date: Fri, 14 Aug 1992 09:56
10 lines
857 bytes
857 bytes
There's an algorithmus, which uses Voronoi-diagrams, which can find the nearest neighbor of a given point in O(log(n)). You can find an example in the C++-bibliothek LEDA. You can can retrieve LEDA from nic.funet.fi (via anonymous ftp) for example. In the USA you will find it too. Hope this will help you markus@alvws-1.dfki.uni-kl.de
Technical Details
Message-ID:
<1992Aug14.095624.4963@rhrk.uni-kl.de>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!Germany.EU.net!news.netmbx.de!zrz.tu-berlin.de!Sirius.dfn.de!news.uni-stuttgart.de!rz.uni-karlsruhe.de!stepsun.uni-kl.de!dfki.uni-kl.de!kohlerShow Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!Germany.EU.net!news.netmbx.de!zrz.tu-berlin.de!Sirius.dfn.de!news.uni-stuttgart.de!rz.uni-karlsruhe.de!stepsun.uni-kl.de!dfki.uni-kl.de!kohler From: kohler@alvserv-2.dfki.uni-kl.de (Markus Kohler) Subject: RE: finding neighbors Message-ID: <1992Aug14.095624.4963@rhrk.uni-kl.de> Keywords: nearest neighbor Sender: kohler@dfki.uni-kl.de (Markus Kohler) Organization: DFKI Kaiserslautern Date: Fri, 14 Aug 1992 09:56:24 GMT Lines: 11