From c4ccf7c7ed87186e47c04e0235e1841f7e6455a2 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <Andreas.Fabri@geometryfactory.com>
Date: Wed, 5 Apr 2006 20:39:29 +0000
Subject: [PATCH] Added package descriptions

---
 .../doc_tex/TDS_2/PkgDescription.tex          | 15 ++++++++++
 .../Triangulation_2/PkgDescription.tex        | 28 +++++++++++++++++++
 2 files changed, 43 insertions(+)
 create mode 100644 Triangulation_2/doc_tex/TDS_2/PkgDescription.tex
 create mode 100644 Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex

diff --git a/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex b/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex
new file mode 100644
index 00000000000..6806d9ba2bf
--- /dev/null
+++ b/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex
@@ -0,0 +1,15 @@
+
+\begin{ccPkgDescription}{2D Triangulation Data Structure}
+\ccPkgSummary{
+This package provides a data structure to store a two-dimensional
+triangulation that has the  topology of a two-dimensional sphere. 
+The package
+acts as a container for the vertices and faces of the triangulation 
+and provides basic  combinatorial operation on the triangulation.
+}
+
+%\ccPkgDependsOn{}
+\ccPkgMaturity{Introduced in \cgal\ 3.0}
+\ccPkgLicense{\qpl}
+
+\end{ccPkgDescription}
diff --git a/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex b/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex
new file mode 100644
index 00000000000..cdd0425ca99
--- /dev/null
+++ b/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex
@@ -0,0 +1,28 @@
+
+\begin{ccPkgDescription}{2D Triangulation}
+\ccPkgSummary{This package  allows to build and handle
+various triangulations for point sets two dimensions.
+Any CGAL triangulation covers the convex hull of its
+vertices. Triangulations are build incrementally 
+and can be modified by insertion  or removal  of vertices. 
+They offer point location facilities.
+
+The package provides plain triangulation (whose faces
+depend on the insertion order of the vertices) and
+Delaunay triangulations.  Regular triangulations are
+also provided for sets of weighted points. Delaunay and regular
+triangulations offer nearest neighbor queries
+and primitives to build the dual Voronoi and power diagrams. 
+
+Finally, constrained and Delaunay contrained triangulations
+allows to force some constrained segments to appear
+as edges of the triangulation. 
+Several versions of constrained and Delaunay contrained triangulations
+are provided: some of them handle intersections between input constraints
+segment while others do not. }
+
+%\ccPkgDependsOn{}
+\ccPkgMaturity{Introduced in \cgal\ 3.0}
+\ccPkgLicense{\qpl}
+
+\end{ccPkgDescription}