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

Implement spatial hashing for sprite collision detection #189

Closed
pvcraven opened this Issue Apr 12, 2018 · 1 comment

Comments

Projects
None yet
1 participant
@pvcraven
Owner

pvcraven commented Apr 12, 2018

Enhancement request:

What should be added/changed?

Right now, checking to see if a sprite collides with other sprites in a list is an O(n) operation. Using Spatial Hashing, we should be able to make this a lot faster by only checking sprites that are close by.

What would it help with?

This should improve performance for programs with a lot of sprites. Particularly those with tiles.

@pvcraven pvcraven self-assigned this Apr 12, 2018

pvcraven added a commit that referenced this issue Apr 12, 2018

pvcraven added a commit that referenced this issue Apr 12, 2018

pvcraven added a commit that referenced this issue Apr 17, 2018

pvcraven added a commit that referenced this issue Apr 23, 2018

@pvcraven

This comment has been minimized.

Owner

pvcraven commented May 5, 2018

Implemented in 1.3.2

@pvcraven pvcraven closed this May 5, 2018

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