Skip to Content.
Sympa Menu

cgal-discuss - I/O 3d triangulations - was Re: [cgal-discuss] Supporting the new type of for loop

Subject: CGAL users discussion list

List archive

I/O 3d triangulations - was Re: [cgal-discuss] Supporting the new type of for loop


Chronological Thread 
  • From: Monique Teillaud <>
  • To:
  • Subject: I/O 3d triangulations - was Re: [cgal-discuss] Supporting the new type of for loop
  • Date: Wed, 24 Apr 2013 14:14:16 +0200

Please adapt the title of the email to its contents, don't reuse a thread that is discussing something else.

This is combinatorial information.
===
The information stored in the iostream is:
the dimension, the number of vertices, the number of cells,
the indices of the vertices of each cell,
then the indices of the neighbors of each cell, where the index corresponds to the preceding list of cells.
===
copy-pasted from
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html#Cross_link_anchor_1396

Le 24/04/13 13:53, 乞丐开宝马 a écrit :

in 3D delaunay triangulation i have some doubt regarding its output file.

3--------------------------- / the dimension
6--------------------------the number of finite vertices
1 0 0-------------------------------
0 0 0
0 1 0
1 1 1 the non combinatorial information on vertices (poin
2 2 2
0 0 1----------------------------
12 -----------------------------the number of cells
0 2 3 6--------------------------from here onwards
2 1 3 4 i am not getting anything
2 3 1 0 if anybody explain with example it
would be very helpful, what is this ????
1 0 3 5
1 5 3 4
6 2 3 4
5 6 3 4
1 6 5 4
1 2 6 4
1 2 0 6
1 0 5 6
5 0 3 6
5 11 9 2
4 5 8 2
3 9 0 1
11 4 10 2
6 1 7 3
1 6 8 0
5 4 7 11
6 4 8 10
5 7 1 9
0 10 8 2
11 7 9 3
0 6 10 3
I new guy in CGAL plz help me out.
Thanks in advance.


------------------ Original ------------------
*From:* "Laurent Rineau (CGAL/GeometryFac";
*Date:* 2013年4月24日(星期三) 下午5:04
*To:* "cgal-discuss";
*Subject:* Re: Re: [cgal-discuss] Supporting the new type of for loop

Le mercredi 24 avril 2013 16:26:39 杨成林 a écrit :
> Maybe let dt.finite_vertices() and dt.finite_vertex_handles() both
> available.

I agree. That would be the most useful. We'll talk about that at the
next CGAL
developers meeting (end of May 2013).

--
Laurent Rineau, PhD
R&D Engineer at GeometryFactory http://www.geometryfactory.com/
<http://www.geometryfactory.com/>
Release Manager of the CGAL Project http://www.cgal.org/
<http://www.cgal.org/>


--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss
<https://sympa.inria.fr/sympa/info/cgal-discuss>




--
Monique Teillaud
http://www.inria.fr/sophia/members/Monique.Teillaud/
INRIA Sophia Antipolis - Méditerranée
Institut National de Recherche en Informatique et Automatique



Archive powered by MHonArc 2.6.18.

Top of Page