Fix SkipEdgesBeforeMinY algorithm #171
Merged
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.


Prerequisites
Description
The original
SkipEdgesBeforeMinY()implementation in #96 forgot to watch cases when all edges of the rendered polygon crossed the top boundary, meaning that allScanEdgeY0are< minY, leading toi0overflowthis.sorted0. #119 added a workaround for some cases but broke the merge sort -style coordinate walking algorithm which should always pick the next smaller coordinate to traverse the elements of two sorted lists in ascending order.The PR adds bounds checks to the original algorithm. Fixes #170, fixes #108.