<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content="text/html; charset=gb2312" http-equiv=Content-Type>
<META content="MSHTML 5.00.2920.0" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT size=2>hello<BR>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.<BR>first,you can use the marching tetrahedra technique that
tessellates the cubes with tetrahedron.<BR>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.<BR>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.<BR>
zeko</FONT></DIV></BODY></HTML>