Learn when you want, where you want with convenient online training courses. Sign up now!
Experts Exchange Solution brought to you by
"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.
double InverseDistanceWeight(Point &target, Point allPoints, int count)
double total = 0;
double sum = 0;
double distance, weight, value;
for (int i = 0; i < count; ++i)
// Euclidean distance
distance = sqrt(pow(target.x - allPoints[i].x, 2) + pow(target.y - allPoints[i].y, 2));
weight = 1/distance; // the weighting function
value = weight * allPoints[i].value; // the adjusted value
total += value; // sum it all up
sum += weight;
// get the weighted average
target.value = total/sum;
Open in new window
Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.
From novice to tech pro — start learning today.
Premium members can enroll in this course at no extra cost.