<div dir="ltr"><div style="font-family:arial,sans-serif;font-size:12.727272033691406px">Hi,</div><div style="font-family:arial,sans-serif;font-size:12.727272033691406px">I realized that the <a href="https://github.com/qsnake/vtk/blob/master/Graphics/vtkAreaContourSpectrumFilter.cxx">contour spectrum for area computation function</a> in VTK is not using the B-Spline algorithm that Bajaj described in<a href="http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2376&amp;context=cstech"> his paper</a>  . </div>
<div style="font-family:arial,sans-serif;font-size:12.727272033691406px">However, VTK cites Bajaj&#39;s paper for this function: <a href="http://www.vtk.org/doc/nightly/html/classvtkAreaContourSpectrumFilter.html" target="_blank">http://www.vtk.org/doc/nightly/html/classvtkAreaContourSpectrumFilter.html</a><br>
</div><div style="font-family:arial,sans-serif;font-size:12.727272033691406px">The VTK function &quot;vtkAreaContourSpectrumFilter&quot; computes the area of isosurface mesh, which is supposed to be not available in Bajaj&#39;s algorithm. So I am guessing it is not using Bajaj&#39;s algorithm.<br>
</div><div style="font-family:arial,sans-serif;font-size:12.727272033691406px">Is VTK&#39;s program going to be more efficient than the B-Spline approach? Or the problems they are solving are different? I am trying to request contour spectrum for my data. It will be nice to use VTK&#39;s implementation.</div>
<div style="font-family:arial,sans-serif;font-size:12.727272033691406px">Thanks,</div><div style="font-family:arial,sans-serif;font-size:12.727272033691406px">Xin Tong</div><div style="font-family:arial,sans-serif;font-size:12.727272033691406px">
The Ohio State University</div><div style="font-family:arial,sans-serif;font-size:12.727272033691406px"><br></div></div>