TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

The Weiler-Atherton polygon clipping algorithm

28 点作者 the_origami_fox超过 1 年前

1 comment

YoshiRulz超过 1 年前
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 未加载