<div dir="ltr"><div class="gmail_default" style="font-family:verdana,sans-serif">Example code: <a href="http://pastebin.com/WELbtBSb">http://pastebin.com/WELbtBSb</a></div></div><div class="gmail_extra"><br><div class="gmail_quote">2015-03-24 16:22 GMT-03:00 Tarcísio Fischer <span dir="ltr"><<a href="mailto:tarcisio.fischer.cco@gmail.com" target="_blank">tarcisio.fischer.cco@gmail.com</a>></span>:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div class="gmail_default" style="font-family:verdana,sans-serif">I'm playing with vtk using unstructured grids composed with polyhedron elements. I used some algorithms such as vtkPolyDataNormals and vtkExtractUnstructuredGrid and they didn't seem to work with polyhedrons. (For example, take a look at <a href="http://www.paraview.org/Bug/bug_relationship_graph.php?bug_id=14594" target="_blank">http://www.paraview.org/Bug/bug_relationship_graph.php?bug_id=14594</a>).</div><div class="gmail_default" style="font-family:verdana,sans-serif"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif">Question is: How do I know which algorithms will work with polyhedrons?</div></div>
</blockquote></div><br></div>