HackerURLs

一次又一次被重新发现的经典。

同一个链接,相隔一年以上,一次又一次被人重新发现、再次冲上 Hacker News 首页。能经受住这种时间检验的,大多是值得一读再读的文章。每篇附中文标题,讨论最热的那些再加上中文导读和高赞评论翻译。

从名人堂开始
  • 4,700+篇经过时间检验的经典

Hall of fame

名人堂

在经典库里看全部精选

上首页次数最多、而且有中文导读的 30 篇。时间轴上每个黑点是一次上首页,空心点是一次没冲上去的投稿。

  1. 正在载入经典…

Archive

经典库

按第一次上首页的年份分布,点柱子筛选。

排序

    About

    这些经典是怎么挑出来的

    1. 01

      合并同一个链接

      读取 Hacker News 自 2006 年以来的全部链接投稿,把 http/https、www、跟踪参数等写法不同的同一篇文章合并成一条。

    2. 02

      只留经得起时间的

      同一链接至少两次拿到 50 分以上(约等于上首页),而且两次相隔一年以上;再由 AI 剔除状态页、产品首页和新闻事件。

    3. 03

      写导读、译评论

      上首页次数最多的 2,000 篇配上中文导读、"为什么经久不衰",并精选翻译 HN 高赞评论。导读由 AI 生成,可能有误。

    算法与计算机科学gabrielgambetta.com编辑精选

    从零开始学计算机图形学

    Computer Graphics from Scratch

    3次上首页
    2年跨度
    1,752累计得分
    253条评论

    2019 — 2021,它一次次回到首页

    黑点是上首页(≥ 50 分)的那次投稿,空心点是没冲上去的投稿,点越大分数越高。

    导读

    这是 Gabriel Gambetta 编写的免费在线教程《Computer Graphics from Scratch》,从零讲解计算机图形学的基本原理(如光线追踪、光栅化等),不依赖任何图形 API。作者曾教授图形学课程多年,后将讲义整理成文,2019 年经 Hacker News 推荐后被 No Starch Press 看中出版成书,并继续免费开放在线阅读。

    为什么经久不衰:它从第一性原理出发、不依赖任何图形库地讲透图形学核心概念,多年反复登上 HN 首页,至今仍是入门图形学最清晰的免费资源之一。

    关键词 计算机图形学光线追踪免费教程从零实现

    HN 评论精选

    作者自述:从教学讲义到网站文章,再到因 HN 曝光而出版成书,并保持免费在线阅读。

    很久以前,由于一连串不太可能的事件,我在毕业一年后回到母校教授计算机图形学。此后约五年里我的教学方法不断演进,真正吃透了这门课。停止教学后,我把笔记和讲义整理成系列文章放在网站上,一直默默无闻。Hacker News 偶尔会翻出它,反响不错但没什么下文。直到 2019 年 4 月,它再次登上 HN 首页,这次被 No Starch Press 的编辑注意到了。长话短说:CGFS 即将以真正的纸质书形式出版。出版社慷慨地同意我把近两年编辑校对的更新内容继续免费放在网站上。没有你们的支持这一切都不会发生,再次感谢!

    ggambetta查看英文原文

    A long time ago, due to an improbable sequence of events, I found myself teaching Computer Graphics at my alma mater, a year after I took the class myself. Over the following five years or so, my approach to the subject evolved, and I really got the hang of it. After I stopped teaching, I took my notes, handouts and slides, and made them into a series of articles that I put on my website, where they remained in relative obscurity. Hacker News managed to find it every once in a while, and it was generally well received, but nothing came out of this. Until April 2019. It made the HN front page again [0], except this time it caught the attention of an editor in No Starch Press [1]. Long story short, today I’m incredibly grateful and excited to tell you that CGFS is coming out as a real book, with pages and all [2]. The folks at NSP graciously agreed to let me publish the updated contents, the product of almost two years of hard editing and proofreading work, for free on my website [3]. But if you’d like to preorder the printed or ebook version, you can use the coupon code MAKE3DMAGIC to get a 35% discount at https://nostarch.com/computer-graphics-scratch. I’m still somewhat in disbelief that my work is getting published as a book, and this genuinely wouldn’t have happened without your support. So once again, THANK YOU :) [0] https://news.ycombinator.com/item?id=19584921 [1] http://nostarch.com [2] https://nostarch.com/computer-graphics-scratch [3] http://gabrielgambetta.com/computer-graphics-from-scratch

    称赞教程从原理而非公式出发构建数学概念,教学方式友好。

    太棒了!我特别欣赏它对数学概念的逐步构建。比如教程不是直接给出射线-球体求交公式,而是先讲如何表示射线和球体,以及两者在交点处必须满足的条件。我曾被邀请教图形学工作坊,也想让数学基础薄弱的人能听懂,于是从第一性原理出发只讲最相关的数学。

    akdas查看英文原文

    This is awesome! One thing I really appreciate is building up the mathematical concepts. For example, instead of providing a ray-sphere intersection formula, the tutorial talks about representing a ray and a sphere, and how the two representations must match at intersection points. When I was asked to teach a workshop on computer graphics, I wanted to make the concepts accessible to those who were either rusty, or hadn't even encountered the necessary math. Given a limited amount of teaching time, I introduced only the most relevant math, but did so from first principles. Hopefully my treatment can be useful to others: https://avik-das.github.io/build-your-own-raytracer

    读者建议为没有图形学背景的人提供具体的运行示例指引。

    这看起来真的很酷。也许是个很蠢的问题,但对图形学一无所知的人,这些示例到底怎么运行?我知道可以自己去搜各种语言的画布绘图工具,但如果书里能加一句'实现方式很多,但如果你没有先入之见,推荐这种'就太好了。很棒的书,想动手试试!

    davidwf查看英文原文

    I have to say this looks really cool. Maybe this is a really dumb question, but as someone who really knows nothing about computer graphics, how can you actually run these examples? I realize that I could Google and research and find a list of "canvas drawing tools" in a variety of languages that I could then evaluate (despite, again, knowing nothing about graphics), but it'd be SUPER-SUPER-awesome to have a quick note "there are lots of ways to go about making these things happen in the real world, but here's one I recommend if you have no other priors." :-) Really cool book idea, keen to have a go at it!

    指出在现代操作系统上直接操作像素并不容易,是实践中的门槛。

    我发现在现代 PC 上获取导言中提到的绘图原语出乎意料地困难:在现代操作系统里到底怎么在指定坐标画一个像素?

    dancodes查看英文原文

    I found it surprisingly hard to get access to the primitives mentioned in the intro, on a modern pc. How does one draw a pixel on a specific coordinate in a modern OS?

    历次讨论

    同类还值得读

    1. 位运算技巧集

      Bit Twiddling Hacks

      斯坦福页面上的经典位运算技巧合集,收录了 popcount、前导/尾随零、位反转、交换、舍入等大量技巧,并附有解释和性能讨论。

      算法与计算机科学上首页 8 次 · 2011–2024graphics.stanford.edu编辑精选
    2. 如何不按平均评分排序

      How Not To Sort By Average Rating

      经典文章解释了为什么按平均评分排序不可靠:只有少量评价的条目(比如仅一条五星)会轻易排到最前,而评价数量的差异被忽略。

      算法与计算机科学上首页 7 次 · 2009–2024evanmiller.org编辑精选
    3. 数据结构可视化

      Data Structure Visualizations

      旧金山大学 David Galles 教授制作的数据结构与算法交互式可视化网站,涵盖 B 树、红黑树、排序、图算法等,可逐步操作观察其运行过程。

      算法与计算机科学上首页 6 次 · 2011–2021cs.usfca.edu编辑精选
    4. 1996 年以来的计算机科学最佳论文奖

      Best Paper Awards in Computer Science since 1996

      Jeff Huang 维护的一个汇总页面,收录了自 1996 年以来计算机科学各主要会议的“最佳论文奖”获奖名单,并按年份和会议整理,方便读者一站式浏览历届获奖论文。

      算法与计算机科学上首页 6 次 · 2010–2018jeffhuang.com编辑精选
    5. 算法(Jeff Erickson)

      Algorithms, by Jeff Erickson

      伊利诺伊大学 Jeff Erickson 教授的算法课教材,免费在线开放。

      算法与计算机科学上首页 5 次 · 2018–2022jeffe.cs.illinois.edu编辑精选

    打赏支持

    打赏二维码

    觉得有用,请作者喝杯咖啡。

    WeChat

    关注向阳乔木

    微信公众号「向阳乔木推荐看」

    微信公众号「向阳乔木推荐看」二维码

    微信扫一扫;在微信里打开本页时,长按二维码识别。