Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Triangulation with id insertion using range insert function?

Subject: CGAL users discussion list

List archive

[cgal-discuss] Triangulation with id insertion using range insert function?


Chronological Thread 
  • From: Samuel Gundry <>
  • To:
  • Subject: [cgal-discuss] Triangulation with id insertion using range insert function?
  • Date: Fri, 29 Oct 2010 13:43:47 +1100
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:from:date:message-id:subject:to:content-type; b=YYhopzMEHpxppKSRGdbNObQCbIEQN1/mb+o2vEIKXIIKOkfIZQXIerbfnIVbfiTQWh XetR/54rwmApusjxFNpvozpJrbUOjS3adfSzsTT1jHPcMwdzClWoORnESevi6AdSTDtQ xvoQ1Du1nWUhqyMdphLqcOlKnJ3tID7uFliME=

Hi,

Is there a way to insert points into a triangulation using the range
insert function while assigning ids to each point (using
Triangulation_vertex_base_with_id_2)? Am I able able to use my point
types?

Currently, I'm iterating through the points, inserting, and then
assigning an id.

typedef CGAL::Triangulation_euclidean_traits_xy_3<K> TriangulationTraits;
typedef CGAL::Triangulation_vertex_base_with_id_2<TriangulationTraits>
TriangulationVertexBase;
typedef CGAL::Triangulation_data_structure_2<TriangulationVertexBase>
TriangulationDataStructure;
typedef
CGAL::Delaunay_triangulation_2<TriangulationTraits,TriangulationDataStructure>
Trianglulation;

int id = 0;
vector< Point_3 > points;
// ... fill points
for (vector< Point >::const_iterator p = points.begin(); p !=
points.end(); ++p, ++id ) {
Trianglulation::Vertex_handle v = triangulation.push_back(*p);
v->id() = id;
}

But, I thought, using the range iterator is more efficient:

vector< Point_3 > points;
// ... fill points
triangulation.insert(points.begin(), points.end()); // How do I
assign an id to each vertex here?

Thanks,
Sam



Archive powered by MHonArc 2.6.16.

Top of Page