finding the neighbors of a set of points

Article View: sci.math.num-analysis

Article #208

Back to sci.math.num-analysis Previous Next

#208

From: Guy Metcalfe
Date: Thu, 06 Aug 1992 20:32

12 lines
878 bytes

Given a two sets of points P and S in the plane, what's an efficient way to
find which members of P are close to members of S?  For large numbers of
points and/or for large numbers of times to refigure which points are
close, there must be a better way than finding the distance of every pair.

Thanks for any help.

-- 
	Guy Metcalfe
	Northwestern University		guy@chaos.chem-eng.nwu.edu	
	Dept. Chem. Eng.

Technical Details

Message-ID: <1992Aug6.203227.20298@news.acns.nwu.edu>

Path:

arc1-ca.pugleaf.net!sparky!uunet!olivea!news.bbn.com!usc!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!casbah.acns.nwu.edu!guy

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!olivea!news.bbn.com!usc!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!casbah.acns.nwu.edu!guy
From: guy@casbah.acns.nwu.edu (Guy Metcalfe)
Newsgroups: sci.math.num-analysis
Subject: finding the neighbors of a set of points
Message-ID: <1992Aug6.203227.20298@news.acns.nwu.edu>
Date: 6 Aug 92 20:32:27 GMT
Sender: usenet@news.acns.nwu.edu (Usenet on news.acns)
Organization: Northwestern University, Evanston Illinois.
Lines: 12