CGAL users discussion list

[Andreas Fabri <>]

Hello,

Indices are needed if you want to associate information with the help of 
a std::vector,

but you can use vertex handles directly as key in a std::map or 
std::unordered_map

typedef CGAL::Constrained_Delaunay_triangulation_2<K>::Vertex_handle 
Vertex_handle;

std::map<Vertex_handle, double> vertex_temperature;

vertex_temparature[cdt.infinite_vertex()] = 
std::numeric_limits<double>::max();

best,

andreas


On 3/19/2021 11:46 PM, Bruno Rammon ( via 
cgal-discuss Mailing List) wrote:
> 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/
--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project