<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Drawing Fractal Trees - Part 2</title><link>http://blogs.msdn.com/avip/archive/2008/07/19/drawing-fractal-trees-part-2.aspx</link><description>L-Systems We've established that drawing the tree will use the concept of self-similarity. To put this in action, we're going to use what's called an L-System . Here's a crash-course... Firstly, we establish that we have a &amp;quot;pen&amp;quot; that at any</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator></channel></rss>