CGAL users discussion list

[sergio <>]

After check  C:\dev\CGAL-4.12\include\CGAL\Polygon_mesh_processing\repair.h I
found some lines that let it detect non manifold_vertex and non
manifold_edges. I added these lines into individual functions to be used. I
would like to resolve missing definitions adding the correct headers to the
following adapted functions. For example TriangleMesh is not found it. How
can fix these functions definition?

//
----------------------------------------------------------------------------
// manifold-vertex
// ----------------------------------------------------------------------
#include <boost/foreach.hpp>
#include <CGAL/boost/graph/iterator.h>

#include <CGAL/Polygon_mesh_processing/repair.h>
#include <CGAL/Polygon_mesh_processing/internal/repair_extra.h>
#include <CGAL/Polygon_mesh_processing/corefinement.h>

// manifold-vertex
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;


void test_non_manifold_vertex()
{
        bool non_manifold_vertex_removed = false; //here non-manifold is for 
the 1D
polyline
        std::vector<halfedge_descriptor> boundary_hedges;
        BOOST_FOREACH(face_descriptor fh, cc_faces)
        {
                halfedge_descriptor h = halfedge(fh, tm);
                for (int i = 0; i < 3; ++i)
                {
                        if (is_border(opposite(h, tm), tm) ||
                                cc_faces.count(face(opposite(h, tm), tm)) == 
0)
                        {
                                boundary_hedges.push_back(h);
                        }
                        h = next(h, tm);
                }
        }
}



void test_non_manifold_edges()
{
      // make sure that the hole filling is valid, we check that no
      // edge already in the mesh is present in patch.
      bool non_manifold_edge_found = false;
      BOOST_FOREACH(const Face_indices& triangle, patch)
      {
        cpp11::array<int, 6> edges =
          make_array(triangle.first, triangle.second,
                     triangle.second, triangle.third,
                     triangle.third, triangle.first);
        for (int k=0; k<3; ++k)
        {
          int vi=edges[2*k], vj=edges[2*k+1];
          // ignore boundary edges
          if (vi+1==vj || (vj==0 &&
static_cast<std::size_t>(vi)==border_vertices.size()-1) )
            continue;
          halfedge_descriptor h = halfedge(border_vertices[vi],
border_vertices[vj], tm).first;
          if (h!=boost::graph_traits<TriangleMesh>::null_halfedge() &&
              cc_interior_edges.count(edge(h, tm))==0)
          {
            non_manifold_edge_found=true;
            break;
          }
        }
        if (non_manifold_edge_found) break;
      }
}



--
Sent from: http://cgal-discuss.949826.n4.nabble.com/