CGAL users discussion list

[khurshid juraev <>]

Hi, Julien.

I tried writing an example which simulates the solution I suggested:

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

#include <CGAL/Triangulation_2.h>

#include <iostream>

#include <vector>

#include <set>

typedef CGAL::Exact_predicates_exact_constructions_kernel K;

typedef CGAL::Triangulation_2<K>      Triangulation;

typedef Triangulation::Vertex_handle  Vertex_handle;

typedef Triangulation::Point          Point;

typedef Triangulation::Finite_vertex_handles    Finite_vertex_handles;

typedef Triangulation::Finite_vertices_iterator Finite_vertices_iterator;

typedef Finite_vertex_handles::iterator         Finite_vertex_handles_iterator;

int main()

{

  

  std::vector<Point> points =  { Point(0,0), Point(1,0), Point(0,1) };

  Triangulation T;

  std::set<Vertex_handle> vertices;

  //or std::vector

  //std::vector<Vertex_handle> vertices;

  T.insert(points.begin(), points.end());

  std::cout << "Triangulation_2::Finite_vertices_iterator is like a  Triangulation_2::Vertex_handle\n";  

  

  vertices.insert(T.finite_vertices_begin(), T.finite_vertices_end());

  //or if std::vector

  //vertices.insert(vertices.begin(), T.finite_vertices_begin(), T.finite_vertices_end());

  

  //moving part

  for(Vertex_handle& vh : vertices){

// New position

double New_x = vh.point().x()+2.3;

double New_y = vh.point().y()+2.3;

Point New_point = Point(New_x, New_y);

T.move_point(vh, New_point);

  }

  

  return 0;

}

Regards, Khurshid.