Stats

  • Replies 9
  • Subscribers 162
  • Views 15240
  • 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 can see how this might work (without necessarily following the k-d tree method to the letter).

    I created a simple utility that divides a design into 1mm squares. I used this to reduce the number of checks per via. It's very fast with about 8000 vias. There are limitations and flaws with my code but to go further I would be writing the utility for you ;-)

    Regards,

    Dave 

Reply

  • Ok, I can see how this might work (without necessarily following the k-d tree method to the letter).

    I created a simple utility that divides a design into 1mm squares. I used this to reduce the number of checks per via. It's very fast with about 8000 vias. There are limitations and flaws with my code but to go further I would be writing the utility for you ;-)

    Regards,

    Dave 

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.