Replace more sc text

Author: maxGimeno

Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt

@@ -267,7 +267,7 @@ compute the <i>least</i> common multiple of the denominators.
 
 The package is part of \cgal since release 3.3. Of course the package is based
 on the former Number type support of CGAL. This goes back to Stefan Schirra and Andreas Fabri. But on the other hand the package is to a large extend influenced
-by the experience with the number type support in <span class="textsc">Exacus</span> \cgalCite{beh-eeeafcs-05},
+by the experience with the number type support in \exacus \cgalCite{beh-eeeafcs-05},
 which in the main goes back to
 Lutz Kettner, Susan Hert, Arno Eigenwillig and Michael Hemmer.
 However, the package abstracts from the pure support for

Algebraic_kernel_d/doc/Algebraic_kernel_d/Algebraic_kernel_d.txt

@@ -310,7 +310,7 @@ that does not follow the generic programming paradigm, by avoiding
 interfaces between layers. Specifically, working with
 only one number type allows to optimize some polynomial operations
 as well as memory handling. The implementation of these kernels
-make heavy use of the <span class="textsc">Mpfr</span> \cgalCite{cgal:mt-mpfr} and <span class="textsc">Mpfi</span> \cgalCite{cgal:r-mpfi}
+make heavy use of the \mpfr \cgalCite{cgal:mt-mpfr} and \mpfi \cgalCite{cgal:r-mpfi}
 libraries, and of their \cgal interfaces, `Gmpfr` and `Gmpfi`.
 The algebraic numbers (roots of the polynomials) are represented
 in the two RS kernels by a `Gmpfi` interval and a pointer to
@@ -368,12 +368,12 @@ ideas that was brought to them throughout the last years. In particular,
 they want to thank Menelaos Karavelas and Elias Tsigaridas for their
 initial contributions.
 
-The two generic models where initially developed as part of the <span class="textsc">Exacus</span> \cgalCite{beh-eeeafcs-05} project.
+The two generic models where initially developed as part of the \exacus \cgalCite{beh-eeeafcs-05} project.
 However, the models are now fully integrated into the \cgal library,
-since also the relevant layers of <span class="textsc">Exacus</span> are now part of \cgal.
+since also the relevant layers of \exacus are now part of \cgal.
 The main authors for `Algebraic_kernel_d_1<Coeff>` and `Algebraic_kernel_d_2<Coeff>` are
 Michael Hemmer and Michael Kerber, respectively. Notwithstanding, the authors also want to emphasize the
-contribution of all authors of the <span class="textsc">Exacus</span> project,
+contribution of all authors of the \exacus project,
 particularly the contribution of Arno Eigenwillig, Sebastian Limbach and Pavel Emeliyanenko.
 
 The two univariate kernels that interface the library RS \cgalCite{cgal:r-rs} were

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt

@@ -662,9 +662,9 @@ functions can be used. The program works in three
 steps, as demonstrated in \cgalFigureRef{arr_figex_3}. Note that
 here we still stick to integer coordinates, but as we work on a
 larger scale we use an unbounded integer number-type (in this
-case, the `Gmpz` type taken from the <span class="textsc">Gmp</span> library)
+case, the `Gmpz` type taken from the \gmp library)
 instead of the built-in `int` type.\cgalFootnote{As a rule of thumb, one can use a bounded integer type for representing line segments whose coordinates are bounded by \f$ \lfloor\sqrt[3]{M}\rfloor\f$, where \f$ M\f$ is the maximal representable integer value. This guarantees that no overflows occur in the computations carried out by the traits class, hence all traits-class predicates always return correct results.}
-In case the <span class="textsc">Gmp</span> library is not installed (as indicated by
+In case the \gmp library is not installed (as indicated by
 the `CGAL_USE_GMP` flag defined in `CGAL/basic.h`), we
 use `MP_Float`, a number-type included in \cgal's support
 library that is capable of storing floating-point numbers with
@@ -2064,8 +2064,7 @@ rational numbers, and this ensures the robustness and correctness of
 any computation.\cgalFootnote{Many of the example programs in the rest
 of the chapter include a header file named `arr_rational_nt.h`, which
 defines a type named `Number_type` as either `Gmpq` or
-`Quotient<MP_Float>`, depending on whether <span
-class="textsc">Gmp</span> is installed or not.}
+`Quotient<MP_Float>`, depending on whether \gmp is installed or not.}
 
 An instance of the `Arr_segment_traits_2<Kernel>` class
 template can be very efficient for constructing arrangements induced
@@ -2480,7 +2479,7 @@ and extracting the real roots of a polynomial with integer
 coefficients. It is highly recommended to use the
 `CORE_algebraic_number_traits` class, which is included in the
 arrangement package. It relies on the exact number types
-implemented in the <span class="textsc">Core</span> library and performs exact
+implemented in the \core library and performs exact
 computations on the number types it defines.
 </UL>
 
@@ -3588,15 +3587,15 @@ and defines a simple textual input/output format.
 
 \section arr_secbgl Adapting to Boost Graphs
 
-<span class="textsc">Boost</span>\cgalFootnote{See also <span class="textsc">Boost</span>'s homepage at: <TT>www.boost.org</TT>.}
-is a collection of portable \cpp libraries that extend the Standard Template Library (<span class="textsc">Stl</span>). The <span class="textsc">Boost</span> Graph Library (<span class="textsc">bgl</span>), which one of the libraries in the collection, offers an
+\boost\cgalFootnote{See also \boost's homepage at: <TT>www.boost.org</TT>.}
+is a collection of portable \cpp libraries that extend the Standard Template Library (\stl). The \boost Graph Library (\bgl), which one of the libraries in the collection, offers an
 extensive set of generic graph algorithms parameterized through templates.
 As our arrangements are embedded as planar graphs, it is only
 natural to extend the underlying data structure with the interface that the
-<span class="textsc">bgl</span> expects, and gain the ability to perform the operations that the <span class="textsc">bgl</span> supports, such as shortest-path computation. This section describes how apply
-the graph algorithms implemented in the <span class="textsc">bgl</span> to `Arrangement_2` instances.
+\bgl expects, and gain the ability to perform the operations that the \bgl supports, such as shortest-path computation. This section describes how apply
+the graph algorithms implemented in the \bgl to `Arrangement_2` instances.
 
-An instance of `Arrangement_2` is adapted to a <span class="textsc">Boost</span> graph through the
+An instance of `Arrangement_2` is adapted to a \boost graph through the
 provision of a set of free functions that operate on the arrangement features
 and conform with the relevant BGL concepts. Besides the straightforward
 adaptation, which associates a vertex with each \dcel vertex and an edge
@@ -3607,7 +3606,7 @@ faces.
 
 \subsection arr_ssecbgl_primal The Primal Arrangement Representation
 
-Arrangement instances are adapted to <span class="textsc">Boost</span> graphs by specializing the
+Arrangement instances are adapted to \boost graphs by specializing the
 \link BGLArgtGT `boost:graph_traits` \endlink template for `Arrangement_2` instances. The
 graph-traits states the graph concepts that the arrangement class models
 (see below) and defines the types required by these concepts.
@@ -3620,11 +3619,11 @@ graph-edge type. As halfedges are directed, we consider the graph to be
 directed as well. Moreover, as several interior-disjoint \f$ x\f$-monotone curves
 (say circular arcs) may share two common endpoints, inducing an arrangement
 with two vertices that are connected with several edges, we allow parallel
-edges in our <span class="textsc">Boost</span> graph.
+edges in our \boost graph.
 
 Given an `Arrangement_2` instance, we can efficiently traverse its
 vertices and halfedges. Thus, the arrangement graph is a model of the concepts
-`VertexListGraph` and `EdgeListGraph` introduced by the <span class="textsc">bgl</span>.
+`VertexListGraph` and `EdgeListGraph` introduced by the \bgl.
 At the same time, we use an iterator adapter of the circulator over the
 halfedges incident to a vertex (`Halfedge_around_vertex_circulator` - see
 Section \ref arr_sssectr_vertex), so it is possible to go over the ingoing
@@ -3634,17 +3633,17 @@ is a model of the concept `BidirectionalGraph` (this concept refines
 
 It is important to notice that the vertex descriptors we use are
 `Vertex_handle` objects and <I>not</I> vertex indices. However, in order
-to gain more efficiency in most <span class="textsc">bgl</span> algorithm, it is better to have them
+to gain more efficiency in most \bgl algorithm, it is better to have them
 indexed \f$ 0, 1, \ldots, (n-1)\f$, where \f$ n\f$ is the number of vertices. We
 therefore introduce the `Arr_vertex_index_map<Arrangement>` class-template,
 which maintains a mapping of vertex handles to indices, as required by the
-<span class="textsc">bgl</span>. An instance of this class must be attached to a valid arrangement
+\bgl. An instance of this class must be attached to a valid arrangement
 vertex when it is created. It uses the notification mechanism (see
 Section \ref arr_secnotif) to automatically maintain the mapping of vertices
 to indices, even when new vertices are inserted into the arrangement or
 existing vertices are removed.
 
-In most algorithm provided by the <span class="textsc">bgl</span>, the output is given by
+In most algorithm provided by the \bgl, the output is given by
 <I>property maps</I>, such that each map entry corresponds to a vertex.
 For example, when we compute the shortest paths from a given source vertex
 \f$ s\f$ to all other vertices we can obtain a map of distances and a map of
@@ -3659,7 +3658,7 @@ allows for an efficient mapping of `Vertex_handle` objects to
 properties of type `Type`. Note however that unlike the
 `Arr_vertex_index_map` class, the vertex property-map class is not
 kept synchronized with the number of vertices in the arrangement, so it
-should not be reused in calls to <span class="textsc">bgl</span> functions in case the arrangement
+should not be reused in calls to \bgl functions in case the arrangement
 is modified in between these calls.
 
 \cgalFigureBegin{arr_figex_bgl,ex_bgl.png}
@@ -3668,7 +3667,7 @@ An arrangement of 7 line segments, as constructed by `bgl_primal_adapter.cpp` an
 
 In the following example we construct an arrangement of 7 line segments,
 as shown in \cgalFigureRef{arr_figex_bgl},
-then use Dijkstra's shortest-paths algorithm from the <span class="textsc">bgl</span> to compute
+then use Dijkstra's shortest-paths algorithm from the \bgl to compute
 the graph distance of all vertices from the leftmost vertex in the
 arrangement \f$ v_0\f$. Note the usage of the `boost::vector_property_map<Type, IndexMap>` and
 the `Arr_vertex_property_map` classes. The latter one, instantiated by
@@ -3692,7 +3691,7 @@ graph-edge type. We treat the graph edges as directed, such that a halfedge
 `e` is directed from \f$ f_1\f$, which is its incident face, to \f$ f_2\f$, which
 is the incident face of its twin halfedge. As two arrangement faces may
 share more than a single edge on their boundary, we allow parallel
-edges in our <span class="textsc">Boost</span> graph. As is the case in the primal graph, the dual
+edges in our \boost graph. As is the case in the primal graph, the dual
 arrangement graph is also a model of the concepts `VertexListGraph`,
 `EdgeListGraph` and `BidirectionalGraph` (thus also of
 `IncidenceGraph`).
@@ -3740,7 +3739,7 @@ exhibits slightly better performance than the default one
 (`Arr_segment_traits_2`
 even when the segments intersect each other, due to the small overhead
 of the latter (optimized) traits class. (For example, when the so
-called <span class="textsc">Leda</span> rational kernel is used).
+called \leda rational kernel is used).
 
 <LI>Prior knowledge of the combinatorial structure of the arrangement can
 be used to accelerate operations that insert \f$ x\f$-monotone curves,

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_Bezier_curve_traits_2.h

@@ -43,7 +43,7 @@ geometric kernels templated with the `NtTraits::Rational` and
 instantiate the `CORE_algebraic_number_traits` class as the `NtTraits`
 parameter, with `Cartesian<NtTraits::Rational>` and
 `Cartesian<NtTraits::Algebraic>` instantiating the two kernel types,
-respectively. The number types in this case are provided by the <span class="textsc">Core</span>
+respectively. The number types in this case are provided by the \core
 library, with its ability to exactly represent simple algebraic numbers.
 
 While `Arr_Bezier_curve_traits_2` models the concept

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h

@@ -61,7 +61,7 @@ It is recommended to instantiate the `CORE_algebraic_number_traits`
 class as the `NtTraits` parameter, with
 `Cartesian<NtTraits::Rational>` and `Cartesian<NtTraits::Algebraic>`
 instantiating the two kernel types, respectively.
-The number types in this case are provided by the <span class="textsc">Core</span> library, with its
+The number types in this case are provided by the \core library, with its
 ability to exactly represent simple algebraic numbers.
 
 The traits class inherits its point type from `AlgKernel::Point_2`,

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel_base.h

@@ -7,11 +7,11 @@ namespace CGAL {
 \anchor arr_refarr_dcel_base
 
 The `Arr_dcel_base` class is an important ingredient in the
-definition of <span class="textsc">Dcel</span> data structures. It serves as a basis class for
+definition of \dcel data structures. It serves as a basis class for
 any instance of the `Dcel` template parameter of the
 `Arrangement_2` template. In particular it is the basis class of
 the default `Dcel` template parameter, and the basis class of any
-extended <span class="textsc">Dcel</span>. The template parameters `V`, `H`, and `F`
+extended \dcel. The template parameters `V`, `H`, and `F`
 must be instantiated with models of the concepts
 `ArrangementDcelVertex`, `ArrangementDcelHalfedge`,
 and `ArrangementDcelFace` respectively.
@@ -26,7 +26,7 @@ class Arr_dcel_base {
 
 /*!
 
-The basic <span class="textsc">Dcel</span> face type. Serves as a basis class for an extended
+The basic \dcel face type. Serves as a basis class for an extended
 face record with auxiliary data fields.
 
 \cgalModels `ArrangementDcelFace`
@@ -39,7 +39,7 @@ class Arr_face_base {
 /*!
 
 
-The basic <span class="textsc">Dcel</span> halfedge type. Serves as a basis class for an
+The basic \dcel halfedge type. Serves as a basis class for an
 extended halfedge record with auxiliary data fields. The `Curve`
 parameter is the type of \f$ x\f$-monotone curves associated with the vertices.
 
@@ -54,7 +54,7 @@ class Arr_halfedge_base {
 /*!
 
 
-The basic <span class="textsc">Dcel</span> vertex type. Serves as a basis class for an extended
+The basic \dcel vertex type. Serves as a basis class for an extended
 vertex record with auxiliary data fields. The `Point` parameter is
 the type of points associated with the vertices.
 

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h

@@ -4,12 +4,12 @@ namespace CGAL {
 /*!
 \ingroup PkgArrangementOnSurface2DCEL
 
-The default <span class="textsc">Dcel</span> class used by the `Arrangement_2` class-template
+The default \dcel class used by the `Arrangement_2` class-template
 is parameterized by a traits class, which is a model of the
 `ArrangementBasicTraits_2` concept. It simply uses the nested
 `Traits::Point_2` and `Traits::X_monotone_curve_2` to instantiate
 the base vertex and halfedge types, respectively. Thus, the default
-<span class="textsc">Dcel</span> records store no other information, except for the topological
+\dcel records store no other information, except for the topological
 incidence relations and the geometric data attached to vertices and edges.
 
 \cgalModels `ArrangementDcelWithRebind`

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_overlay_traits.h

@@ -6,8 +6,8 @@ namespace CGAL {
 \ingroup PkgArrangementOnSurface2Overlay
 
 An instance of `Arr_default_overlay_traits` should be used for overlaying two arrangements
-of type `Arrangement` that store no auxiliary data with their <span class="textsc">Dcel</span> records, where the resulting overlaid arrangement stores no auxiliary
-<span class="textsc">Dcel</span> data as well. This class simply gives empty implementation for all
+of type `Arrangement` that store no auxiliary data with their \dcel records, where the resulting overlaid arrangement stores no auxiliary
+\dcel data as well. This class simply gives empty implementation for all
 traits-class functions.
 
 \cgalModels `OverlayTraits`
@@ -30,10 +30,10 @@ namespace CGAL {
 
 An instance of `Arr_face_overlay_traits` should be used for overlaying two arrangements
 of types `Arr_A` and `Arr_B`, which are instantiated using the same
-geometric traits-class and with the <span class="textsc">Dcel</span> classes `Dcel_A` and
+geometric traits-class and with the \dcel classes `Dcel_A` and
 `Dcel_B` respectively, in order to store their overlay in an arrangement
-of type `Arr_R`, which is instantiated using a third <span class="textsc">Dcel</span> class
-`Dcel_R`. All three <span class="textsc">Dcel</span> classes are assumed to be instantiations of the
+of type `Arr_R`, which is instantiated using a third \dcel class
+`Dcel_R`. All three \dcel classes are assumed to be instantiations of the
 `Arr_face_extended_dcel` template with types `FaceData_A`,
 `FaceData_B` and `FaceData_R`, respectively.
 

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_extended_dcel.h

@@ -4,11 +4,11 @@ namespace CGAL {
 /*!
 \ingroup PkgArrangementOnSurface2DCEL
 
-The `Arr_extended_dcel` class-template extends the topological-features of the <span class="textsc">Dcel</span>
+The `Arr_extended_dcel` class-template extends the topological-features of the \dcel
 namely the vertex, halfedge, and face types. While it is possible to maintain
 extra (non-geometric) data with the curves or points of the arrangement by
 extending their types respectively, it is also possible to extend the vertex,
-halfedge, or face types of the <span class="textsc">Dcel</span> through inheritance. As the technique to
+halfedge, or face types of the \dcel through inheritance. As the technique to
 extend these types is somewhat cumbersome and difficult for inexperienced
 users, the `Arr_extended_dcel` class-template provides a convenient way to do that.
 Each one of the three features is extended with a corresponding data type
@@ -54,7 +54,7 @@ namespace CGAL {
 \ingroup PkgArrangementOnSurface2DCEL
 
 The `Arr_extended_face` class-template extends the face topological-features of the
-<span class="textsc">Dcel</span>. It is parameterized by a face base-type `FaceBase` and a data type
+\dcel. It is parameterized by a face base-type `FaceBase` and a data type
 `FData` used to extend the face base-type.
 
 \cgalModels `ArrangementDcelFace`
@@ -106,7 +106,7 @@ namespace CGAL {
 \ingroup PkgArrangementOnSurface2DCEL
 
 The `Arr_extended_halfedge` class-template extends the halfedge topological-features of
-the <span class="textsc">Dcel</span>. It is parameterized by a halfedge base-type `HalfedgeBase`
+the \dcel. It is parameterized by a halfedge base-type `HalfedgeBase`
 and a data type `HData` used to extend the halfedge base-type.
 
 \cgalModels `ArrangementDcelHalfedge`
@@ -158,7 +158,7 @@ namespace CGAL {
 \ingroup PkgArrangementOnSurface2DCEL
 
 The `Arr_extended_vertex` class-template extends the vertex
-topological-features of the <span class="textsc">Dcel</span>. It is parameterized by a
+topological-features of the \dcel. It is parameterized by a
 vertex base-type `VertexBase` and a data type `VData` used to extend
 the vertex base-type.
 
@@ -210,12 +210,12 @@ namespace CGAL {
 /*!
 \ingroup PkgArrangementOnSurface2DCEL
 
-The `Arr_face_extended_dcel` class-template extends the <span class="textsc">Dcel</span> face-records, making it
+The `Arr_face_extended_dcel` class-template extends the \dcel face-records, making it
 possible to store extra (non-geometric) data with the arrangement faces.
 The class should be instantiated by an `FData` type which represents the
 extra data stored with each face.
 
-Note that all types of <span class="textsc">Dcel</span> features (namely vertex, halfedge and face)
+Note that all types of \dcel features (namely vertex, halfedge and face)
 are provided as template parameters. However, by default they are defined
 as follows: