CGAL users discussion list

[Maxime Gimeno <>]

You can have a look at that example : https://doc.cgal.org/latest/Triangulation_2/Triangulation_2_2info_insert_with_pair_iterator_2_8cpp-example.html

The principle is to use a Vertex_with_index and add the ids yourself while creating the triangulation.You can then access the ID with `Vertex_handle::info()`

Le ven. 19 mars 2021 à 23:46, Bruno Rammon <> a écrit :

I would like to know if it exists some kind of global numeration of the
vertices of a Constrained_Delaunay_triangulation_2. That is, I am wondering
if each vertex of a /created/ triangulation of that type that has a unique
index associated to it. If it does not exist, is there any kind of c++ data
structure that might uniquely distinguish each vertex? For example, a
pointer to an vertex object or something like that, so that I can create a
std::unordered_map<data_structure,int> which associate this data structure
to an unique index.

Best regards,
Bruno




--
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