<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: Kloopvram</title><link>https://news.ycombinator.com/user?id=Kloopvram</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 09 Sep 2026 12:27:09 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Kloopvram" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by Kloopvram in "ChatGPT Images 2.5"]]></title><description><![CDATA[
<p>Don't tap the aquarium glass man</p>
]]></description><pubDate>Tue, 08 Sep 2026 21:22:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=49617266</link><dc:creator>Kloopvram</dc:creator><comments>https://news.ycombinator.com/item?id=49617266</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49617266</guid></item><item><title><![CDATA[New comment by Kloopvram in "Generating Voronoi diagrams using Fortune's algorithm"]]></title><description><![CDATA[
<p>Cool!
Interesting that D3 moved away from Fortune's algorithm to <a href="https://mapbox.github.io/delaunator/" rel="nofollow">https://mapbox.github.io/delaunator/</a> because it<p>"is 5-10× faster than d3-voronoi to construct the Delaunay triangulation or the Voronoi diagram, is more robust numerically, has Canvas rendering built-in, allows traversal of the Delaunay graph, and a variety of other improvements."</p>
]]></description><pubDate>Sat, 08 Feb 2025 13:40:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=42982871</link><dc:creator>Kloopvram</dc:creator><comments>https://news.ycombinator.com/item?id=42982871</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42982871</guid></item></channel></rss>