CGAL users discussion list

[<>]

Hi,

I'm very new to CGAL and have been trying to get it to work for quite some 
time
now. I am trying to implement the Marching Triangle Algorithm and using CGAL
for that.

The first requirement there is that I need to iterate through all the edges
that lie on the boundary of a model. I can't get it to work properly..

This is what I am using:
typedef CGAL::Simple_cartesian<double> Kernel;

typedef CGAL::Polyhedron_3<Kernel> Polyhedron;

typedef Polyhedron::Halfedge_handle Halfedge_handle;
typedef Polyhedron::Vertex_iterator        Vertex_iterator;
typedef Polyhedron::Halfedge_iterator      Halfedge_iterator;
typedef Polyhedron::Edge_iterator          Edge_iterator;

// main() and making a simple polyhedron out of a triangle.
P.make_triangle(p,q,r);
std::cout << "H Edge info:" << std::endl;
for ( Halfedge_iterator hit = P.vertices_begin(); hit != P.vertices_end(); 
++v)
        std::cout << hit->vertex()->point() << std::endl;

This gives me the following error and I can't understand why is it giving that
error:

error C2440: 'initializing' : cannot convert from
'CGAL::CGALi::In_place_list_iterator<T,Alloc>' to
'CGAL::CGALi::In_place_list_iterator<T,Alloc>'

Can someone please tell me what is it that I am doing wrong and how can I fix
it?

I'd really appreciate any help.

Thank you
/Priyank