finding the neighbors of a set of points

Thread View: sci.math.num-analysis

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Guy Metcalfe Thu, 06 Aug 1992 20:32

#208

Author: 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.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads