CGAL users discussion list

[Ianic <>]

I've edited the File_medit.h file to add a "Neighbours" section, like so:

  os << "Neighbours" << std::endl
     << c3t3.number_of_cells() << std::endl;
  for( Cell_iterator cit = c3t3.cells_begin() ;
       cit != c3t3.cells_end() ;
       ++cit )
  {
    const Cell_handle& c = cit;
    for ( int i=0 ; i<4 ; ++i ) {
      const Cell_handle& neighbor = c->neighbor(i);
      if ( c3t3.is_in_complex(neighbor) )
        os << C[neighbor] << " ";
      else
        os << -1 << " ";
    }
    os << std::endl;
  }

Here C is std::map<Cell_handle, int> to keep track of cell numbers. The
point of doubt that I have is whether my detection of boundary elements is
correct. What exactly does c3t3.is_in_complex() check for? My naive
understanding right now is that if a neighbour is outside a complex, it
means that the element I look from (const Cell_handle& c) lies on a boundary
and therefore some of its neighbours do not belong to a mesh. Am I right
here?
-- 
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Neighbours-list-in-3D-meshing-tp2075323p2075669.html
Sent from the cgal-discuss mailing list archive at Nabble.com.