<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Blogs on Patrick's Pretty Pixels</title><link>https://ipotrick.github.io/site/blogs/</link><description>Recent content in Blogs on Patrick's Pretty Pixels</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 20 Nov 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ipotrick.github.io/site/blogs/index.xml" rel="self" type="application/rss+xml"/><item><title>Practical, efficient render graphs</title><link>https://ipotrick.github.io/site/blogs/practical-efficient-rendergraphs/</link><pubDate>Fri, 20 Nov 2026 00:00:00 +0000</pubDate><guid>https://ipotrick.github.io/site/blogs/practical-efficient-rendergraphs/</guid><description>&lt;p&gt;Render graphs automatically optimize the whole frame. They can generate synchronization, find a better pass order and alias transient memory, better than you would by hand.&lt;/p&gt;&#10;&lt;p&gt;This post builds a render graph from the bottom up. It starts with the actual problems, synchronization with barriers and memory use, and then improves the render graph step by step. The design is the one I use in &lt;a href="https://github.com/Sunset-Flock/Timberdoodle"&gt;Timberdoodle&lt;/a&gt;, my research renderer. It works on resource access timelines forming a render graph.&lt;/p&gt;</description></item></channel></rss>