PolygonTriangulation Wiki & Documentation Rss Feedhttp://www.codeplex.com/PolygonTriangulation/Wiki/View.aspx?title=HomePolygonTriangulation Wiki Rss DescriptionUPDATED WIKI: Homehttp://www.codeplex.com/PolygonTriangulation/Wiki/View.aspx?title=Home&version=4<div class="wikidoc">
<b>Project Description</b><br />A concise implementation of the 'ear clipping' algorithm to convert simple (convex or concave, no holes) polygons to a collection of triangles. These triangles can then easily be used in 3D mesh geometries. The implementation favors simplicity over performance.<br /><br />The project is provided as a VS2008 solution and two C# classes.<br /><br />The two classes are:<br />1) a simple Polygon class that calculates polygon area, determines vertex types and knows how to close a polygon.<br />2) a Triangulation2D class that takes a Polygon instance and returns a list of triangles that covers the polygon.<br /><br />A simple Winform form is included to generate random polygons that test the algorithm, and to provide a sample of how to use the Triangulation2D class.<br /><br />Sample source code is provided showing how to convert the resulting triangles to a WPF 3D MeshGeometry3D.
<br /> <br /><img src="http://www.codeplex.com/Project/Download/FileDownload.aspx?ProjectName=PolygonTriangulation&DownloadId=32620" alt="Polygons3D.jpg" /><br />
</div>BillOvermanFri, 18 Apr 2008 03:51:42 GMTUPDATED WIKI: Home 20080418035142AUPDATED WIKI: Homehttp://www.codeplex.com/PolygonTriangulation/Wiki/View.aspx?title=Home&version=3<div class="wikidoc">
<b>Project Description</b><br />A concise implementation of the 'ear clipping' algorithm to convert simple (convex or concave, no holes) polygons to a collection of triangles. These triangles can then easily be used in 3D mesh geometries. The implementation favors simplicity over performance.<br /><br />The project is provided as a VS2008 solution and two C# classes.<br /><br />The two classes are:<br />1) a simple Polygon class that calculates polygon area, determines vertex types and knows how to close a polygon.<br />2) a Triangulation2D class that takes a Polygon instance and returns a list of triangles that covers the polygon.<br /><br />A simple Winform form is included to generate random polygons that test the algorithm, and to provide a sample of how to use the Triangulation2D class.<br /><br />Sample source code is provided showing how to convert the resulting triangles to a WPF 3D MeshGeometry3D.
<br /> <br />
</div>BillOvermanFri, 18 Apr 2008 03:51:12 GMTUPDATED WIKI: Home 20080418035112AUPDATED WIKI: Homehttp://www.codeplex.com/PolygonTriangulation/Wiki/View.aspx?title=Home&version=2<div class="wikidoc">
<b>Project Description</b><br />A concise implementation of the 'ear clipping' algorithm to convert simple (convex or concave, no holes) polygons to a collection of triangles. These triangles can then easily be used in 3D mesh geometries. The implementation favors simplicity over performance.<br /><br />The project is provided as a VS2008 solution and C# classes.<br /><br />The two classes are:<br />1) a simple Polygon class that calculates polygon area, determines vertex types and knows how to close a polygon.<br />2) a Triangulation class that takes a Polygon instance and returns a list of triangles that covers the polygon.<br /><br />A simple Winform form is included to generate random polygons that test the algorithm, and to provide a sample of how to use the Triangulation class.<br /><br />Sample source code is provided showing how to convert the resulting triangles to a WPF 3D MeshGeometry3D.
<br />
</div>BillOvermanFri, 18 Apr 2008 03:22:43 GMTUPDATED WIKI: Home 20080418032243A