Remove useless separators (I just need a commit in the trunk/T3 :-).

This commit is contained in:
Sylvain Pion 2009-08-07 10:45:15 +00:00
parent 3b7f719178
commit decf630bee
1 changed files with 0 additions and 13 deletions

View File

@ -1,4 +1,3 @@
------- simple ----------------------------------------------- ------- simple -----------------------------------------------
This example shows the incremental construction of a 3D triangulation, This example shows the incremental construction of a 3D triangulation,
@ -6,35 +5,29 @@ the location of a point, and how to manipulate elementary operations
on indices in a cell. It uses the default parameters proposed by on indices in a cell. It uses the default parameters proposed by
CGAL for the Triangulation_3 class. CGAL for the Triangulation_3 class.
--------------------------------------------------------------
------- color ------------------------------------------------ ------- color ------------------------------------------------
This example shows how the user can plug his own vertex base in a This example shows how the user can plug his own vertex base in a
triangulation. triangulation.
--------------------------------------------------------------
------- adding_handles --------------------------------------- ------- adding_handles ---------------------------------------
This example shows how the user can plug his own vertex base This example shows how the user can plug his own vertex base
in a triangulation, when he needs to add handles in it. in a triangulation, when he needs to add handles in it.
--------------------------------------------------------------
------- hierarchy -------------------------------------------- ------- hierarchy --------------------------------------------
This example shows the use of the hierarchy to speed up the This example shows the use of the hierarchy to speed up the
construction of a Delaunay triangulation. construction of a Delaunay triangulation.
--------------------------------------------------------------
------- tds -------------------------------------------------- ------- tds --------------------------------------------------
Shows how to construct a 3D triangulation data structure by Shows how to construct a 3D triangulation data structure by
inserting vertices. inserting vertices.
--------------------------------------------------------------
------- find_conflicts --------------------------------------- ------- find_conflicts ---------------------------------------
@ -43,24 +36,18 @@ triangulation can be decomposed in order to give access to the
cells in conflict (those which would be destroyed by the insertion cells in conflict (those which would be destroyed by the insertion
of a point) prior to deciding to do the actual insertion or not. of a point) prior to deciding to do the actual insertion or not.
--------------------------------------------------------------
------- linking_2d_and_3d ------------------------------------ ------- linking_2d_and_3d ------------------------------------
Illustrates how to setup a 2D and a 3D triangulation data structure Illustrates how to setup a 2D and a 3D triangulation data structure
whose vertices respectively store vertex handles of the other one. whose vertices respectively store vertex handles of the other one.
--------------------------------------------------------------
------- regular ---------------------------------------------- ------- regular ----------------------------------------------
Illustrates the use of Regular_triangulation_3. Illustrates the use of Regular_triangulation_3.
--------------------------------------------------------------
------- simplex ---------------------------------------------- ------- simplex ----------------------------------------------
Illustrates the use of Triangulation_3::Simplex. Illustrates the use of Triangulation_3::Simplex.
--------------------------------------------------------------