Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!ccu.umanitoba.ca!herald.usask.ca!alberta!ubc-cs!uw-beaver!zephyr.ens.tek.com!uunet!maverick.ksu.ksu.edu!ux1.cso.uiuc.edu!kadie
From: kadie@cs.uiuc.edu (Carl M. Kadie)
Newsgroups: comp.graphics
Subject: Finding nearest point
Message-ID: <kadie.666468082@herodotus.cs.uiuc.edu>
Date: 13 Feb 91 18:01:22 GMT
Sender: news@ux1.cso.uiuc.edu (News)
Organization: University of Illinois at Urbana
Lines: 13

Given a set of 3-D data points, {<x,y,z>}, and
a point p1, <x1,y1,z1>, is there a fast way to find which
point in the set is nearest to p1?

I've tried to think of ways to sort the set, but search is
linear (and often a little slower).





--
Carl Kadie -- kadie@cs.uiuc.edu -- University of Illinois at Urbana-Champaign