Add early exits based on bounding boxes for set operations #462
Labels
algorithm
These are the fun tickets :-)
DCEL
Doubly Connected Edge List
performance
Improvements to speed or memory usage
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.
The text was updated successfully, but these errors were encountered: