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

Faster overlap checks? #1

Open
ktnr opened this issue Apr 29, 2022 · 0 comments
Open

Faster overlap checks? #1

ktnr opened this issue Apr 29, 2022 · 0 comments
Labels
performance Performance improvements

Comments

@ktnr
Copy link
Owner

ktnr commented Apr 29, 2022 •
edited
Loading

Verify if we can use faster overlap checks as described in

// Simple data structure to represent circle sectors
// Angles are measured in [0,65535] instead of [0,359], in such a way that modulo operations are much faster (since 2^16 = 65536)
// Credit to Fabian Giesen at "https://web.archive.org/web/20200912191950/https://fgiesen.wordpress.com/2015/09/24/intervals-in-modular-arithmetic/" for useful implementation tips regarding interval overlaps in modular arithmetics

from https://github.com/vidalt/HGS-CVRP/blob/main/Program/CircleSector.h.
@ktnr ktnr added the performance Performance improvements label Apr 29, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
performance Performance improvements
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ktnr