<span class="gmail_quote"><br></span>Hi all,<br><br>We know there are Marching Cubes and other similar
isosurface extraction classes in VTK. I want to know whether there is a
class uisng "seed cells" approach. In Marching Cubes, all cells are
searched for isosurface intersection, and thus O(N) time is needed. One
of the techniques avoiding exhaustive scanning is seed cells approach,
which identifies a collection of seed cells and performing contour
propagation from the seed cells [1, 2],
<br><br>[1] T. Itoh and K. Koyamada. Automatic isosurface propagation
using an extrema graph and sorted boundary cell lists. IEEE
Transactions on Visualization and Computer Graphics, 1(4):319¨C327,
December 1995.<br>[2] M. van Kreveld, R. van Oostrum, C. L. Bajaj, V.
Pascucci, and D. R. Schikore. Contour trees and small seed sets for
isosurface traversal. In Proc. ACM Symp. on Comput. Geom., pages
212¨C220, 1997.
<br><br>Anyone give me any ideas?<br><br>Thanks!<br><span class="sg"><br>James<br>
</span>