CGAL users discussion list

[Manuel Caroli <>]

 wrote:
> Hmm. When the insertion has no order how can i ensure i keep my input order of
> my points?
You can use the second possibility Andreas gave you yesterday:
  Vertex_handle vh = dt.insert(points[i]);
  vh->info() = i;
But it might run a bit slower. In fact there is an optimization hidden 
in the method insert(InputIterator, InputIterator) that scrambles the order.

> If i want read out the vertices or faces of the finished triangulation is this
> in a non-changing order?
I'm not sure what you mean. But the same output iterator should always 
give the same order if you don't change the triangulation in between. 
However it need not be the insertion order.
> Because if the input is random and the output how can i ensure reliability?
I am not sure whether I understand your question. Don't you attach the 
indices to vertices? So how does the order matter?
> coord.push_back(Point(x,y,z));
> //How do i assign an index to the point which is put in the "coord" list?
see above.
> at the moment i do that after the triangulation because i thought it was in
> order.
> // Loop through faces of triangulation and assign index to vertices
> int q = 0;
> for (Finite_vertices_iterator fvi = Delaunay.finite_vertices_begin();
>                                         fvi !=
> Delaunay.finite_vertices_end();++fvi){
>                 fvi->info()= q++;
> }