<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Lindi Emoungu</title>
	<atom:link href="http://lindiemoungu.com/?feed=rss2" rel="self" type="application/rss+xml" />
	<link>http://lindiemoungu.com</link>
	<description>Projects &#38; Visual Experiments</description>
	<lastBuildDate>Wed, 20 Feb 2013 07:52:31 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	
		<item>
		<title>Closest Points Between Polygons</title>
		<link>http://lindiemoungu.com/?p=372</link>
		<comments>http://lindiemoungu.com/?p=372#comments</comments>
		<pubDate>Thu, 17 Nov 2011 08:37:40 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Physics]]></category>
		<category><![CDATA[Polygons]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=372</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2011/11/PolygonClosestPoints.jpg" alt="" title="Separating-Axes" width="150" height="150" class="alignleft size-thumbnail wp-image-319" style="border: 1px solid #CCC;" />Here we examine an algorithm that computes the pair of points that are closest to each other while still being inside each of a pair of polygons.  The name of the algorithm that solves this problem is called the Lemke Algorithm.  The Lemke Algorithm is able to solve a set of simultaneous equations that define mathematically the set of constraints described above. ... <a href="http://lindiemoungu.com/?p=372" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=372</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Separating Axes</title>
		<link>http://lindiemoungu.com/?p=343</link>
		<comments>http://lindiemoungu.com/?p=343#comments</comments>
		<pubDate>Wed, 05 Oct 2011 01:47:46 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Collision Detection]]></category>
		<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Polygons]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=343</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2011/10/SeparatingAxes.jpg" alt="" title="Separating-Axes" width="150" height="150" class="alignleft size-thumbnail wp-image-319" style="border: 1px solid #CCC;" />Here we continue our exploration of polygons and collision detection.  This sketch detects the intersection of two convex polygons using the method of separating axes.  The method of separating axes considers each edge of a given polygon, and determines the projection of the extreme vertices of another polygon onto the line defined by the endpoints of the edge. ... <a href="http://lindiemoungu.com/?p=343" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=343</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Axis Projection</title>
		<link>http://lindiemoungu.com/?p=316</link>
		<comments>http://lindiemoungu.com/?p=316#comments</comments>
		<pubDate>Sat, 01 Oct 2011 05:30:46 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Physics]]></category>
		<category><![CDATA[Polygons]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=316</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2011/09/Axis-Projection-150x150.jpg" alt="" title="Axis-Projection" width="150" height="150" class="alignleft size-thumbnail wp-image-319" style="border: 1px solid #CCC;" />  Here we continue our exploration of polygons, and specifically the projection of their extreme vertices on an arbitrary line or axis.  What do I mean by extreme vertices?  I mean the pair of vertices that are the most nearly aligned with a given line or axis.  How do we determine that pair of vertices? ... <a href="http://lindiemoungu.com/?p=316" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=316</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Convex Hull</title>
		<link>http://lindiemoungu.com/?p=302</link>
		<comments>http://lindiemoungu.com/?p=302#comments</comments>
		<pubDate>Wed, 28 Sep 2011 06:22:22 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Polygons]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=302</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2011/09/Convex-Hull-150x150.jpg" alt="" title="Convex-Hull" width="150" height="150" class="alignleft size-thumbnail wp-image-304" /><em>Convex Hull</em>.  This week I've decided to explore <a href="http://en.wikipedia.org/wiki/Polygon">polygons</a>.  It's essential to understand how to represent polygons for two-dimensional physical simulations.  As its name implies, this sketch is a visualization of a <a href="http://en.wikipedia.org/wiki/Graham_scan">Graham Scan</a>: an algorithm for computing the <a href="http://en.wikipedia.org/wiki/Convex_hull">convex hull </a>of a finite set of points. ... <a href="http://lindiemoungu.com/?p=302" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=302</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Excuse me, pardon me. Pardon me, excuse me.</title>
		<link>http://lindiemoungu.com/?p=290</link>
		<comments>http://lindiemoungu.com/?p=290#comments</comments>
		<pubDate>Sat, 24 Sep 2011 16:54:25 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Collision Detection]]></category>
		<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Particles]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=290</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2011/09/excuse-me-150x150.jpg" alt="" title="excuse-me" width="150" height="150" class="alignleft size-thumbnail wp-image-293" /><em>Excuse me, pardon me.  Pardon me, excuse me.</em> is an adaptation of my recent experiments with <a href="http://lindiemoungu.com/?p=278">sweep line collision detection</a> to an isometric grid.  Since I'm now developing isometric games, I thought it'd be useful to do some explorations with isometric projection as well as collision detection. ... <a href="http://lindiemoungu.com/?p=290" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=290</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Collision Detection</title>
		<link>http://lindiemoungu.com/?p=278</link>
		<comments>http://lindiemoungu.com/?p=278#comments</comments>
		<pubDate>Tue, 20 Sep 2011 05:47:20 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Collision Detection]]></category>
		<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Particles]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=278</guid>
		<description><![CDATA[<img class="alignleft" src="http://lindiemoungu.com/wordpress/wp-content/uploads/2011/09/Collision-Detection-150x150.jpg" alt="" title="Collision-Detection" width="150" height="150" /><em>Collision Detection </em>is a test of my recent port of David Eberly's sweep-line collision detection algorithm.  The algorithm and it's explantation can be found in David Eberly's <a href="http://www.elsevierdirect.com/product.jsp?isbn=9780123749031">Game Physics, 1st Edition</a> published by Morgan Kaufmann Publishers. ... <a href="http://lindiemoungu.com/?p=278" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=278</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Brownsville</title>
		<link>http://lindiemoungu.com/?p=143</link>
		<comments>http://lindiemoungu.com/?p=143#comments</comments>
		<pubDate>Thu, 23 Sep 2010 00:18:08 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Selected Projects]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/?p=143</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2010/09/Brownsville-1-150x150.jpg" alt="Brownsville" title="Brownsville" width="150" height="150" class="alignleft size-thumbnail wp-image-151" />Brownsville, TX is the southernmost city in the United States. Situated at the mouth of the Rio Grande and on the border between the United States and Mexico, Brownsville has enjoyed a rich history. The kiosks I've developed at <a href="http://www.madsystems.com/?page_id=1272">Mad Systems</a> are situated at each of nine historic sites throughout the city. Each kiosk displays an image of the historic location as it looks today. ... <a href="http://lindiemoungu.com/?p=143" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=143</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Box</title>
		<link>http://lindiemoungu.com/?p=54</link>
		<comments>http://lindiemoungu.com/?p=54#comments</comments>
		<pubDate>Mon, 12 Apr 2010 05:30:56 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Particles]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/wordpress/?p=54</guid>
		<description><![CDATA[<img class="alignleft" title="Box" src="http://lindiemoungu.com/wordpress/wp-content/uploads/2010/04/Box-150x150.jpg" alt="Box" width="150" height="150" /><em>Box </em>is a test of my recent port of the <a href="http://www.cs.princeton.edu/~traer/physics/">Traer Physics Engine</a> to ActionScript.  The sketch itself is a variation of one of the featured example sketches of the same name.  The 3D viewing pipeline is my own ActionScript implementation derived from the book  ... <a href="http://lindiemoungu.com/?p=54" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=54</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Meshy</title>
		<link>http://lindiemoungu.com/?p=42</link>
		<comments>http://lindiemoungu.com/?p=42#comments</comments>
		<pubDate>Mon, 29 Mar 2010 14:36:33 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Experiments]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/wordpress/?p=42</guid>
		<description><![CDATA[<img class="alignleft" title="Meshy" src="http://lindiemoungu.com/wordpress/wp-content/uploads/2010/03/Meshy-150x150.jpg" alt="Meshy" width="150" height="150" /><em>Meshy</em> was originally written by <a title="Meshy" href="http://www.flong.com/projects/meshy/">Golan Levin.</a> I've always loved this sketch, and I finally found the time to port it to ActionScript.  If you're interested in understanding Bezier math, there are a lot of useful tricks in the code, including a routine that re-parametrizes curves by arc length. ... <a href="http://lindiemoungu.com/?p=42" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=42</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Particles</title>
		<link>http://lindiemoungu.com/?p=28</link>
		<comments>http://lindiemoungu.com/?p=28#comments</comments>
		<pubDate>Mon, 29 Mar 2010 07:49:25 +0000</pubDate>
		<dc:creator>Lindi</dc:creator>
				<category><![CDATA[Experiments]]></category>
		<category><![CDATA[Particles]]></category>

		<guid isPermaLink="false">http://lindiemoungu.com/wordpress/?p=28</guid>
		<description><![CDATA[<img src="http://lindiemoungu.com/wordpress/wp-content/uploads/2010/03/Particles-150x150.jpg" width="150" height="150" title="Particles" alt="Particles" class="alignleft" />Here's the first of what I'm hoping will be some fruitful experiments with particle systems.  This sketch is very simple.  There are four attractors and the force of each attractor is used to compute the position of each particle at every step of the simulation. ... <a href="http://lindiemoungu.com/?p=28" class="more-link">Continue reading ...</a>]]></description>
		<wfw:commentRss>http://lindiemoungu.com/?feed=rss2&#038;p=28</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
