Stats

  • Replies 9
  • Subscribers 162
  • Views 15234
  • Members are here 0
More Content

Nearest Neighbor Problem

vramananx

Hi

I am trying to implement the nearest neighbor problem in skill, can anyone help me with some examples and tutorials?

basically i am tryint to get the closest point in a list of points for a given x,y

I am using sortcar to do this but it is very slow since there is a huge amount of calculation goes on

So I would like to use any NNP algorithm and would like some pointers,

 regards

Venkata

Parents

  • Ok, I have no experience with the KD-tree method so would be interested to know how you get on. Your method of solving this problem will depend on your requirement. The time to sort all the points may not be that important if you only need to do it once but, if you have to do it often you're probably on th eright track.

     

    Have you tried this for speed:

    nearestObj = cadar(sortcar(mapcar(lambda((objId) list(axlDistance(pt1, objId ->xy), objId)), objs), 'lessp))

    Where objs is the list of objects you are measuring to and pt1 is the point. 

Reply

  • Ok, I have no experience with the KD-tree method so would be interested to know how you get on. Your method of solving this problem will depend on your requirement. The time to sort all the points may not be that important if you only need to do it once but, if you have to do it often you're probably on th eright track.

     

    Have you tried this for speed:

    nearestObj = cadar(sortcar(mapcar(lambda((objId) list(axlDistance(pt1, objId ->xy), objId)), objs), 'lessp))

    Where objs is the list of objects you are measuring to and pt1 is the point. 

Children
No Data
Cadence Guidelines

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.