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

commented reference to still undocumented concepts

This commit is contained in:
Andreas Fabri 2007-03-29 11:31:15 +00:00
parent 7a7848ae5d
commit cd121533b0
1 changed files with 11 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
Surface_mesher/doc_tex/Surface_mesher_ref/SurfaceMeshComplex_2InTriangulation_3.tex
View File

@ -44,15 +44,16 @@ A model of this concept is a type to be plugged as first template
parameter in the
function template \ccc{make_surface_mesh}.
The concept \ccRefName\ is a simplification of more general concepts called
respectively \ccc{PureComplex2InTriangulation3} and
\ccc{Complex2InTriangulation3}.
\ccc{PureComplex2InTriangulation3} is designed to represent a pure complex
and \ccc{Complex2InTriangulation3} is designed to represent any
two dimensional complex.
Both concepts include member functions to analyse the complex,
e.g. find its size, number of connected components, genus etc...
% Commented as these concepts are still missing
%
%The concept \ccRefName\ is a simplification of more general concepts called
% respectively \ccc{PureComplex2InTriangulation3} and
%\ccc{Complex2InTriangulation3}.
%\ccc{PureComplex2InTriangulation3} is designed to represent a pure complex
%and \ccc{Complex2InTriangulation3} is designed to represent any
%two dimensional complex.
%Both concepts include member functions to analyse the complex,
%e.g. find its size, number of connected components, genus etc...
%\ccGeneralizes
@ -98,7 +99,7 @@ The status of a vertex is determined by
the adjacency graph of the facets of the 2D complex
incident to that vertex.
The vertex of the 2D complex is \ccc{BOUNDARY}, if this adjacency graph
is a simple path, it is \ccc{REGULAR} if the adjacency graph is cyclic,
is a simple path, it is \ccc{REGULAR}, if the adjacency graph is cyclic,
and \ccc{SINGULAR}in any other case.
}