songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

*** empty log message ***

This commit is contained in:
Monique Teillaud 1999-09-08 09:34:02 +00:00
parent e8b0aad511
commit a90dd8e34b
4 changed files with 13 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Packages/Triangulation_3/changes.txt
View File

@ -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

6
Packages/Triangulation_3/doc_tex/Triangulation_3/Triangulation3.tex
View File

@ -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$.

6
Packages/Triangulation_3/doc_tex/basic/Triangulation_3/Triangulation3.tex
View File

@ -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$.

2
Packages/Triangulation_3/version
View File

@ -1 +1 @@
1.6 (25 Aug 1999)
1.8 ( 8 Sep 1999)