[vtkusers] Re:Is vtkMarchingCubes has ambiguity problem?

[wb]

hello
i believe your question is about contour ambiguity.in fact, i am not sure that i can give you something useful.but maybe we can discuss that.there are three way to resolve the maching cube algorithm.
first,you can use the marching tetrahedra technique that tessellates the cubes with tetrahedron.
second.you can try the asymptotic decider ,in this way ,you can evaluate the asymptitic of the surface, and then choose the cases to either join or break the contour.
third,this is easy way. in VTK ,this way extends the  original maching cubes cases by adding additional complementary cases.so marching cubes can be applied to any cell type topologically equivalent to a cube.
                                      zeko
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20020725/0da28977/attachment.htm>