the algorithms in the CGAL library might be a good starting point in terms of looking into other algorithmic approaches<div><a href="http://www.cgal.org/">http://www.cgal.org/</a></div><div>it has a excellent set of references for its component parts<br>

<br><div class="gmail_quote">On Sun, Jun 5, 2011 at 11:41 AM, Andrew Coppin <span dir="ltr">&lt;<a href="mailto:andrewcoppin@btinternet.com">andrewcoppin@btinternet.com</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">

<div class="im">On 04/06/2011 08:25 PM, Tom Hawkins wrote:<br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
What is the easiest way to generate polygon meshes from constructive<br>
solid geometry?  Marching cubes [4] seems pretty involved.<br>
</blockquote>
<br></div>
As I understand it, this is a Very Hard Problem. This is (one of the reasons) why there are so few converters from POV-Ray to mesh-based formats; it&#39;s highly non-trivial to tesselate CSG.<div><div></div><div class="h5">

<br>
<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org" target="_blank">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br></div>