LTS special case fix #1093
Open
LTS special case fix #1093
Conversation
This file contains 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
JonasLukasczyk
force-pushed
the
lts-fix
branch
from
2db5856 to
df9494f
Compare
|
Thanks, looks good to me! |
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.
Hi Julien,
this is a fix for issue #1081. The technical details are documented there. In short, this PR just adds an additional check to the LTS subprocedure that computes the local order of a segment. Before this subprocedure could run into an infinite loop if the segment that needs to be simplified does not have a boundary on which minima can be placed. Now the subprocedure checks if a boundary exists in the first place.
I did not test this yet!
Thanks
Jonas