Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Modify neighbours definition in WHEAMM competition functions #95

Open
MeijeGawinowski opened this issue Dec 4, 2020 · 1 comment
Open

Modify neighbours definition in WHEAMM competition functions #95

MeijeGawinowski opened this issue Dec 4, 2020 · 1 comment
Assignees
@MeijeGawinowski

Comments

@MeijeGawinowski
Copy link
Collaborator

Instead of considering only topological neighbours in a grid, compute neighbours with KDtree from scipy with 2*max(ri) and reduce number of plants to explore when interactions are tested.
@MeijeGawinowski MeijeGawinowski self-assigned this Dec 4, 2020
@pradal
Copy link
Contributor

pradal commented Dec 4, 2020

Or just a grid / dict. Just knowing the density and the position of each plant in a grid will allow to find in a fast way the neighbours.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@MeijeGawinowski MeijeGawinowski

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@pradal @MeijeGawinowski