<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Snipplr</title>
    <description>Recent snippets posted on Snipplr.com</description>
    <link>https://snipplr.com/</link>
    <lastBuildDate>Tue, 09 Jun 2026 08:50:17 +0000</lastBuildDate>
    <item>
      <title>(JavaScript) Bresenham\'s Line Algorithm - nefd</title>
      <link>https://snipplr.com/view/58314/bresenhams-line-algorithm</link>
      <description>&lt;p&gt;Code obtained from a [stackoverflow question](http://stackoverflow.com/questions/4672279/bresenham-algorithm-in-javascript). This is a javascript implementation of the [Bresenham line algorithm](http://en.wikipedia.org/wiki/Bresenham's_line_algorithm). Given two points, this function will return an array of coordinates which go from point A to point B, one step at a time.&lt;/p&gt;</description>
      <pubDate>Wed, 31 Aug 2011 00:07:22 UTC</pubDate>
      <guid>https://snipplr.com/view/58314/bresenhams-line-algorithm</guid>
    </item>
    <item>
      <title>(Python) Bresenham's line algorithm - nefd</title>
      <link>https://snipplr.com/view/22482/bresenhams-line-algorithm</link>
      <description>&lt;p&gt;&lt;/p&gt;</description>
      <pubDate>Wed, 04 Nov 2009 11:06:27 UTC</pubDate>
      <guid>https://snipplr.com/view/22482/bresenhams-line-algorithm</guid>
    </item>
  </channel>
</rss>
