CGAL users discussion list

[Cai Zhenning <>]

Hi,

I'm new to CGAL and now I'm using Triangulation_2 to generate a
triangulation.

I wonder that if there is an efficient way to access to the points
before I insert them into triangulation. For example, if I write

Triangulation_2 t;
std::vector<Point_2> p;
// ...
t.insert(p.begin(), p.end());

How can I get the vertex in t that holds p.front()? I know t.locate will
do that, but I think it is an inefficient way if I want to locate all
points in p.

Thank you for your help.