CGAL users discussion list

[Mariette Yvinec <>]

((*curr).first)->vertex_handle(((*curr).second + 1) % 4)
((*curr).first)->vertex_handle(((*curr).second + 2) % 4)
((*curr).first)->vertex_handle(((*curr).second + 3) % 4)

((*curr)) is a facet, e.g. std::pair<Cell_handle, int>
typedef std::pair<Cell_handle, int>
    Facet;     (c,i) is the facet of c opposite to the vertex of index i. (See Section 32.1.)
see cgal_manual, page
http://www.cgal.org/Manual/3.4/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html#Cross_link_anchor_1208



Query Cgal wrote:

Hello.

I have a 3D triangulation named Dt. And I have tried the following

Triangle t = Dt.triangle(*curr);   //where curr is a facet_iterator

t.vertex(0);                             //when I try this in the code, this line return a Point instead
                                            // of a vertex handle

Vertex_handle v1 = Dt.nearest_vertex(t.vertex(0));    // I can get the vertex handle in this
                                                                           //way.

If I used the last line of the code o get the vertex handle of the triangle, the program runs very slowly.

May I know if there is any other  ways to get the vertex handle instead of using the nearest_vertex() function?

Thank you

---

Yahoo!香港提供網上安全攻略，教你如何防範黑客!了解更多

-- 
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis