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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Convex hull visualizations with D3

36 点作者 1wheel超过 10 年前

3 条评论

pimlottc超过 10 年前
This is cool, but I was initially rather confused by the interactivity. I expected the animations to play through by themselves like similar algorithm visualizations and it took some trial and error to figure out how exactly to advance the animation. Having to move the mouse around to different points all the time gets a little tiresome. I suppose it's nice to allow the user to advance the animation in whatever order they want but I would have been happy to have it play through automatically in a proscribed ordering.
laex超过 10 年前
A few months ago I implemented the Graham Scan algorithm with visualization in GO. If anyone&#x27;s interested, here&#x27;s the link: <a href="https://github.com/hemantasapkota/go-convexhull" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;hemantasapkota&#x2F;go-convexhull</a>
gleenn超过 10 年前
This is pretty awesome. The trade-offs between the two optimized versions of Graham&#x27;s scan and Jarvis&#x27; march are pretty interesting too, based on the number of points that lie on the hull.
评论 #8801392 未加载