<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: softwarehippie</title><link>https://news.ycombinator.com/user?id=softwarehippie</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 17 Apr 2026 14:18:05 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=softwarehippie" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Shortest-Path on the GPU: Two buckets is all you need]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.execfoo.de/blog/nearfar.html">https://www.execfoo.de/blog/nearfar.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47505190">https://news.ycombinator.com/item?id=47505190</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 24 Mar 2026 16:27:59 +0000</pubDate><link>https://www.execfoo.de/blog/nearfar.html</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=47505190</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47505190</guid></item><item><title><![CDATA[Experiments.md to stay sane down the rabbit hole]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.execfoo.de/blog/experiments.html">https://www.execfoo.de/blog/experiments.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47325365">https://news.ycombinator.com/item?id=47325365</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 10 Mar 2026 16:23:11 +0000</pubDate><link>https://www.execfoo.de/blog/experiments.html</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=47325365</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47325365</guid></item><item><title><![CDATA[New comment by softwarehippie in "Ask HN: What Are You Working On? (March 2026)"]]></title><description><![CDATA[
<p>As a personal learning project on how to write efficient GPU code I'm trying to implement different shortest-path algorithms on the GPU. This is notoriously one of the cases where a simple algorithm like Dijkstra on the CPU will beat many implementations on the GPU.<p>It has been a lot of fun to learn about Vulkan / GLSL and the GPU execution model to figure out why the CPU is so much faster than the GPU. I'll be open sourcing the code soon but so far I'm documenting my journey in a series of blog posts. First one of the series is <a href="https://www.execfoo.de/blog/deltastep.html" rel="nofollow">https://www.execfoo.de/blog/deltastep.html</a></p>
]]></description><pubDate>Mon, 09 Mar 2026 10:38:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=47307262</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=47307262</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47307262</guid></item><item><title><![CDATA[Optimizing Delta-Step on the GPU]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.execfoo.de/blog/deltastep_shader.html">https://www.execfoo.de/blog/deltastep_shader.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47232661">https://news.ycombinator.com/item?id=47232661</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 03 Mar 2026 14:15:23 +0000</pubDate><link>https://www.execfoo.de/blog/deltastep_shader.html</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=47232661</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47232661</guid></item><item><title><![CDATA[GPUs are not always faster]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.execfoo.de/blog/deltastep.html">https://www.execfoo.de/blog/deltastep.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46961971">https://news.ycombinator.com/item?id=46961971</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 10 Feb 2026 16:16:19 +0000</pubDate><link>https://www.execfoo.de/blog/deltastep.html</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=46961971</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46961971</guid></item><item><title><![CDATA[New comment by softwarehippie in "Future of transportation"]]></title><description><![CDATA[
<p>Pretty shallow analysis, how AVs will be deployed depends very much on the region and how it complements with existing infrastructure (especially outside the US).
I can already travel at 200km/h while working in a train today - that does not make me want to move further out of a city. AVs will have a tremendous impact when it comes to last-mile connectivity or supporting a more suburban life-style, but the impact on public transportation will be limited IMHO.<p>I can recommend the series from a16z on the wider impact of AVs <a href="https://a16z.com/2018/02/03/autonomy-ecosystem-frank-chen-summit/" rel="nofollow">https://a16z.com/2018/02/03/autonomy-ecosystem-frank-chen-su...</a></p>
]]></description><pubDate>Sun, 20 Jan 2019 22:39:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=18956072</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=18956072</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=18956072</guid></item><item><title><![CDATA[New comment by softwarehippie in "Routing on OpenStreetMap.org"]]></title><description><![CDATA[
<p>What you see on cycle.travel _is_ an open source router. They run <a href="https://github.com/Project-OSRM/osrm-backend" rel="nofollow">https://github.com/Project-OSRM/osrm-backend</a>
Actually, I don't really see where you get that impression from. Very few commercial providers use their own routing stack. It is almost always OSRM or pgRouting if you want something that scales for world-wide routing.</p>
]]></description><pubDate>Tue, 17 Feb 2015 15:22:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=9062659</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=9062659</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9062659</guid></item><item><title><![CDATA[New comment by softwarehippie in "Ask HN: Who is hiring? (February 2015)"]]></title><description><![CDATA[
<p>Mapbox - Software Engineer - REMOTE/SF/DC - <a href="https://www.mapbox.com/blog/directions-hiring/" rel="nofollow">https://www.mapbox.com/blog/directions-hiring/</a><p>Got an idea for solving this problem efficiently and elegantly in C++?<p><pre><code>    A given graph consists of two connected sub-graphs in which every node has at least three neighbours. The sub-graphs are only connected by a single edge, the bridge. Given a node in each sub-graph, find the bridge. You can assume there is only one bridge.
</code></pre>
Send the code to jobs@mapbox.com.<p>Mapbox is building a kick-ass open source routing engine that works whether you’re walking, biking, or driving. We’re looking for people who enjoy polishing their C++ code to a high sheen and wringing out its last few drops of performance. Sound like you, or like where you want to get to? We encourage everyone excited about making directions better and open to drop us a line at jobs@mapbox.com.</p>
]]></description><pubDate>Mon, 02 Feb 2015 09:55:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=8983463</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=8983463</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8983463</guid></item><item><title><![CDATA[New comment by softwarehippie in "Alligator Eggs"]]></title><description><![CDATA[
<p>Yep, see <a href="http://teamcroggle.github.io/" rel="nofollow">http://teamcroggle.github.io/</a> also available in the Google Play store: <a href="https://play.google.com/store/apps/details?id=de.croggle" rel="nofollow">https://play.google.com/store/apps/details?id=de.croggle</a></p>
]]></description><pubDate>Sun, 18 Jan 2015 12:29:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=8907350</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=8907350</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8907350</guid></item><item><title><![CDATA[New comment by softwarehippie in "Ask HN: Who is hiring? (January 2015)"]]></title><description><![CDATA[
<p>Mapbox, (REMOTE worldwide or LOCAL in SF/DC) <a href="https://www.mapbox.com/jobs/" rel="nofollow">https://www.mapbox.com/jobs/</a>
Directions Developer<p>We’re building a routing service unlike any other. It is flexible, fast, and customizable for every use case.
We are looking for people who know graph theory, efficient algorithms, and have the desire to run fast on creating a scalable API.<p>While having a background in routing is a bonus,
we’re really looking for C++ coders with a deep understanding of algorithms
and data structures. Knowledge in C++11, cache effiency as well as I/O effiency are certainly a plus.<p>Primary focus would be extending an open source routing engine.</p>
]]></description><pubDate>Thu, 01 Jan 2015 14:22:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=8822977</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=8822977</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8822977</guid></item><item><title><![CDATA[New comment by softwarehippie in "Introducing Mapbox GL"]]></title><description><![CDATA[
<p>You do realize that this 100% configurable by stylesheets? The entire point is, that their maps are stylable by the user (i.e. the app developer).</p>
]]></description><pubDate>Thu, 05 Jun 2014 14:56:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=7852252</link><dc:creator>softwarehippie</dc:creator><comments>https://news.ycombinator.com/item?id=7852252</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=7852252</guid></item></channel></rss>