Article View: fj.lang.c
Article #241Re: Algorithm searching for nearest point
From: Jun Makino
Date: Sun, 16 Feb 1997 00:00
Date: Sun, 16 Feb 1997 00:00
25 lines
1496 bytes
1496 bytes
>>>>> On 16 Feb 1997 03:06:46 GMT, kazm@kazm.ca2.so-net.or.jp (Kazuyuki Matsuda) said: > $B$4$V$5$?$7$F$^$9!d(B $BKRLn!wElBg6p>l(B $B$"!"$I$&$b!#L>A0$+$i$=$&$G$O$J$$$+$H$O;W$C$?$N$G$9$,!#(B > $B$?$7$+$K$=$NDL$j$G!":G=i$N<ALd$KBP$9$k2rK!$H$7$F$OE,$5$J$$$+(B > $B$b$7$l$J$$$G$9$M!#(B Makino> $BE@$NJ,I[$,0lMM$K6a$$$N$J$i%0%j%C%I$K@Z$C$F<+J,$N$$$k$H$3$m$HNY@\(B Makino> $B%;%k!J$J$1$l$P8+$D$+$k$^$G$=$N@h$r!"!"!"!KC5$9$H$+!"0lMM$G$J$1$l(B Makino> $B$P(B oct-tree $B$r;H$&$H$+$J$i$d$C$?$3$H$,$"$j$^$9$,!"!"!"(B > $B$3$&$$$C$?J}K!$b4^$a$F!"$?$/$5$s$N2rK!$NCf$+$iM?$($i$l$?LdBj(B > $B$r2r$/$N$K:GE,$J$b$N$rA*Br$7$FD:$1$l$P$h$$$H;W$$$^$9!#(B $B$G$9$M!#855-;v$NJ}$K$O!"Nc$($P(B http://www.cs.sunysb.edu/~algorith/files/nearest-neighbor.shtml $B$H$+$,$J$K$+$N;29M$K$J$k$+$b$7$l$^$;$s!#(B $BKRLn!wElBg6p>l(B
Technical Details
Message-ID:
<MAKINO.97Feb16190258@muscat.c.u-tokyo.ac.jp>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<1997Feb13.181031.13426@tsn.or.jp>Show Full Headers
Complete Article Headers
X-Google-Language: Japanese,JIS X-Google-Thread: f9e95,ae8f0a59992604e X-Google-Attributes: gidf9e95,public X-Google-Thread: 106434,ae8f0a59992604e X-Google-Attributes: gid106434,public X-Google-Thread: 10a0b6,ae8f0a59992604e X-Google-Attributes: gid10a0b6,public From: makino@chianti.c.u-tokyo.ac.jp (Jun Makino) Subject: Re: Algorithm searching for nearest point Date: 1997/02/16 Message-ID: <MAKINO.97Feb16190258@muscat.c.u-tokyo.ac.jp> X-Deja-AN: 219137934 References: <1997Feb13.181031.13426@tsn.or.jp> Organization: College of Arts and Sciences, Univ. of Tokyo Newsgroups: fj.lang.c,fj.comp.theory,fj.comp.image