Optimize overlay operations with envelope checks and R-Tree indexing#693
Merged
peterstace merged 1 commit intomasterfrom Feb 1, 2026
Merged
Optimize overlay operations with envelope checks and R-Tree indexing#693peterstace merged 1 commit intomasterfrom
peterstace merged 1 commit intomasterfrom
Conversation
Add early exit for Intersection when envelopes are disjoint, returning an empty result of the appropriate dimension without calling the JTS port. Replace O(M*N) nested loops in gcAwareIntersection and gcAwareDifference with R-Tree indexed lookups for O(M log N) complexity.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Description
Add early exit for Intersection when envelopes are disjoint, returning an empty result of the appropriate dimension without calling the JTS port.
Replace
O(M*N)nested loops in gcAwareIntersection and gcAwareDifference with R-Tree indexed lookups for O(M log N) complexity.Check List
Have you:
Added unit tests? N/A (optimization, no functional change)
Add cmprefimpl tests? (if appropriate?) N/A
Updated release notes? (if appropriate?) Yes.
Updated the README.md (if new functionality is added?) N/A
Related Issue
Benchmark Results
TODO
Click to expand