Subject: Fast Way Of Calculating Nearest 3D Points
I know this question is a little similar to a recent post but I feel it
is different enough to start a new thread.
I have two sets of 3d points, X and Y. For every element in X, I need to
find the closest (by euclidean distance) point from the set Y. I was
wondering what options there are other than the obvious calculation,
which is obviously quite slow when talking about massive sets of X and Y.
Also what about if I was not talking about euclidean distance, but say a
metric which is combination of that factored by say difference in
normals of the points, how would any previous suggests be affected by
this slightly different metric.
Any help much appreciated,
View All Messages in comp.graphics.algorithms
Re: Fast Way Of Calculating Nearest 3D Points
Copyright © 2006 WatermarkFactory.com. All Rights Reserved.