<HTML><BODY style="word-wrap: break-word; -khtml-nbsp-mode: space; -khtml-line-break: after-white-space; ">You may want to look at the vtkConnectivity filter. I have used that as a basis for other types of "Connectivity" algorithms on poly data.<DIV><BR class="khtml-block-placeholder"></DIV><DIV>Cheers<BR><DIV> <SPAN class="Apple-style-span" style="border-collapse: separate; border-spacing: 0px 0px; color: rgb(0, 0, 0); font-family: Bitstream Vera Sans; font-size: 12px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; text-align: auto; -khtml-text-decorations-in-effect: none; text-indent: 0px; -apple-text-size-adjust: auto; text-transform: none; orphans: 2; white-space: normal; widows: 2; word-spacing: 0px; "><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">-- </DIV><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">Mike Jackson  Senior Research Engineer</DIV><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">Innovative Management & Technology Services</DIV><BR class="Apple-interchange-newline"></SPAN> </DIV><BR><DIV><DIV>On Jan 4, 2007, at 7:53 AM, PAUL wrote:</DIV><BR class="Apple-interchange-newline"><BLOCKQUOTE type="cite"><O:SMARTTAGTYPE namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="chsdate"> <DIV class="Section1" style="layout-grid:15.6pt"><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    vtkCubeSource *pCube = vtkCubeSource::New();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    pCube->SetCenter(0,0,0);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    pCube->SetXLength(2);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    pCube->SetYLength(2);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    pCube->SetZLength(2);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    vtkPolyData *data = pCube->GetOutput();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    </SPAN><SPAN lang="EN-US">data->Update();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    int i;<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    int cellCount = data->GetNumberOfCells();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    int pointCount = data->GetNumberOfPoints();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    vtkIdList *ptsIDList = vtkIdList::New();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    ptsIDList->Allocate(pointCount);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    for (i=0;i<pointCount;i++) {<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        ptsIDList->InsertNextId(i);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">    }<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        vtkIdList *CurrentcellPts = vtkIdList::New();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        data->GetCellPoints(0,CurrentcellPts);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        vtkIdType ptIdinCurrentCell = CurrentcellPts->GetId(0);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        </SPAN><SPAN lang="EN-US"><O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        vtkIdList *cellIDList = vtkIdList::New();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        data-><B><SPAN style="font-weight:bold">GetCellNeighbors</SPAN></B>(i,ptsIDList,cellIDList);<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        int ptscount = ptsIDList->GetNumberOfIds();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">        int cellcount = cellIDList->GetNumberOfIds();<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><I><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size:9.0pt;font-style:italic">cellcount</SPAN></FONT></I><SPAN lang="EN-US"> whould be the number of cells which is adjacent to 0 cell.But <I><SPAN style="font-style:italic">cellcount</SPAN></I> is 0. why?<O:P></O:P></SPAN></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">-----</SPAN>邮件原件<SPAN lang="EN-US">-----<BR> </SPAN>å‘件人<SPAN lang="EN-US">: Dominik Szczerba [<A href="mailto:domi@vision.ee.ethz.ch">mailto:domi@vision.ee.ethz.ch</A>] <BR> </SPAN>å‘é€æ—¶é—´<SPAN lang="EN-US">: <ST1:CHSDATE isrocdate="False" islunardate="False" day="4" month="1" year="2007" w:st="on">2007<SPAN lang="EN-US"><SPAN lang="EN-US">å¹´1</SPAN></SPAN><SPAN lang="EN-US"><SPAN lang="EN-US">月4</SPAN></SPAN><SPAN lang="EN-US"><SPAN lang="EN-US">æ—¥</SPAN></SPAN></ST1:CHSDATE> 18:48<BR> </SPAN>收件人<SPAN lang="EN-US">: <A href="mailto:vtkusers@vtk.org">vtkusers@vtk.org</A><BR> </SPAN>抄é€<SPAN lang="EN-US">: PAUL<BR> </SPAN>主题<SPAN lang="EN-US">: Re: </SPAN>ç”å¤<SPAN lang="EN-US">: [vtkusers] the adjacent vertex</SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">On a second thought the below will not capture all the connected points<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">directly, only at a cell. But you can achieve what you want by combining<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">it with GetCellNeighbours.<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">Another way is to first walk the cells maping them to their points (e,g.<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">using std::map) and then walk the points retreiving the cells and their<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">points. Rejecting duplicates you get what you are after.<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">-DS<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US"><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">Dominik Szczerba wrote:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> You can locate the cell containing the point of interest and call<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> GetCellPoints().<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> DS<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> PAUL wrote:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> Hello all:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> I have been baffled the question for a long time.<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> I am studying an algorithm of judging convex or non-convex polyhedron.<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> If every vertex is above the plane which contain three vertexes<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> adjacent to the vertex, the polyhedron is convex .<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> For an example, there are eight vertexes on a cube. And each vertex is<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> adjacent to three other vertexes.<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> My question is:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> When an arbitrary vertex is accessed, how to know the other three<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> vertexes</SPAN></FONT><FONT face="Courier New"><SPAN lang="EN-US" style="font-family:" courier="" new""="">’</SPAN></FONT><SPAN lang="EN-US"> coordinate?<O:P></O:P></SPAN></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> I need your helps! Thank you!!<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> ------------------------------------------------------------------------<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> *</SPAN>å‘件人<SPAN lang="EN-US">:* vtkusers-bounces+polinzhuo=<A href="mailto:163.com@vtk.org">163.com@vtk.org</A><O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> [<A href="mailto:vtkusers-bounces">mailto:vtkusers-bounces</A>+polinzhuo=<A href="mailto:163.com@vtk.org">163.com@vtk.org</A>] *</SPAN>代表<SPAN lang="EN-US"> *PAUL<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> *</SPAN>å‘é€æ—¶é—´<SPAN lang="EN-US">:* <ST1:CHSDATE isrocdate="False" islunardate="False" day="4" month="1" year="2007" w:st="on">2007<SPAN lang="EN-US"><SPAN lang="EN-US">å¹´1</SPAN></SPAN><SPAN lang="EN-US"><SPAN lang="EN-US">月4</SPAN></SPAN><SPAN lang="EN-US"><SPAN lang="EN-US">æ—¥</SPAN></SPAN></ST1:CHSDATE> 13:44<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> *</SPAN>收件人<SPAN lang="EN-US">:* <A href="mailto:vtkusers@vtk.org">vtkusers@vtk.org</A><O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> *</SPAN>主题<SPAN lang="EN-US">:* [vtkusers] the adjacent vertex<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> Hi,all:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> There is an arbitrary vertex on a polyhedron. How to find the other<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> three vertexes which are adjacent to the vertex?<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> Paul<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> ------------------------------------------------------------------------<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>><O:P> </O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> _______________________________________________<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> This is the private VTK discussion list. <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> Please keep messages on-topic. Check the FAQ at: <A href="http://www.vtk.org/Wiki/VTK_FAQ">http://www.vtk.org/Wiki/VTK_FAQ</A><O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> Follow this link to subscribe/unsubscribe:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">>> <A href="http://www.vtk.org/mailman/listinfo/vtkusers">http://www.vtk.org/mailman/listinfo/vtkusers</A><O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> _______________________________________________<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> This is the private VTK discussion list. <O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> Please keep messages on-topic. Check the FAQ at: <A href="http://www.vtk.org/Wiki/VTK_FAQ">http://www.vtk.org/Wiki/VTK_FAQ</A><O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> Follow this link to subscribe/unsubscribe:<O:P></O:P></SPAN></FONT></P><P class="MsoPlainText"><FONT size="1" face="宋体"><SPAN lang="EN-US" style="font-size: 9.0pt">> <A href="http://www.vtk.org/mailman/listinfo/vtkusers">http://www.vtk.org/mailman/listinfo/vtkusers</A><O:P></O:P></SPAN></FONT></P> </DIV> </O:SMARTTAGTYPE><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">_______________________________________________</DIV><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">This is the private VTK discussion list.<SPAN class="Apple-converted-space"> </SPAN></DIV><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">Please keep messages on-topic. Check the FAQ at: <A href="http://www.vtk.org/Wiki/VTK_FAQ">http://www.vtk.org/Wiki/VTK_FAQ</A></DIV><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">Follow this link to subscribe/unsubscribe:</DIV><DIV style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><A href="http://www.vtk.org/mailman/listinfo/vtkusers">http://www.vtk.org/mailman/listinfo/vtkusers</A></DIV> </BLOCKQUOTE></DIV><BR></DIV></BODY></HTML>