So, that should work for non-convex ones too? If so I am going to try this.<br><br>Thanks<br>P<br><br><div class="gmail_quote">On Tue, Mar 12, 2013 at 5:28 PM, Will Schroeder <span dir="ltr"><<a href="mailto:will.schroeder@kitware.com" target="_blank">will.schroeder@kitware.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0pt 0pt 0pt 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr">The last I checked the vtkPolyon triangulate methods work pretty well (I've triangulated very complex polygons including the outlines of US states, etc.) In the past I've used this in combination with the triangle area computing routines.<div>
<br></div></div><div class="gmail_extra"><br><br><div class="gmail_quote"><div><div class="h5">On Tue, Mar 12, 2013 at 12:07 PM, Moreland, Kenneth <span dir="ltr"><<a href="mailto:kmorel@sandia.gov" target="_blank">kmorel@sandia.gov</a>></span> wrote:<br>
</div></div><blockquote class="gmail_quote" style="margin:0pt 0pt 0pt 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div><div class="h5">
<div style="font-size:14px;font-family:Calibri,sans-serif;word-wrap:break-word">
<div>
<div>
<div>I might be mistaken, but I thought the triangulation filter correctly handled concave polygons. The advice I usually see on the ParaView mailing list when someone's concave polygons are not rendering correctly is to triangulate them.</div>
</div>
</div>
<div><br>
</div>
<div>-Ken</div>
<div><br>
</div>
<span>
<div style="padding:3pt 0in 0in;text-align:left;font-size:11pt;border-width:1pt medium medium;border-style:solid none none;border-color:rgb(181,196,223) -moz-use-text-color -moz-use-text-color;font-family:Calibri">
<span style="font-weight:bold">From: </span>Philippe Pébay <<a href="mailto:philippe.pebay@kitware.com" target="_blank">philippe.pebay@kitware.com</a>><br>
<span style="font-weight:bold">Date: </span>Tuesday, March 12, 2013 9:53 AM<br>
<span style="font-weight:bold">To: </span>David Thompson <<a href="mailto:david.thompson@kitware.com" target="_blank">david.thompson@kitware.com</a>><br>
<span style="font-weight:bold">Cc: </span>VTK Developers <<a href="mailto:vtk-developers@vtk.org" target="_blank">vtk-developers@vtk.org</a>><br>
<span style="font-weight:bold">Subject: </span>[EXTERNAL] Re: [vtk-developers] Measuring the area of arbitrary polygons<br>
</div><div><div>
<div><br>
</div>
<blockquote style>
<div>
<div>Hello D<br>
<br>
Thanks for the prompt answer. So this is what I was concerned about :) Namely that there is no way to generically deal with concave polygons at this point. In fact, just finding a correct triangulation is not trivial. One could for instance compute a CDT and
remove outside triangles. This would be computationally expensive for large meshes composed of such elements, but is there another choice?<br>
<br>
Thanks<br>
P<br>
<br>
<div class="gmail_quote">On Tue, Mar 12, 2013 at 3:31 PM, David Thompson <span dir="ltr">
<<a href="mailto:david.thompson@kitware.com" target="_blank">david.thompson@kitware.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0pt 0pt 0pt 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">
Hi P,<br>
<div><br>
> Is anyone aware of a routine already available to measure the surface area of arbitrary planar polygons in VTK, including non-convex ones?<br>
<br>
</div>
I don't know of anything in VTK to handle concave polygons. For convex ones, I believe the triangulate filter followed by the mesh quality filter should get you the area of a decomposition of the polygon. Assuming that the triangulate filter creates pedigree
IDs, you could sum areas with matching pedigree IDs.<br>
<span><font color="#888888"><br>
David</font></span></blockquote>
</div>
<br>
<br clear="all">
<br>
-- <br>
<font color="#888888">Philippe Pébay, PhD<br>
</font><font color="#888888">Director of Visualization and High Performance Computing /<br>
</font><font color="#888888">Directeur de la Visualisation et du Calcul Haute Performance<br>
Kitware SAS<br>
26 rue Louis Guérin, 69100 Villeurbanne, France</font><br>
<font color="#888888"><a value="+33426685003">+33 (0) 6.83.61.55.70 / 4.37.45.04.15</a></font><font color="#888888"><br>
<a href="http://www.kitware.fr/" target="_blank">http://www.kitware.fr</a></font><font color="#888888"><a href="http://www.kitware.fr/" target="_blank"></a></font></div>
</div>
</blockquote>
</div></div></span>
</div>
<br></div></div>_______________________________________________<br>
Powered by <a href="http://www.kitware.com" target="_blank">www.kitware.com</a><br>
<br>
Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
<br>
Follow this link to subscribe/unsubscribe:<br>
<a href="http://www.vtk.org/mailman/listinfo/vtk-developers" target="_blank">http://www.vtk.org/mailman/listinfo/vtk-developers</a><br>
<br>
<br></blockquote></div><span class="HOEnZb"><font color="#888888"><br><br clear="all"><div><br></div>-- <br>William J. Schroeder, PhD<br>Kitware, Inc.<br>28 Corporate Drive<br>Clifton Park, NY 12065<br><a href="mailto:will.schroeder@kitware.com" target="_blank">will.schroeder@kitware.com</a><br>
<a href="http://www.kitware.com" target="_blank">http://www.kitware.com</a><br><a href="tel:%28518%29%20881-4902" value="+15188814902" target="_blank">(518) 881-4902</a>
</font></span></div>
</blockquote></div><br><br clear="all"><br>-- <br><font color="#888888">Philippe Pébay, PhD<br></font><font color="#888888">Director of Visualization and High Performance Computing /<br>
</font><font color="#888888">Directeur de la Visualisation et du Calcul Haute Performance<br>
Kitware SAS<br>26 rue Louis Guérin, 69100 Villeurbanne, France</font><br>
<font color="#888888"><a value="+33426685003">+33 (0) 6.83.61.55.70 / 4.37.45.04.15</a></font><font color="#888888"><br><a href="http://www.kitware.fr/" target="_blank">http://www.kitware.fr</a></font><font color="#888888"><a href="http://www.kitware.fr/" target="_blank"></a></font>