<div dir="ltr"><br>vtkFeatureEdges sounds better to extract the boundary of a 2D mesh than vtkUnstructuredGridGeometryFilter or vtkGeometryFilter that works explicitly for 3D meshes. What Charles could do to prove closeness is to extract all 1D edges that are used by only one surface(2D) cell (i.e., boundary edges). If that set is empty, then the 2D mesh is close.<br>
<br>Regarding the formula T=2V-4 proposed by Michael, it can not prove the closeness, because it's only a necessary condition but not a suffisant one (if the formula is false, then the surface is not close; if it's true, we cannot conclude). It comes from the Euler-Poincaré statement T-E+V=2 for a topologicaly close surface tessalation, and from 3T=2E in case cells are all triangle. <br>
<br>Marie-Gabrielle<br><br>> Date: Fri, 3 Oct 2008 16:04:31 -0300<br>> From: pam <<a href="mailto:papereyra@gmail.com">papereyra@gmail.com</a>><br>> Subject: Re: [vtkusers] Proving a surface mesh of closeness<br>
> To: <a href="mailto:vtkusers@vtk.org">vtkusers@vtk.org</a><br>> Message-ID:<br>> <<a href="mailto:2bcd18a00810031204g77101056w9d46bf649c21baec@mail.gmail.com">2bcd18a00810031204g77101056w9d46bf649c21baec@mail.gmail.com</a>><br>
> Content-Type: text/plain; charset=UTF-8<br>><br>> Hi, I 'm Pamela and I was trying to get the boundary cells, i found a<br>> solution to my problem that maybe could help you.<br>><br>> I finally used vtkUnstructuredGridGeometryFilter because<br>
> vtkFeaturedFilter only works with structured data like vtkPolyData.<br>> Here is the code and how to go through the cells.<br>><br>> vtkUnstructuredGridGeometryFilter*<br>> filter=vtkUnstructuredGridGeometryFilter::New();<br>
> filter->SetInputConnection(delny->GetOutputPort());<br>> filter->Update();<br>> cout<<"filtro"<<endl;<br>> nroceldas=filter->GetOutput()->GetNumberOfCells();<br>> for(t=0;t<nroceldas;t++)<br>
> { celda=filter->GetOutput()->GetCell(t);<br>> list=celda->GetPointIds();<br>> points=celda->GetPoints();<br>> ids=list->GetNumberOfIds();<br>> cout<<"celda "<<t<<endl;<br>
> cout<<"numero de faces "<<celda->GetNumberOfFaces()<<endl;<br>> cout<<"numero de edges "<<celda->GetNumberOfEdges()<<endl;<br>> for(k=0;k<ids;k++)<br>
> {<br>> points->GetPoint(k,punto);<br>> int verticeid= delny->GetOurput()->FindPoint(punto); //I do this<br>> because this filter change the original id<br>
> cout <<"vertice id numero " << verticeid <<endl ;<br>> cout<<" x "<<punto[0]<<" y "<<punto[1]<<" z "<<punto[2]<<endl;<br>
> }<br>> }<br>><br>><br>> Hope it helps!<br>><br>> Pamela<br>><br>> 2008/10/3 Michael Jackson <<a href="mailto:mike.jackson@bluequartz.net">mike.jackson@bluequartz.net</a>>:<br>
> > T=2V-4<br>> ><br>> > Where T is the number of triagles and V is the number of vertices. Something<br>> > about Euler's Polyhedra equation...<br>> ><br>> ><br>> > Mike<br>> ><br>
> > On Oct 3, 2008, at 1:14 PM, Marie-Gabrielle Vallet wrote:<br>> ><br>> >><br>> >> I think there is a easier way of checking the surface closeness. I mean<br>> >> using vtk facilities, instead of writing a (yet another) new algorithm.<br>
> >><br>> >> VTK library has algorithms to extract a mesh boundary, i.e. the set of<br>> >> faces (in 3D) or edges (in 2D) that are not shared by two cells. See<br>> >> vtkFeatureEdges. The mesh is close if and only if this set is empty. If it<br>
> >> not, you can visualize the holes that must still be closed.<br>> >><br>> >> Pamela is trying to do the same thing today. Have a look at the thread<br>> >> "get boundary triangles from a mesh" on this mailing list.<br>
> >><br>> >> By the way, Charles, are you sure you are not re-inventing the wheel ?<br>> >><br>> >> Marie-Gabrielle<br>> >><br>> >> > Date: Fri, 3 Oct 2008 08:17:31 +0200<br>
> >> > From: Dominik Szczerba <<a href="mailto:dominik@itis.ethz.ch">dominik@itis.ethz.ch</a>><br>> >> > Subject: Re: [vtkusers] Proving a surface mesh of closeness<br>> >> > To: <a href="mailto:vtkusers@vtk.org">vtkusers@vtk.org</a><br>
> >> > Message-ID: <<a href="mailto:200810030817.31796.dominik@itis.ethz.ch">200810030817.31796.dominik@itis.ethz.ch</a>><br>> >> > Content-Type: text/plain; charset="utf-8"<br>> >> ><br>
> >> > If it is manifold then pick the 1st element and make sure each one it<br>> >> > has the<br>> >> > proper number of neighbors (for triangles: 3). Mark the element as<br>> >> > 'visited'<br>
> >> > and visit all his neighbors, repeating the procedure. At the end, if<br>> >> > number<br>> >> > of visited elements equals to number of elements in the mesh and all<br>> >> > have<br>
> >> > their expected neighbors the mesh is closed.<br>> >> ><br>> >> > DS<br>> >> ><br>> >> > On Friday 03 October 2008 02:48:59 am Charles Monty Burns wrote:<br>
> >> > > Hello,<br>> >> > ><br>> >> > > I repaired a surface mesh and want to prove whether the mesh is<br>> >> > totally<br>> >> > > closed or not. Save is save ...<br>
> >> > ><br>> >> > > How can I do this?<br>> >> > ><br>> >> > > Greetings<br>> >> ><br>> >> ><br>> >> ><br>> >> > --<br>
> >> > Dominik Szczerba, Ph.D.<br>> >> > Computational Physics Group<br>> >> > Foundation for Research on Information Technologies in Society<br>> >> > <a href="http://www.itis.ethz.ch">http://www.itis.ethz.ch</a><br>
</div>