Hi,
I have implemented the min priority queue algorithm mentioned on the assignment page to compute the min distance of query points with objects. However, If I only do the search on the pairs that have smaller distances than the min distance so far, then I do not get the correct answer for some of the query points! It fixes the issue if I search through all of the pairs, though!
I am not sure what part of my implementation is wrong that causes this issue! I was wondering if you could provide some pointers?
Thank you.
Hi, I have implemented the min priority queue algorithm mentioned on the assignment page to compute the min distance of query points with objects. However, If I only do the search on the pairs that have smaller distances than the min distance so far, then I do not get the correct answer for some of the query points! It fixes the issue if I search through all of the pairs, though!
I am not sure what part of my implementation is wrong that causes this issue! I was wondering if you could provide some pointers? Thank you.