A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In different areas attempts are made to organize data into multi-linked structures which are well suited for information search, in particular the nearest neighbor search where the result data items are metrically close to a given data item. These structures often take the form of trees (M-Tree, cover tree, KDtree, GNAT) or networks (M-Chord, VoroNet, RayNet) built over a set of data items. In this paper we give the regular approach to the construction of links between data items which providesdoi:10.15514/syrcose-2010-4-30 fatcat:gfsyvvllebfzdggwvy6stakjym