Home Products Download Order Contacts

comp.graphics.algorithms

Subject: Re: nearest neighbour of a point



I have gone through their approach, but the problem I think it has is
that it filters out all points lying at some distance 'd' from the
point under question along each of the axes. Now, it is very much
possible to have the closest points having these co-ordinates(in
3-dimentions):
A = {0.9, 0.1, 0.2}
B = { 0.001, 0.1, 0.19}

If we filter out points say even at a distance of 0.6 difference, then
along the x-axis, the distance becomes 0.899, and the point is
discarded from further consideration.


Reply


View All Messages in comp.graphics.algorithms

path:
nearest neighbour of a point =>Re: nearest neighbour of a point =>

Replies:

Copyright 2006 WatermarkFactory.com. All Rights Reserved.