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

Add early exits based on bounding boxes for set operations #462

Open
peterstace opened this issue Oct 5, 2022 · 0 comments
Open

Add early exits based on bounding boxes for set operations #462

peterstace opened this issue Oct 5, 2022 · 0 comments
Assignees
Labels
algorithm These are the fun tickets :-) DCEL Doubly Connected Edge List performance Improvements to speed or memory usage

Comments

@peterstace
Copy link
Owner

Idea:

For operations such as intersection, union, intersects, etc. (i.e. DCEL and non-DCEL operations), we should be able to early exit by computing bounding boxes and comparing them. Bounding boxes are extremely cheap to compute, so it should be ok to do this even when the bounding box check indicates that the full algorithm needs to be performed.

@peterstace peterstace added algorithm These are the fun tickets :-) performance Improvements to speed or memory usage DCEL Doubly Connected Edge List labels Oct 5, 2022
@peterstace peterstace self-assigned this Oct 6, 2022
@peterstace peterstace added the up next What we're planning to do next label Oct 6, 2022
@peterstace peterstace removed the up next What we're planning to do next label Nov 11, 2022
@peterstace peterstace added the up next What we're planning to do next label Feb 6, 2023
@peterstace peterstace removed the up next What we're planning to do next label May 31, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
algorithm These are the fun tickets :-) DCEL Doubly Connected Edge List performance Improvements to speed or memory usage
Projects
None yet
Development

No branches or pull requests

1 participant