Inefficient neihgbour detection

fredrikm / SoCSProject16

MIT License

1 stars 0 forks source link

Inefficient neihgbour detection #4

Closed rasake closed 8 years ago

rasake commented 8 years ago

We might want to use the fact that if fishA is visible to fishB, then fishB is visible from fishA. But first we should get the current solution up and working.

fredrikm commented 8 years ago

Do this after periodic boundary works.

reinthal commented 8 years ago

Implementation sufficiently fast without grid. Closing issue.