mirror of https://github.com/CGAL/cgal
Fix typo around colon: no space before (thus no breakable space either)
This commit is contained in:
Laurent Rineau
parent
494a65d4a3
commit
e16ef7cf46
|
|
@ -55,7 +55,7 @@ and edges.
|
|||
|
||||
|
||||
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx \\
|
||||
Remarks : \\
|
||||
Remarks: \\
|
||||
1) we should define a concept of 3D triangulation. \\
|
||||
|
||||
2) I don't see anymore \ccc{Triangulation}
|
||||
|
|
|
|||
|
|
@ -22,7 +22,7 @@ The concept \ccRefName\ describes a data structure
|
|||
designed to represent a two dimensional pure complex
|
||||
embedded in a three dimensional triangulation.
|
||||
|
||||
A {\em complex} is a set $C$ of faces such that~:\\
|
||||
A {\em complex} is a set $C$ of faces such that:\\
|
||||
- any subface of a face in $C$ is a face of $C$ \\
|
||||
- two faces of $C$ are disjoint or share a common subface \\
|
||||
The complex is {\em two dimensional}, if its faces have dimension at most
|
||||
|
|
|
|||
|
|
@ -37,7 +37,7 @@ in the global function \ccc{make_surface_mesh<C2T3,Oracle,Criteria,Tag>}.
|
|||
|
||||
\ccc{PureComplex_2InTriangulation_3}
|
||||
|
||||
WARNING :
|
||||
WARNING:
|
||||
Currently the class \ccRefName\ does not implement the
|
||||
whole concept \ccc{PureComplex_2InTriangulation_3}
|
||||
but just what is needed to be used as the first parameter
|
||||
|
|
|
|||
|
|
@ -108,7 +108,7 @@ meshing algorithm, see Section~\ref{SurfaceMesher_section_variations}
|
|||
A call to
|
||||
\ccc{surface_mesher(c2t3,surf,criteria) } launches
|
||||
the meshing process with an initial
|
||||
set of points which is the union of two subsets :
|
||||
set of points which is the union of two subsets:
|
||||
the set of vertices in the initial triangulation pointed to by \ccc{c2t3},
|
||||
and a set of points provided by the \ccc{initial_points()} method
|
||||
of the oracle \ccc{surf}. This initial set of points is required
|
||||
|
|
@ -128,7 +128,7 @@ takes three numerical values \ccc{(x,y,z)} of type \ccc{FT}
|
|||
and returns a value of type \ccc{FT} which is the function $f(x,y,z)$.
|
||||
|
||||
The default meshing criteria are are determined by three numerical
|
||||
values~: \\
|
||||
values: \\
|
||||
\ccc{angular_bound} is a lower bound in degrees for the angles
|
||||
of mesh facets.\\
|
||||
\ccc{radius_bound} is an upper bound on the radii of surface Delaunay
|
||||
|
|
@ -181,12 +181,12 @@ with the size of the mesh expected by the user,
|
|||
and still have a guarantee that
|
||||
the output mesh forms a manifold surface.
|
||||
The function \ccc{make_surface_mesh} has specialized versions
|
||||
for the following tag types~: \\
|
||||
\ccc{Manifold_tag} : the output mesh is guaranteed to be a manifold
|
||||
for the following tag types: \\
|
||||
\ccc{Manifold_tag}: the output mesh is guaranteed to be a manifold
|
||||
surface without boundary.\\
|
||||
\ccc{Manifold_with_boundary_tag}~:the output mesh is guaranteed to be
|
||||
\ccc{Manifold_with_boundary_tag}:the output mesh is guaranteed to be
|
||||
manifold but may have boundaries.\\
|
||||
\ccc{Non_manifold_tag} : the algorithm relies on the given criteria and
|
||||
\ccc{Non_manifold_tag}: the algorithm relies on the given criteria and
|
||||
guarantees nothing else.
|
||||
|
||||
\section{Implementation}
|
||||
|
|
|
|||
|
|
@ -24,7 +24,7 @@ set of a function \begin{math}f : \R^3 \longrightarrow \R\end{math}.
|
|||
|
||||
|
||||
The library provides a partial specialization
|
||||
of the surface mesher traits generator~:
|
||||
of the surface mesher traits generator:
|
||||
\ccc{Surface_mesh_traits_generator_3<Implicit_surface_3<Traits, Function> >}
|
||||
that provides a model of \ccc{SurfaceMeshTraits_3} for this type of surfaces.
|
||||
|
||||
|
|
@ -33,7 +33,7 @@ The parameter \ccc{Traits} is a traits class
|
|||
that has to be implemented with a model of
|
||||
\ccc{ImplicitSurfaceTraits_3}.
|
||||
Actually, this traits class implements the oracle needed by the
|
||||
surface mesher~:
|
||||
surface mesher:
|
||||
the types, predicates and constructors objects provided
|
||||
in \ccc{Traits} are
|
||||
used in
|
||||
|
|
|
|||
|
|
@ -22,7 +22,7 @@ The concept \ccRefName\ describes a data structure
|
|||
designed to represent a two dimensional pure complex
|
||||
embedded in a three dimensional triangulation.
|
||||
|
||||
A {\em complex} is a set $C$ of faces such that~:\\
|
||||
A {\em complex} is a set $C$ of faces such that:\\
|
||||
- any subface of a face in $C$ is a face of $C$ \\
|
||||
- two faces of $C$ are disjoint or share a common subface \\
|
||||
The complex is {\em two dimensional}, if its faces have dimension at most
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@
|
|||
|
||||
The class \ccRefName\ implements the most commonly used combination
|
||||
of meshing criteria. It involves mainly three criteria which are
|
||||
in order~: \\
|
||||
in order: \\
|
||||
- a lower bound on the minimum angle of the surface mesh facets. \\
|
||||
- an upper bound on the radius of surface Delaunay balls.
|
||||
A surface Delaunay ball is a ball circumscribing a facet,
|
||||
|
|
|
|||
|
|
@ -25,7 +25,7 @@ that is a function to build a two dimensional mesh
|
|||
approximating a surface.
|
||||
|
||||
The library provides two overloaded version
|
||||
of this function~:
|
||||
of this function:
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue