Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Help getting Delaunay Triangulation

Subject: CGAL users discussion list

List archive

[cgal-discuss] Help getting Delaunay Triangulation


Chronological Thread 
  • From: <>
  • To:
  • Subject: [cgal-discuss] Help getting Delaunay Triangulation
  • Date: Fri, 15 Jan 2010 00:27:39 +0100 (CET)

Hello,

I'm trying to use CGAL for some Delaunay triangulation. I am able to add my
points to the triangulator, but I am having trouble understanding how to get
information on the resulting triangles.

It looks like I can perform the following loop to get information about the
faces:

std::vector<Point> pts;

//.... fill the pts vector

Delaunay dt;
dt.insert(pts.begin(), pts.end());

Delaunay::Finite_faces_iterator it
for (it = dt.finite_faces_begin(); it != dt.finite_faces_end(); it++)
{
Point p1 = it->vertex(0)->point();
Point p2 = it->vertex(1)->point();
}

But what I am hoping to get is the index of the index of the point within the
original vector. Is there a way to do that?

Thanks,

Adam



Archive powered by MHonArc 2.6.16.

Top of Page