Increase exhaustive matching cache size #3576
Merged
Conversation
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
RuibinMa
reviewed
Aug 18, 2025
Collaborator
RuibinMa
left a comment
There was a problem hiding this comment.
Can you leave a comment of what's the consideration behind this?
RuibinMa
approved these changes
Aug 18, 2025
tavislocus
pushed a commit
to tavislocus/colmap_6dof
that referenced
this pull request
Aug 19, 2025
Exhaustive pairing generates pairs in blocks for image sets A and B where each set is block_size large. The cache should be 2 * block_size to hold all images in memory for one block.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Exhaustive pairing generates pairs in blocks for image sets A and B where each set is block_size large. The cache should be 2 * block_size to hold all images in memory for one block.