From a90dd8e34b9f1eb82922482cddea234651b5a062 Mon Sep 17 00:00:00 2001 From: Monique Teillaud Date: Wed, 8 Sep 1999 09:34:02 +0000 Subject: [PATCH] *** empty log message *** --- Packages/Triangulation_3/changes.txt | 6 ++++++ .../doc_tex/Triangulation_3/Triangulation3.tex | 6 +++--- .../doc_tex/basic/Triangulation_3/Triangulation3.tex | 6 +++--- Packages/Triangulation_3/version | 2 +- 4 files changed, 13 insertions(+), 7 deletions(-) diff --git a/Packages/Triangulation_3/changes.txt b/Packages/Triangulation_3/changes.txt index 2c3eb39dd58..2301d34451c 100644 --- a/Packages/Triangulation_3/changes.txt +++ b/Packages/Triangulation_3/changes.txt @@ -1,3 +1,9 @@ +Version 1.8 (8 sept 99) +minor fixes (std::, typenames, etc) + +Version 1.7 (1st sept 99) +changes in Dagstuhl for MSVC++ + Version 1.6 (25 august 99) minor changes to run with g++ 2.95 diff --git a/Packages/Triangulation_3/doc_tex/Triangulation_3/Triangulation3.tex b/Packages/Triangulation_3/doc_tex/Triangulation_3/Triangulation3.tex index c947ddea6fe..602f3478839 100644 --- a/Packages/Triangulation_3/doc_tex/Triangulation_3/Triangulation3.tex +++ b/Packages/Triangulation_3/doc_tex/Triangulation_3/Triangulation3.tex @@ -31,9 +31,9 @@ cells ($3$-faces) are such that two cells either do not intersect or share a common facet ($2$-face), edge ($1$-face) or vertex ($0$-face). The basic 3D-triangulation class of \cgal\ is primarily designed to -represent the triangulations of a set of points ${\cal A}$ in $\R^3$. -It can be viewed as a partition of the convex hull of ${\cal A}$ -with tetrahedra whose vertices are the points of ${\cal A}$. Together +represent the triangulations of a set of points \ccTexHtml{${\cal A}$}{$A$} in $\R^3$. +It can be viewed as a partition of the convex hull of \ccTexHtml{${\cal A}$}{$A$} +with tetrahedra whose vertices are the points of \ccTexHtml{${\cal A}$}{$A$}. Together with the unbounded cell having the convex hull boundary as frontier, the triangulation forms a partition of $\R^3$. diff --git a/Packages/Triangulation_3/doc_tex/basic/Triangulation_3/Triangulation3.tex b/Packages/Triangulation_3/doc_tex/basic/Triangulation_3/Triangulation3.tex index c947ddea6fe..602f3478839 100644 --- a/Packages/Triangulation_3/doc_tex/basic/Triangulation_3/Triangulation3.tex +++ b/Packages/Triangulation_3/doc_tex/basic/Triangulation_3/Triangulation3.tex @@ -31,9 +31,9 @@ cells ($3$-faces) are such that two cells either do not intersect or share a common facet ($2$-face), edge ($1$-face) or vertex ($0$-face). The basic 3D-triangulation class of \cgal\ is primarily designed to -represent the triangulations of a set of points ${\cal A}$ in $\R^3$. -It can be viewed as a partition of the convex hull of ${\cal A}$ -with tetrahedra whose vertices are the points of ${\cal A}$. Together +represent the triangulations of a set of points \ccTexHtml{${\cal A}$}{$A$} in $\R^3$. +It can be viewed as a partition of the convex hull of \ccTexHtml{${\cal A}$}{$A$} +with tetrahedra whose vertices are the points of \ccTexHtml{${\cal A}$}{$A$}. Together with the unbounded cell having the convex hull boundary as frontier, the triangulation forms a partition of $\R^3$. diff --git a/Packages/Triangulation_3/version b/Packages/Triangulation_3/version index 866e0ad79f3..df4d066c87f 100644 --- a/Packages/Triangulation_3/version +++ b/Packages/Triangulation_3/version @@ -1 +1 @@ -1.6 (25 Aug 1999) +1.8 ( 8 Sep 1999)