CGAL users discussion list

[Flaminigo <>]

Well, there is face traversing iterator defined in VD. You can traverse each face one by one. In each face, there is a vertex iterator. So you can traverse vertices of a specified face one by one. Please refer to http://www.cgal.org/Manual/last/doc_html/cgal_manual/Voronoi_diagram_2_ref/Class_Voronoi_diagram_2.html#Cross_link_anchor_1343 .

Regards

Flaminigo

On Tue, Oct 27, 2009 at 7:21 PM, Marcos R. P. <> wrote:

Thanks, Mr. Flaminigo!

 

Do you know how could I get all vertices of all faces individually?

 

Marcos.

---

De: Flaminigo <>

Para:

Enviadas: Seg, Outubro 26, 2009 10:27:33 PM

Assunto: Re: [cgal-discuss] vd.file_output

It output is the dual graph of VD. The dual graph is a Delaunary Triangulation. So output are full of triples. ...

On Tue, Oct 27, 2009 at 8:52 AM, 顺子 <> wrote:

在2009-10-25，"Marcos R. P." <> 写道：

Hi!

 

Please, what means this output that one obtains with vd.file_output:

8 12 2
0 0
100 0
100 100
0 100
200 0
300 0
350 0

7 0 3
1 2 3
0 1 4
4 1 3
2 1 0
0 4 3
2 5 3
2 0 5
5 6 3
5 0 6
6 7 3
6 0 7

5 10 11
6 3 4
3 5 4
1 5 2
2 7 1
3 0 2
8 1 7
9 6 4
10 6 9
11 8 7
0 8 11
0 10 9
Thanks!

---

Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes

---

看陆川杨幂新片《琴棋书画》，品网易3D国韵网游《天下贰》

---

Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes