CGAL users discussion list

[sergio campo <>]

Ok thanks!

On Fri, Jun 22, 2018 at 11:55 AM, Shankar Kulumani <> wrote:

I think there's a circulator around the halfedges of each face. Then given a halfedge you can find the opposite face, by calling the opposite/inverse function, then store this face pointer ( since your dealing with the polyhedron mesh)

I'm not on my computer but can find the exact functions once I look at the docs again.

On Fri, Jun 22, 2018, 04:49 sergio <> wrote:

I have the following loop iterator:

void printAdjancenFaceToEdge(Polyhedron mesh)
{
    std::vector<int> nBorder(mesh.size_of_vertices(), 0);
    for (Polyhedron::Halfedge_const_iterator he = mesh.halfedges_begin(); he
!= mesh.halfedges_end(); he++) {
        if (!he->is_border())
            continue;

        // print here ids   
    }


    return true;
}
is it possible to print the adjacent faces index of every edge?



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

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss