triangulation Wiki Rss Feedhttps://triangulation.codeplex.com/triangulation Wiki Rss DescriptionUpdated Wiki: Homehttps://triangulation.codeplex.com/wikipage?version=6<div class="wikidoc">
<p>This package can perform a very fast Delaunay triangulation for a set of points in a plane. It uses the hilbert sort and the Bowyer-Watson algorithm.<br>
<br>
The main class takes the coordinates a set of points and determines which form edges of a triangle whose points are on the same circumference. It can be used to find minimum spanning trees.<br>
<br>
Another class can render the graph of triangles with the edges computed with the Delaunay triangulation.</p>
<p><img src="http://download-codeplex.sec.s-msft.com/Download?ProjectName=triangulation&DownloadId=880600" alt="" width="400" height="400"></p>
<p> </p>
<p> </p>
<p> </p>
<h1><strong>This project has moved.</strong> For the latest updates, please <a href="https://tetramatrix.github.io/triangulation/">go here</a>.</h1>
</div><div class="ClearBoth"></div>PhpdevpadWed, 14 Jun 2017 14:38:20 GMTUpdated Wiki: Home 20170614023820PUpdated Wiki: Homehttps://triangulation.codeplex.com/wikipage?version=5<div class="wikidoc">
<p>This package can perform a very fast Delaunay triangulation for a set of points in a plane. It uses the hilbert sort and the Bowyer-Watson algorithm.<br>
<br>
The main class takes the coordinates a set of points and determines which form edges of a triangle whose points are on the same circumference. It can be used to find minimum spanning trees.<br>
<br>
Another class can render the graph of triangles with the edges computed with the Delaunay triangulation.</p>
<p><img src="http://download-codeplex.sec.s-msft.com/Download?ProjectName=triangulation&DownloadId=880600" alt="" width="400" height="400"></p>
</div><div class="ClearBoth"></div>PhpdevpadWed, 11 Jan 2017 12:14:51 GMTUpdated Wiki: Home 20170111121451PUpdated Wiki: Homehttps://triangulation.codeplex.com/wikipage?version=4<div class="wikidoc">
<p>This package can perform a very fast Delaunay triangulation for a set of points in a plane.<br>
<br>
The main class takes the coordinates a set of points and determines which form edges of a triangle whose points are on the same circumference. It can be used to find minimum spanning trees.<br>
<br>
Another class can render the graph of triangles with the edges computed with the Delaunay triangulation.<br>
</p>
<p><img src="http://download-codeplex.sec.s-msft.com/Download?ProjectName=triangulation&DownloadId=880600" alt="" width="400" height="400"></p>
</div><div class="ClearBoth"></div>PhpdevpadWed, 11 Jan 2017 12:14:20 GMTUpdated Wiki: Home 20170111121420PUpdated Wiki: Homehttps://triangulation.codeplex.com/wikipage?version=3<div class="wikidoc">
<p>This package can perform Delaunay triangulation for a set of points in a plane.<br>
<br>
The main class takes the coordinates a set of points and determines which form edges of a triangle whose points are on the same circumference. It can be used to find minimum spanning trees.<br>
<br>
Another class can render the graph of triangles with the edges computed with the Delaunay triangulation.<br>
<br>
</p>
<p><img src="http://download-codeplex.sec.s-msft.com/Download?ProjectName=triangulation&DownloadId=880600" alt="" width="400" height="400"></p>
</div><div class="ClearBoth"></div>PhpdevpadFri, 18 Jul 2014 16:28:03 GMTUpdated Wiki: Home 20140718042803P