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.

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

Use something better for NNSearch #3

Open
niklas88 opened this issue Feb 4, 2013 · 1 comment
Open

Use something better for NNSearch #3

niklas88 opened this issue Feb 4, 2013 · 1 comment
Assignees

Comments

@niklas88
Copy link
Member

niklas88 commented Feb 4, 2013

We need to fix the NNSearch to be fast even if there is no point close by.
At the moment we just return node 0 when there is nothing in the sorounding grid cells.
Look into adapting Sascha's octree code.

@ghost ghost assigned PeterVollmer Feb 4, 2013
@ghost ghost assigned niklas88 Apr 2, 2013
@karussell
Copy link

You can apply some "flood filling algorithm" so that every cell has some content like done here (instead of using only one integer per cell you should keep your arraylist per cell)

But I prefer being more precise, consuming less memory and accepting that some queries do not always return with a node so I've created a quadtree alternative with which I was able to import world wide data but still it has a meaningful size (less than 10% of the graph)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants