TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

The Weiler-Atherton polygon clipping algorithm

28 pointsby the_origami_foxover 1 year ago

1 comment

YoshiRulzover 1 year ago
The author links to another blog discussing the related Martinez-Rueda algorithm, which I mention not only because this post ends with &quot;I am considering implementing the Martinez-Rueda algorithm because [... it is more featureful]&quot;, but because at the top of it[1] there&#x27;s a &quot;visual proof&quot; of sorts that I found strikingly concise.<p>[1]: <a href="https:&#x2F;&#x2F;sean.cm&#x2F;a&#x2F;polygon-clipping-pt2#annotating-segments" rel="nofollow noreferrer">https:&#x2F;&#x2F;sean.cm&#x2F;a&#x2F;polygon-clipping-pt2#annotating-segments</a>
评论 #37878746 未加载