<?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>nodename &#187; Delaunay</title>
	<atom:link href="http://nodename.com/blog/tag/delaunay/feed/" rel="self" type="application/rss+xml" />
	<link>http://nodename.com/blog</link>
	<description></description>
	<lastBuildDate>Wed, 11 Apr 2012 20:39:41 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>Blobs in Games: Polygon Map Generation, by Amit Patel</title>
		<link>http://nodename.com/blog/2010/10/02/blobs-in-games-polygon-map-generation-by-amit-patel/</link>
		<comments>http://nodename.com/blog/2010/10/02/blobs-in-games-polygon-map-generation-by-amit-patel/#comments</comments>
		<pubDate>Sat, 02 Oct 2010 23:20:07 +0000</pubDate>
		<dc:creator>alan</dc:creator>
				<category><![CDATA[ActionScript]]></category>
		<category><![CDATA[ボロノイ]]></category>
		<category><![CDATA[Delaunay]]></category>
		<category><![CDATA[Voronoi]]></category>

		<guid isPermaLink="false">http://nodename.com/blog/?p=670</guid>
		<description><![CDATA[<p>Amit Patel has published a great article on map generation based upon Voronoi polygons.  He generates the Voronoi polygons using my as3delaunay library.  But the polygons are just the beginning of his process&#8230;</p>
<p>Try the demo!  And &#8212; yum &#8212; see the <span style="color:#777"> . . . &#8594; Read More: <a href="http://nodename.com/blog/2010/10/02/blobs-in-games-polygon-map-generation-by-amit-patel/">Blobs in Games: Polygon Map Generation, by Amit Patel</a></span>]]></description>
			<content:encoded><![CDATA[<p>Amit Patel has published a <a href="http://www-cs-students.stanford.edu/~amitp/game-programming/polygon-map-generation/">great article on map generation</a> based upon Voronoi polygons.  He generates the Voronoi polygons using my <a href="http://github.com/nodename/as3delaunay">as3delaunay library</a>.  But the polygons are just the beginning of his process&#8230;</p>
<p><a href="http://www-cs-students.stanford.edu/~amitp/game-programming/polygon-map-generation/mapgen2.swf">Try the demo!</a>  And &#8212; yum &#8212; <a href="http://github.com/amitp/mapgen2">see the source code!</a></p>
]]></content:encoded>
			<wfw:commentRss>http://nodename.com/blog/2010/10/02/blobs-in-games-polygon-map-generation-by-amit-patel/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Roll Over, Delaunay: Voronoi Library Goes Open-Source</title>
		<link>http://nodename.com/blog/2009/12/03/roll-over-delaunay-voronoi-library-goes-open-source/</link>
		<comments>http://nodename.com/blog/2009/12/03/roll-over-delaunay-voronoi-library-goes-open-source/#comments</comments>
		<pubDate>Thu, 03 Dec 2009 04:28:55 +0000</pubDate>
		<dc:creator>alan</dc:creator>
				<category><![CDATA[ActionScript]]></category>
		<category><![CDATA[ボロノイ]]></category>
		<category><![CDATA[Delaunay]]></category>
		<category><![CDATA[Voronoi]]></category>

		<guid isPermaLink="false">http://nodename.com/blog/?p=377</guid>
		<description><![CDATA[I've released the as3delaunay library on github! <span style="color:#777"> . . . &#8594; Read More: <a href="http://nodename.com/blog/2009/12/03/roll-over-delaunay-voronoi-library-goes-open-source/">Roll Over, Delaunay: Voronoi Library Goes Open-Source</a></span>]]></description>
			<content:encoded><![CDATA[<p>A few people have asked for the code for my <a href="http://nodename.com/blog/2009/05/11/a-voronoi-toy/">Voronoi Toy</a>.  I haven&#8217;t made the entire program public yet, but I have released the underlying <a href="http://nodename.github.com/as3delaunay/">as3delaunay library</a>, which I originally ported from Steven Fortune&#8217;s C implementation of his plane-sweep algorithm.</p>
<p>In addition to the Voronoi diagram and the Delaunay triangulation, the library also provides the convex hull, minimum and maximum <a href="http://nodename.com/blog/2009/05/12/the-name-of-the-node/">spanning trees</a>, and several other related geometric entities.</p>
<p>You can download the source and compile it, or just get the compiled swc from the downloads page.</p>
<p>So far I have had two users, JakeTastic (<a href="http://jaketastic.com/blog/voronoi-shattering-complete/">Voronoi shattering complete!</a>) and Li (<a href="http://www.lidev.com.ar/?p=303">Faster Voronoi Noise</a>); thanks to them both for jumping on, and to Jake also for finding the two bugs :-)</p>
<p>There&#8217;s no documentation yet, but there is a <a href="http://github.com/nodename/as3delaunayTestRunner">test suite</a> which incorporates an example of using the library for nearest-site queries, and there&#8217;s also a <a href="http://groups.google.com/group/as3delaunay">mailing list</a>, where I&#8217;ve archived Fortune&#8217;s paper and his C code, as well as a growing page of interesting <a href="http://groups.google.com/group/as3delaunay/web/resources">links</a> related to Voronoi/Delaunay.</p>
<p>The library is hosted on github, so YOU can conveniently modify, fix, or enhance it!</p>
<p>Roadmap for possible enhancements:<br />
Generalize to support weighted Voronoi diagrams, both additive and multiplicative (This is described in Fortune&#8217;s paper)<br />
Generalize to use an arbitrary polygon as a boundary<br />
&#8230; what else?</p>
]]></content:encoded>
			<wfw:commentRss>http://nodename.com/blog/2009/12/03/roll-over-delaunay-voronoi-library-goes-open-source/feed/</wfw:commentRss>
		<slash:comments>17</slash:comments>
		</item>
		<item>
		<title>Mona Voronita</title>
		<link>http://nodename.com/blog/2009/05/18/mona-voronita/</link>
		<comments>http://nodename.com/blog/2009/05/18/mona-voronita/#comments</comments>
		<pubDate>Tue, 19 May 2009 02:39:45 +0000</pubDate>
		<dc:creator>alan</dc:creator>
				<category><![CDATA[ActionScript]]></category>
		<category><![CDATA[ボロノイ]]></category>
		<category><![CDATA[Delaunay]]></category>
		<category><![CDATA[geometry]]></category>
		<category><![CDATA[Voronoi]]></category>

		<guid isPermaLink="false">http://nodename.com/blog/?p=139</guid>
		<description><![CDATA[<p>Click on the image to see 1000 Voronoi points in motion.  Keyboard controls as in the Voronoi Toy.</p>
<p>If the popup won&#8217;t go away when you click the X, click in the movie and hit &#8220;s&#8221; to stop the moving points.</p>
<p>

 </p>
<p>I couldn&#8217;t <span style="color:#777"> . . . &#8594; Read More: <a href="http://nodename.com/blog/2009/05/18/mona-voronita/">Mona Voronita</a></span>]]></description>
			<content:encoded><![CDATA[<p>Click on the image to see 1000 Voronoi points in motion.  Keyboard controls as in the <a href="http://nodename.com/blog/2009/05/11/a-voronoi-toy/" target="_blank">Voronoi Toy</a>.</p>
<p>If the popup won&#8217;t go away when you click the X, click in the movie and hit &#8220;s&#8221; to stop the moving points.</p>
<p><center><br />
<a href="/wpEmbeds/MonaVoronita/bin/MonaVoronita.swf" rel="shadowbox;width=298;height=425"><img src="/wpEmbeds/MonaVoronita/MonaOnCrack.jpg" alt="" /></a><br />
 </center></p>
<p>I couldn&#8217;t resist, <a href="http://www.dasprinzip.com/prinzipiell/2008/08/25/voronoi-tesselations/" target="_blank">Frank</a>!</p>
]]></content:encoded>
			<wfw:commentRss>http://nodename.com/blog/2009/05/18/mona-voronita/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>The Name of the Node: Image Fill with Spanning Trees</title>
		<link>http://nodename.com/blog/2009/05/12/the-name-of-the-node/</link>
		<comments>http://nodename.com/blog/2009/05/12/the-name-of-the-node/#comments</comments>
		<pubDate>Tue, 12 May 2009 18:31:19 +0000</pubDate>
		<dc:creator>alan</dc:creator>
				<category><![CDATA[ActionScript]]></category>
		<category><![CDATA[ボロノイ]]></category>
		<category><![CDATA[Delaunay]]></category>
		<category><![CDATA[geometry]]></category>
		<category><![CDATA[Voronoi]]></category>

		<guid isPermaLink="false">http://nodename.com/blog/?p=118</guid>
		<description><![CDATA[<p>I&#8217;ve rendered some images using the Voronoi Toy from my last post.</p>
<p>I&#8217;ve used my logo 結 (as in 結點 &#8220;node&#8221;) as the input image, run Sakri Rosenstrom&#8217;s image segmentation algorithm on it, dropped 10,000 random points into the segments, and drawn the minimum spanning tree of each set of points, thus creating a sort of space-filling <span style="color:#777"> . . . &#8594; Read More: <a href="http://nodename.com/blog/2009/05/12/the-name-of-the-node/">The Name of the Node: Image Fill with Spanning Trees</a></span>]]></description>
			<content:encoded><![CDATA[<p>I&#8217;ve rendered some images using the <a href="http://nodename.com/blog/2009/05/11/a-voronoi-toy/">Voronoi Toy</a> from my last post.</p>
<p>I&#8217;ve used my logo <a href="http://en.wiktionary.org/wiki/結">結</a> (as in 結點 &#8220;node&#8221;) as the input image, run Sakri Rosenstrom&#8217;s <a href="http://www.sakri.net/blog/2009/03/03/extracting-positive-and-negative-shapes-from-a-bitmapdata/">image segmentation algorithm</a> on it, dropped 10,000 random points into the segments, and drawn the minimum spanning tree of each set of points, thus creating a sort of space-filling tree.</p>
<p>The idea for this kind of fill comes from <a href="http://quasimondo.com/">Mario Klingemann</a>&#8216;s presentation at FITC.</p>
<p>Click on each image for a larger version.</p>
<p><center></p>
<p>
<a href="/wpEmbeds/NameoftheNode/JieSpanningLarge.jpg" rel="shadowbox;width=800;height=800"><img src="/wpEmbeds/NameoftheNode/JieSpanningSmall.jpg" alt="" /></a>
</p>
<p>
<a href="/wpEmbeds/NameoftheNode/JieSpanningNegativeLarge.jpg" rel="shadowbox;width=1161;height=1162"><img src="/wpEmbeds/NameoftheNode/JieSpanningNegativeSmall.jpg" alt="" /></a>
</p>
<p></center></p>
]]></content:encoded>
			<wfw:commentRss>http://nodename.com/blog/2009/05/12/the-name-of-the-node/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Relaxing in the Plane: A Voronoi Toy</title>
		<link>http://nodename.com/blog/2009/05/11/a-voronoi-toy/</link>
		<comments>http://nodename.com/blog/2009/05/11/a-voronoi-toy/#comments</comments>
		<pubDate>Tue, 12 May 2009 01:43:11 +0000</pubDate>
		<dc:creator>alan</dc:creator>
				<category><![CDATA[ActionScript]]></category>
		<category><![CDATA[ボロノイ]]></category>
		<category><![CDATA[Delaunay]]></category>
		<category><![CDATA[geometry]]></category>
		<category><![CDATA[Voronoi]]></category>

		<guid isPermaLink="false">http://nodename.com/blog/?p=68</guid>
		<description><![CDATA[relax, v.
10. Chiefly Physics.  To return towards a state of equilibrium. (OED)
 <span style="color:#777"> . . . &#8594; Read More: <a href="http://nodename.com/blog/2009/05/11/a-voronoi-toy/">Relaxing in the Plane: A Voronoi Toy</a></span>]]></description>
			<content:encoded><![CDATA[<p>relax, v.<br />
10. Chiefly Physics.  To return towards a state of equilibrium. (OED)</p>
<p>Here&#8217;s the planar analog of my earlier post <a href="http://nodename.com/blog/2008/09/19/distributing-points-on-the-sphere/">Distributing Points on the Sphere</a>.  This time I&#8217;ve ported Steve Fortune&#8217;s <a href="http://netlib.org/voronoi/sweep2">C implementation</a> of his sweepline algorithm for Voronoi diagrams, and applied <a href="http://en.wikipedia.org/wiki/Lloyd's_algorithm">Lloyd&#8217;s algorithm</a> to change the input values (the point locations) iteratively so the output function (the stress or energy) approaches a minimum.  Lloyd&#8217;s algorithm works by repeatedly computing the Voronoi diagram and moving each point to the centroid of its region.  Soon the points converge to an even distribution.  You can see this in action by starting the app by clicking on the image, and then pressing the &#8220;r&#8221; key.</p>
<p>While I was at it I built out some more of the basic Voronoi-related geometric structures: the <a href="http://en.wikipedia.org/wiki/Delaunay_triangulation">Delaunay triangulation</a>, the <a href="http://en.wikipedia.org/wiki/Convex_hull">convex hull</a>, the <a href="http://cgm.cs.mcgill.ca/~orm/ontri.html">onion</a>, and the <a href="http://en.wikipedia.org/wiki/Euclidean_minimum_spanning_tree">minimum spanning tree</a>.</p>
<p>I&#8217;ve had fun playing with this app, changing the display options while moving, adding, or removing points.  I hope you enjoy it.</p>
<p><center><br />
<a href="/wpEmbeds/VoronoiToy/bin/PlanePointsApp.swf" rel="shadowbox;width=860;height=650"><img src="/wpEmbeds/VoronoiToy/Creeper.jpg" alt="" /></a></p>
<p>(The app is built for Flash Player 10.)<br />
 </center></p>
]]></content:encoded>
			<wfw:commentRss>http://nodename.com/blog/2009/05/11/a-voronoi-toy/feed/</wfw:commentRss>
		<slash:comments>9</slash:comments>
		</item>
		<item>
		<title>Have you seen this man?</title>
		<link>http://nodename.com/blog/2008/10/12/have-you-seen-this-man/</link>
		<comments>http://nodename.com/blog/2008/10/12/have-you-seen-this-man/#comments</comments>
		<pubDate>Mon, 13 Oct 2008 03:40:14 +0000</pubDate>
		<dc:creator>alan</dc:creator>
				<category><![CDATA[ActionScript]]></category>
		<category><![CDATA[ボロノイ]]></category>
		<category><![CDATA[Delaunay]]></category>
		<category><![CDATA[Flash 10]]></category>
		<category><![CDATA[morph]]></category>
		<category><![CDATA[Voronoi]]></category>

		<guid isPermaLink="false">http://nodename.com/blog/?p=66</guid>
		<description><![CDATA[He supports an expansion of stem-cell research.  He's made nuclear nonproliferation a priority.  He favors combating global warming with a “cap and trade” system.  He supported a bill to expand the government's eavesdropping authority and to protect telephone companies that cooperated with the program from being sued.  He embraces the idea of continuing Bush's faith-based initiative.  He said he was picked last on a sports team as a boy. He said it taught him to work hard and persevere.  His favorite childhood Halloween costume was a pirate. <span style="color:#777"> . . . &#8594; Read More: <a href="http://nodename.com/blog/2008/10/12/have-you-seen-this-man/">Have you seen this man?</a></span>]]></description>
			<content:encoded><![CDATA[<p>He supports an expansion of stem-cell research.  He&#8217;s made nuclear nonproliferation a priority.  He favors combating global warming with a “cap and trade” system.  He supported a bill to expand the government&#8217;s eavesdropping authority and to protect telephone companies that cooperated with the program from being sued.  He embraces the idea of continuing Bush&#8217;s faith-based initiative.  He said he was picked last on a sports team as a boy. He said it taught him to work hard and persevere.  His favorite childhood Halloween costume was a pirate.<br />
<center><br />
<a href="/wpEmbeds/AstroMorpher/bin/AstroMorpher.html" target="_blank"><img src="/wpEmbeds/AstroMorpher/Candidate.jpg" alt="" /></a><br />
</center></p>
<p>Click on the image to open AstroMorpher in a new window (requires Flash Player 10).</p>
<p>The program uses Nicolas Barradeau&#8217;s <a href="http://en.nicoptere.net/?p=10">Delaunay triangulation code</a>.</p>
<p>Download the <a href="http://nodename.com/wpEmbeds/AstroMorpher/AstroMorpher.zip">source archive</a>, which can be imported as a project into Flex Builder 3, or just opened normally to read the code.</p>
<p><a href="http://blog.promethe.net/2008/08/21/work-with-flash-10-in-flex-builder-3/">Work with Flash 10 in Flex Builder 3</a></p>
]]></content:encoded>
			<wfw:commentRss>http://nodename.com/blog/2008/10/12/have-you-seen-this-man/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>

