cgal/Triangulation_3/examples/Triangulation_3
Laurent Saboret ee07ad352c Move packages to trunk root 2006-02-14 08:58:20 +00:00
..
Makefile Move packages to trunk root 2006-02-14 08:58:20 +00:00
README Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_adding_handles.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_color.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_find_conflicts.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_hierarchy.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_linking_2d_and_3d.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_regular.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_simple.C Move packages to trunk root 2006-02-14 08:58:20 +00:00
example_tds.C Move packages to trunk root 2006-02-14 08:58:20 +00:00

README

------- example_simple ---------------------------------------

This example shows the incremental construction of a 3D triangulation, 
the location of a point, and how to manipulate elementary operations
on indices in a cell. It uses the default parameters proposed by
CGAL for the Triangulation_3 class.

--------------------------------------------------------------

------- example_color ----------------------------------------

This example shows how the user can plug his own vertex base in a
triangulation.

--------------------------------------------------------------

------- example_adding_handles -------------------------------

This example shows how the user can plug his own vertex base
in a triangulation, when he needs to add handles in it.

--------------------------------------------------------------

------- example_hierarchy ------------------------------------

This example shows the use of the hierarchy to speed up the 
construction of a Delaunay triangulation. 

--------------------------------------------------------------

------- example_tds ------------------------------------------

Shows how to construct a 3D triangulation data structure by 
inserting vertices.

--------------------------------------------------------------

------- example_find_conflicts -------------------------------

Illustrates how the insertion process of points in a Delaunay
triangulation can be decomposed in order to give access to the
cells in conflict (those which would be destroyed by the insertion
of a point) prior to deciding to do the actual insertion or not.

--------------------------------------------------------------

------- example_linking_2d_and_3d ----------------------------

Illustrates how to setup a 2D and a 3D triangulation data structure
whose vertices respectively store vertex handles of the other one.

--------------------------------------------------------------

------- example_regular --------------------------------------

Illustrates the use of Regular_triangulation_3.

--------------------------------------------------------------