CGAL users discussion list

["Li Hongwei" <>]

Hi,

 

In triangulation_3, you may use

 

std::list<Triangulation_3::Vertex_handle> boundary_vertices;

t.incident_vertices(t.infinite_vertex(),std::back_inserter(boundary_vertices));

 

2D is similar while the signature of the incident_vertices() is a bit different.

 

lihw

 

-----Original Message-----
From: [mailto:]
Sent: Saturday, December 30, 2006 11:08 PM
To:
Subject: [cgal-discuss] triangulation boundary

 

Hi,

is there any way to find all vertices which are on the boundary of a triangulation?

---

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://lists-sop.inria.fr/wws/info/cgal-discuss