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.

Convex hull visualizations with D3

36 pointsby 1wheelover 10 years ago

3 comments

pimlottcover 10 years ago
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.
laexover 10 years ago
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>
gleennover 10 years ago
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 未加载