Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix algorithm that chooses the bridge between a polygon and a hole #11988

Merged
merged 4 commits into from Dec 13, 2022

Conversation

iverase
Copy link
Contributor

@iverase iverase commented Nov 29, 2022

The current algorithm seems to fail when the bridge is located on the first node of the iteration and there are another vertex with the same x and y. In that case we seem not to be able to find the right node because we actually never compute the tangent of the first node.
This change changes the iteration to make sure we compute the tangent for all nodes of the polygon which seems to help finding always the right bridge. We remove some logic we (well, it was me) added to try to fix this issue.

fixes #11986

@iverase iverase merged commit ef5766a into apache:main Dec 13, 2022
@iverase iverase deleted the github-11986 branch December 13, 2022 09:16
iverase added a commit that referenced this pull request Dec 13, 2022
@iverase iverase restored the github-11986 branch December 13, 2022 09:58
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Polygons failing to tessellate
1 participant