use \PkgXXX instead of \PkgXXXSummary

AABB_tree/doc/AABB_tree/PackageDescription.txt

@@ -5,7 +5,7 @@
 
 /*!
 \addtogroup PkgAABB_treeRef
-\cgalPkgDescriptionBegin{3D Fast Intersection and Distance Computation,PkgAABB_treeSummary}
+\cgalPkgDescriptionBegin{3D Fast Intersection and Distance Computation,PkgAABB_tree}
 \cgalPkgPicture{aabb-teaser-thumb.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pierre Alliez, Stéphane Tayeb, Camille Wormser}

Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/PackageDescription.txt

@@ -3,7 +3,7 @@
 /*!
 \addtogroup PkgAdvancingFrontSurfaceReconstructionRef
 
-\cgalPkgDescriptionBegin{Advancing Front Surface Reconstruction,PkgAdvancingFrontSurfaceReconstructionSummary}
+\cgalPkgDescriptionBegin{Advancing Front Surface Reconstruction,PkgAdvancingFrontSurfaceReconstruction}
 \cgalPkgPicture{afsr-detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Tran Kai Frank Da, David Cohen-Steiner}
@@ -16,7 +16,7 @@ of topological singularities. }
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.7}
-\cgalPkgDependsOn{\ref PkgTriangulation3Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation3}
 \cgalPkgBib{cgal:dc-afsr}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgShortInfoEnd

Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt

@@ -7,7 +7,7 @@
 \addtogroup PkgAlgebraicFoundationsRef
 \todo check generated documentation
 
-\cgalPkgDescriptionBegin{Algebraic Foundations,PkgAlgebraicFoundationsSummary}
+\cgalPkgDescriptionBegin{Algebraic Foundations,PkgAlgebraicFoundations}
 \cgalPkgPicture{Algebraic_foundations2.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Michael Hemmer}

Algebraic_kernel_d/doc/Algebraic_kernel_d/PackageDescription.txt

@@ -17,7 +17,7 @@
 /*!
 \addtogroup PkgAlgebraicKerneldRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Algebraic Kernel,PkgAlgebraicKerneldSummary}
+\cgalPkgDescriptionBegin{Algebraic Kernel,PkgAlgebraicKerneld}
 \cgalPkgPicture{Algebraic_kernel_d.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Eric Berberich, Michael Hemmer, Michael Kerber, Sylvain Lazard, Luis Peñaranda, and Monique Teillaud}

Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt

@@ -5,7 +5,7 @@
 /*!
 \addtogroup PkgAlphaShape2Ref
 
-\cgalPkgDescriptionBegin{2D Alpha Shapes,PkgAlphaShape2Summary}
+\cgalPkgDescriptionBegin{2D Alpha Shapes,PkgAlphaShape2}
 \cgalPkgPicture{alpha-detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Tran Kai Frank Da}
@@ -14,7 +14,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{2.1}
-\cgalPkgDependsOn{\ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation2}
 \cgalPkgBib{cgal:d-as2}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{2D Alpha Shapes,alpha_shapes_2.zip}

Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt

@@ -3,7 +3,7 @@
 /// \ingroup PkgAlphaShapes3Ref
 /*!
 \addtogroup PkgAlphaShapes3Ref
-\cgalPkgDescriptionBegin{3D Alpha Shapes,PkgAlphaShapes3Summary}
+\cgalPkgDescriptionBegin{3D Alpha Shapes,PkgAlphaShapes3}
 \cgalPkgPicture{alpha_shapes_3_small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Tran Kai Frank Da, Sébastien Loriot, and Mariette Yvinec}
@@ -12,7 +12,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{2.3}
-\cgalPkgDependsOn{\ref PkgTriangulation3Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation3}
 \cgalPkgBib{cgal:dy-as3}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{3D Alpha Shapes,alpha_shape_3.zip}

Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgApolloniusGraph2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Apollonius Graphs (Delaunay Graphs of Disks),PkgApolloniusGraph2Summary}
+\cgalPkgDescriptionBegin{2D Apollonius Graphs (Delaunay Graphs of Disks),PkgApolloniusGraph2}
 \cgalPkgPicture{CircleVoronoi.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Menelaos Karavelas and Mariette Yvinec}
@@ -13,7 +13,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.0}
-\cgalPkgDependsOn{\ref PkgTDS2Summary}
+\cgalPkgDependsOn{\ref PkgTDS2}
 \cgalPkgBib{cgal:ky-ag2}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{2D Apollonius Graph,apollonius_graph_2.zip}

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt

@@ -58,7 +58,7 @@ namespace ArrTraits {}
 /*!
 \addtogroup PkgArrangement2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Arrangements,PkgArrangement2Summary}
+\cgalPkgDescriptionBegin{2D Arrangements,PkgArrangement2}
 \cgalPkgPicture{Arrangement_2.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Ron Wein, Eric Berberich, Efi Fogel, Dan Halperin, Michael Hemmer, Oren Salzman, and Baruch Zukerman}

BGL/doc/BGL/BGL.txt

@@ -22,7 +22,7 @@ Furthermore, this package extends the \sc{Bgl}
 by introducing concepts such as `HalfedgeGraph` and `FaceGraph`
 allowing to handle *halfedges* and *faces*.
 These concepts reflect the design of the halfedge data structure described
-in Chapter \ref PkgHDSSummary, with opposite halfedges and circular
+in Chapter \ref PkgHDS, with opposite halfedges and circular
 sequences of halfedges around vertices and around faces.
 
 This chapter is organized as follows:
@@ -31,10 +31,10 @@ This chapter is organized as follows:
 different libraries.
 - The four following sections give examples on how to use CGAL graph and mesh data structures
 such as
-\link PkgSurfaceMeshSummary Surface_mesh \endlink,
+\link PkgSurfaceMesh Surface_mesh \endlink,
-\link PkgPolyhedronSummary Polyhedron \endlink,
+\link PkgPolyhedron Polyhedron \endlink,
-\link PkgArrangement2Summary Arrangement_2 \endlink, and the
+\link PkgArrangement2 Arrangement_2 \endlink, and the
-\link PkgTriangulation2Summary 2D triangulation \endlink classes as models of the \sc{Bgl} concepts.
+\link PkgTriangulation2 2D triangulation \endlink classes as models of the \sc{Bgl} concepts.
 - Starting with Section \ref BGLExtensions, we introduce new graph concepts, classes,
 and functions that extend the functionalities of the \sc{Bgl}.
 
@@ -127,7 +127,7 @@ The data itself may be stored in the vertex or the edge, or it may
 be stored in an external data structure, or it may be computed on
 the fly. This is an implementation detail of a particular property map.
 
-See also Chapter \ref PkgProperty_mapSummary.
+See also Chapter \ref PkgProperty_map.
 
 \subsection BGLVisitors Visitors
 
@@ -218,7 +218,7 @@ the concepts provided by \cgal to implement a simple algorithm.
 
 The following example program computes the minimum spanning tree on a surface mesh.
 More examples can be found in Chapters
-\ref PkgSurfaceMeshSimplificationSummary, \ref PkgSurfaceSegmentationSummary, and \ref PkgSurfaceMeshDeformationSummary.
+\ref PkgSurfaceMeshSimplification, \ref PkgSurfaceSegmentation, and \ref PkgSurfaceMeshDeformation.
 
 The surface mesh class uses integer indices to address vertices and edges,
 and it comes with a built-in property mechanism that maps nicely on the \sc{Bgl}.
@@ -237,7 +237,7 @@ the concepts provided by \cgal to implement a simple algorithm.
 
 The following example program computes the minimum spanning tree on a polyhedral surface.
 More examples can be found in the Chapter
-\ref PkgSurfaceMeshSimplificationSummary.
+\ref PkgSurfaceMeshSimplification.
 
 \cgalExample{BGL_polyhedron_3/kruskal.cpp}
 
@@ -423,7 +423,7 @@ by the functionalities of the \sc{Bgl}.
 
 \subsection BGLExtensionsGraphConcepts Graph concepts
 
-In order to match \ref PkgHDSSummary more closely and to enable writing generic algorithms
+In order to match \ref PkgHDS more closely and to enable writing generic algorithms
 which operate on data structures that have faces and halfedges, we define
 a set of new concepts to extend the <a href="https://www.boost.org/libs/graph/doc/graph_concepts.html">graph concepts of the BGL</a>:
 
@@ -636,7 +636,7 @@ Vertices of the seam mesh that are linked by a green dashed segment correspond
 to the same vertex in the underlying mesh.
 \cgalFigureEnd
 
-Seam meshes are for example used in Chapter \ref PkgSurfaceParameterizationSummary
+Seam meshes are for example used in Chapter \ref PkgSurfaceParameterization
 to parameterize a topological sphere by first virtually cutting it into a topological
 disk.
 

BGL/doc/BGL/PackageDescription.txt

@@ -542,7 +542,7 @@ Methods to read and write graphs.
 
 /*!
 \addtogroup PkgBGLRef
-\cgalPkgDescriptionBegin{CGAL and the Boost Graph Library,PkgBGLSummary}
+\cgalPkgDescriptionBegin{CGAL and the Boost Graph Library,PkgBGL}
 \cgalPkgPicture{emst-detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Andreas Fabri, Fernando Cacciola, Philipp Moeller, and Ron Wein}

Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Barycentric_coordinates_2.txt

@@ -10,7 +10,7 @@ namespace CGAL {
 
 \section gbc_introduction Introduction
 
-The package <em>2D Generalized Barycentric Coordinates</em> offers an efficient and robust implementation of two-dimensional closed-form generalized barycentric coordinates defined for simple two-dimensional polygons. If coordinates with respect to multivariate scattered points instead of a polygon are required, please refer to natural neighbour coordinates from the package \ref PkgInterpolation2Summary "2D and Surface Function Interpolation". 
+The package <em>2D Generalized Barycentric Coordinates</em> offers an efficient and robust implementation of two-dimensional closed-form generalized barycentric coordinates defined for simple two-dimensional polygons. If coordinates with respect to multivariate scattered points instead of a polygon are required, please refer to natural neighbour coordinates from the package \ref PkgInterpolation2 "2D and Surface Function Interpolation". 
 
 In particular, the package includes an implementation of \ref wp_example "Wachspress", \ref mv_example "mean value", and \ref dh_example "discrete harmonic" coordinates and provides some extra functions to compute barycentric coordinates with respect to segments (\ref seg_example "segment coordinates") and triangles (\ref tri_example "triangle coordinates"). The section \ref gbc_theory gives a short introduction to the topic of barycentric coordinates. 
 
@@ -85,7 +85,7 @@ This is an advanced example that shows how to use generalized barycentric coordi
 A 2D polygon with 50 vertices representing a piece of terrain with convex and concave parts. The height is not shown.
 \cgalFigureEnd
 
-In this example we project a three-dimensional polygon orthogonally onto the two-dimensional plane using the class `CGAL::Projection_traits_xy_3`, triangulate its interior using the class `CGAL::Delaunay_mesher_2`, and compute mean value coordinates for all the obtained points with respect to all the polygon's vertices. Finally, we interpolate the height data from the polygon's boundary to its interior using the computed coordinates and the global interpolation function from the package \ref PkgInterpolation2Summary "2D and Surface Function Interpolation".
+In this example we project a three-dimensional polygon orthogonally onto the two-dimensional plane using the class `CGAL::Projection_traits_xy_3`, triangulate its interior using the class `CGAL::Delaunay_mesher_2`, and compute mean value coordinates for all the obtained points with respect to all the polygon's vertices. Finally, we interpolate the height data from the polygon's boundary to its interior using the computed coordinates and the global interpolation function from the package \ref PkgInterpolation2 "2D and Surface Function Interpolation".
 
 \cgalExample{Barycentric_coordinates_2/Terrain_height_modeling.cpp}
 
@@ -256,7 +256,7 @@ Analogously to the previous cases, we want to plot the Wachspress coordinates an
 The Wachspress coordinate function with respect to the indicated vertex with values from zero to one as the colour bar indicates.
 \cgalFigureEnd
 
-Another type of generalized barycentric coordinates goes back to Pinkall and Polthier in 1993 \cite cgal:pp-cdmsc-93 and Eck et al. in 1995 \cite cgal:bc:eddhls-maam-95 in the context of \ref PkgSurfaceParameterizationSummary "triangle mesh parameterization". They are called discrete harmonic coordinates. \ref gbc_deg_discrete_harmonic_coordinates "These coordinates" are well-defined, similarly to Wachspress coordinates, for arbitrary <em>strictly convex polygons</em> and inherit all the properties of triangle coordinates <em>apart from the positivity inside a polygon</em> because they can take on negative values \ref gbc_deg_discrete_harmonic_coordinates "for some polygons". Another interesting property of these coordinate functions is that they coincide with Wachspress coordinates for any polygon whose vertices lie on a common circle.
+Another type of generalized barycentric coordinates goes back to Pinkall and Polthier in 1993 \cite cgal:pp-cdmsc-93 and Eck et al. in 1995 \cite cgal:bc:eddhls-maam-95 in the context of \ref PkgSurfaceParameterization "triangle mesh parameterization". They are called discrete harmonic coordinates. \ref gbc_deg_discrete_harmonic_coordinates "These coordinates" are well-defined, similarly to Wachspress coordinates, for arbitrary <em>strictly convex polygons</em> and inherit all the properties of triangle coordinates <em>apart from the positivity inside a polygon</em> because they can take on negative values \ref gbc_deg_discrete_harmonic_coordinates "for some polygons". Another interesting property of these coordinate functions is that they coincide with Wachspress coordinates for any polygon whose vertices lie on a common circle.
 
 To plot discrete harmonic coordinates we take \ref wp_plot "the same polygon" as for Wachspress coordinates and plot the coordinate function with respect to the same vertex. Again, we get a smooth function, which is linear along all edges and grows from zero to one. Isolines in the plot show the difference between discrete harmonic and Wachspress coordinates for the chosen polygon and vertex.
 
@@ -265,7 +265,7 @@ To plot discrete harmonic coordinates we take \ref wp_plot "the same polygon" as
 The discrete harmonic coordinate function with respect to the indicated vertex with values from zero to one as the colour bar indicates.
 \cgalFigureEnd
 
-The last type of generalized barycentric coordinates that we discuss are mean value coordinates \cite cgal:f-mvc-03 proposed by M. Floater in 2003. Based on the <a href="http://en.wikipedia.org/wiki/Mean_value_theorem">mean value theorem</a>, \ref gbc_deg_mean_value_coordinates "these coordinates", unlike Wachspress and discrete harmonic coordinates, are well-defined for arbitrary <em>simple polygons</em>, inherit all the properties of triangle coordinates for any convex polygon, and <em>lack only the positivity property for general concave polygons</em>. Hormann and Floater prove in \cite cgal:bc:hf-mvcapp-06 that these coordinates are positive inside the kernel of a <a href="https://en.wikipedia.org/wiki/Star-shaped_polygon">star-shaped polygon</a>. They are also positive in the closure of any quadrilateral. Like discrete harmonic weights, mean value weights are often used in the context of \ref PkgSurfaceParameterizationSummary "triangle mesh parameterization."
+The last type of generalized barycentric coordinates that we discuss are mean value coordinates \cite cgal:f-mvc-03 proposed by M. Floater in 2003. Based on the <a href="http://en.wikipedia.org/wiki/Mean_value_theorem">mean value theorem</a>, \ref gbc_deg_mean_value_coordinates "these coordinates", unlike Wachspress and discrete harmonic coordinates, are well-defined for arbitrary <em>simple polygons</em>, inherit all the properties of triangle coordinates for any convex polygon, and <em>lack only the positivity property for general concave polygons</em>. Hormann and Floater prove in \cite cgal:bc:hf-mvcapp-06 that these coordinates are positive inside the kernel of a <a href="https://en.wikipedia.org/wiki/Star-shaped_polygon">star-shaped polygon</a>. They are also positive in the closure of any quadrilateral. Like discrete harmonic weights, mean value weights are often used in the context of \ref PkgSurfaceParameterization "triangle mesh parameterization."
 
 In order to show the particular behaviour of mean value coordinates with an application to concave polygons, we take \ref fig__mv__example "a star-shaped polygon" with ten vertices \f$[v_0, \dots, v_9]\f$, sample its interior and boundary, and plot the coordinate function with respect to the fourth vertex \f$v_3\f$. As the colour bar indicates, the obtained function grows from a slightly negative value to one at the chosen vertex. It is also smooth inside the polygon and linear along all edges.
 

Barycentric_coordinates_2/doc/Barycentric_coordinates_2/PackageDescription.txt

@@ -6,11 +6,11 @@
 /*!
 
 \addtogroup PkgBarycentric_coordinates_2Ref
-\cgalPkgDescriptionBegin{2D Generalized Barycentric Coordinates, PkgBarycentric_coordinates_2Summary}
+\cgalPkgDescriptionBegin{2D Generalized Barycentric Coordinates, PkgBarycentric_coordinates_2}
 \cgalPkgPicture{barcoord_thumb.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Dmitry Anisimov, David Bommes, Kai Hormann, and Pierre Alliez}
-\cgalPkgDesc{The package 2D Generalized Barycentric Coordinates offers an efficient and robust implementation of two-dimensional closed-form generalized barycentric coordinates defined for simple two-dimensional polygons. If coordinates with respect to multivariate scattered points instead of a polygon are required, please refer to natural neighbor coordinates from the Package \ref PkgInterpolation2Summary.}
+\cgalPkgDesc{The package 2D Generalized Barycentric Coordinates offers an efficient and robust implementation of two-dimensional closed-form generalized barycentric coordinates defined for simple two-dimensional polygons. If coordinates with respect to multivariate scattered points instead of a polygon are required, please refer to natural neighbor coordinates from the Package \ref PkgInterpolation2.}
 \cgalPkgManuals{Chapter_2D_Generalized_Barycentric_Coordinates, PkgBarycentric_coordinates_2Ref}
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin

Boolean_set_operations_2/doc/Boolean_set_operations_2/Boolean_set_operations_2.txt

@@ -23,7 +23,7 @@ intersection predicates, and point containment predicates.
 
 Ordinary Boolean set-operations, which distinguish between the
 interior and the boundary of a polygon, are not implemented within this
-package. The Chapter \ref PkgNef2Summary supports these operations for (linear)
+package. The Chapter \ref PkgNef2 supports these operations for (linear)
 polygons.
 
 In the rest of this chapter we use, unless otherwise stated, the

Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt

@@ -9,7 +9,7 @@ namespace ArrDirectionalTraits {}
 /*!
 \addtogroup PkgBooleanSetOperations2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Regularized Boolean Set-Operations,PkgBooleanSetOperations2Summary}
+\cgalPkgDescriptionBegin{2D Regularized Boolean Set-Operations,PkgBooleanSetOperations2}
 \cgalPkgPicture{Boolean_set_operations_2.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Efi Fogel, Ophir Setter, Ron Wein, Guy Zucker, Baruch Zukerman, and Dan Halperin}
@@ -18,7 +18,7 @@ namespace ArrDirectionalTraits {}
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.2}
-\cgalPkgDependsOn{\ref PkgArrangement2Summary}
+\cgalPkgDependsOn{\ref PkgArrangement2}
 \cgalPkgBib{cgal:fwzh-rbso2}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Boolean operations,boolean_operations_2.zip}

Bounding_volumes/doc/Bounding_volumes/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgBoundingVolumesRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Bounding Volumes,PkgBoundingVolumesSummary}
+\cgalPkgDescriptionBegin{Bounding Volumes,PkgBoundingVolumes}
 \cgalPkgPicture{minCircle.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Kaspar Fischer, Bernd Gärtner, Thomas Herrmann, Michael Hoffmann, and Sven Schönherr}

Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt

@@ -22,7 +22,7 @@
 
 \todo de-math and change D to d for the dimension
 
-\cgalPkgDescriptionBegin{Intersecting Sequences of dD Iso-oriented Boxes,PkgBoxIntersectionDSummary}
+\cgalPkgDescriptionBegin{Intersecting Sequences of dD Iso-oriented Boxes,PkgBoxIntersectionD}
 \cgalPkgPicture{box_inters-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Lutz Kettner, Andreas Meyer, and Afra Zomorodian}

CGAL_ipelets/doc/CGAL_ipelets/PackageDescription.txt

@@ -1,7 +1,7 @@
 /// \defgroup PkgCGALIpeletsRef CGAL Ipelets Reference
 /*!
 \addtogroup PkgCGALIpeletsRef
-\cgalPkgDescriptionBegin{CGAL Ipelets,PkgCGALIpeletsSummary}
+\cgalPkgDescriptionBegin{CGAL Ipelets,PkgCGALIpelets}
 \cgalPkgPicture{ipeico.jpg}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Olivier Devillers, Sébastien Loriot, and Sylvain Pion}

Circular_kernel_2/doc/Circular_kernel_2/PackageDescription.txt

@@ -23,7 +23,7 @@
 /*!
 \addtogroup PkgCircularKernel2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Circular Geometry Kernel,PkgCircularKernel2Summary}
+\cgalPkgDescriptionBegin{2D Circular Geometry Kernel,PkgCircularKernel2}
 \cgalPkgPicture{Boolean_operation_detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pedro Machado Manhães de Castro, Sylvain Pion, and Monique Teillaud}

Circular_kernel_3/doc/Circular_kernel_3/PackageDescription.txt

@@ -20,7 +20,7 @@
 
 /*!
 \addtogroup PkgSphericalKernel3Ref
-\cgalPkgDescriptionBegin{3D Spherical Geometry Kernel,PkgSphericalKernel3Summary}
+\cgalPkgDescriptionBegin{3D Spherical Geometry Kernel,PkgSphericalKernel3}
 \cgalPkgPicture{segment_sphere_intersection_detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, and Monique Teillaud}

Circulator/doc/Circulator/PackageDescription.txt

@@ -22,7 +22,7 @@
 
 /*!
 \addtogroup PkgHandlesAndCirculatorsRef
-\cgalPkgDescriptionBegin{Handles and Circulators,PkgHandlesAndCirculatorsSummary}
+\cgalPkgDescriptionBegin{Handles and Circulators,PkgHandlesAndCirculators}
 \cgalPkgPicture{circulator.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Olivier Devillers, Lutz Kettner, Sylvain Pion, Michael Seel, and Mariette Yvinec}

Classification/doc/Classification/PackageDescription.txt

@@ -51,7 +51,7 @@ Data structures specialized to classify clusters.
 
 \addtogroup PkgClassificationRef
 
-\cgalPkgDescriptionBegin{Classification, PkgClassificationSummary}
+\cgalPkgDescriptionBegin{Classification, PkgClassification}
 \cgalPkgPicture{data_classif.png}
 
 \cgalPkgSummaryBegin
@@ -62,7 +62,7 @@ Data structures specialized to classify clusters.
 
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.12}
-\cgalPkgDependsOn{\ref PkgSolverSummary, \ref PkgSpatialSearchingDSummary, [Boost Serialization](http://www.boost.org/libs/serialization) and
+\cgalPkgDependsOn{\ref PkgSolver, \ref PkgSpatialSearchingD, [Boost Serialization](http://www.boost.org/libs/serialization) and
 [Boost IO Streams](http://www.boost.org/libs/iostreams)}
 \cgalPkgBib{cgal:lm-clscm-12}
 \cgalPkgLicense{\ref licensesGPL "GPL"}

Combinatorial_map/doc/Combinatorial_map/PackageDescription.txt

@@ -25,7 +25,7 @@
 
 /*!
 \addtogroup PkgCombinatorialMapsRef
-\cgalPkgDescriptionBegin{Combinatorial Maps,PkgCombinatorialMapsSummary}
+\cgalPkgDescriptionBegin{Combinatorial Maps,PkgCombinatorialMaps}
 \cgalPkgPicture{cmap_logo.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Guillaume Damiand}

Cone_spanners_2/doc/Cone_spanners_2/PackageDescription.txt

@@ -5,7 +5,7 @@
 /*!
 \addtogroup PkgConeBasedSpannersRef
 
-\cgalPkgDescriptionBegin{Cone-Based Spanners,PkgConeBasedSpannersSummary}
+\cgalPkgDescriptionBegin{Cone-Based Spanners,PkgConeBasedSpanners}
 \cgalPkgPicture{Logo-ConeSpanners.png}
 
 \cgalPkgSummaryBegin

Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt

@@ -2,7 +2,7 @@
 
 /*!
 \addtogroup PkgConvexDecomposition3Ref
-\cgalPkgDescriptionBegin{Convex Decomposition of Polyhedra,PkgConvexDecomposition3Summary}
+\cgalPkgDescriptionBegin{Convex Decomposition of Polyhedra,PkgConvexDecomposition3}
 \cgalPkgPicture{Convex_decomposition_3/fig/Convex_decomposition_3-teaser.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Peter Hachenberger}

Convex_hull_2/doc/Convex_hull_2/PackageDescription.txt

@@ -21,7 +21,7 @@
 /*!
 \addtogroup PkgConvexHull2Ref
 
-\cgalPkgDescriptionBegin{2D Convex Hulls and Extreme Points,PkgConvexHull2Summary}
+\cgalPkgDescriptionBegin{2D Convex Hulls and Extreme Points,PkgConvexHull2}
 \cgalPkgPicture{Convex_hull_2/fig/convex_hull.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Susan Hert and Stefan Schirra}

Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt

@@ -23,7 +23,7 @@ degenerate hull may also be possible.
 \addtogroup PkgConvexHull3Ref
 \todo fix or keep the `Default_traits`
 
-\cgalPkgDescriptionBegin{3D Convex Hulls,PkgConvexHull3Summary}
+\cgalPkgDescriptionBegin{3D Convex Hulls,PkgConvexHull3}
 \cgalPkgPicture{Convex_hull_3/fig/bunny.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Susan Hert and Stefan Schirra}
@@ -32,7 +32,7 @@ degenerate hull may also be possible.
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{1.1}
-\cgalPkgDependsOn{The dynamic algorithms depend on \ref PkgTriangulation3Summary "3D Triangulations".}
+\cgalPkgDependsOn{The dynamic algorithms depend on \ref PkgTriangulation3 "3D Triangulations".}
 \cgalPkgBib{cgal:hs-ch3}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h

@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgConvexHullDRef
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 An instance `C` of type `Convex_hull_d<R>` is the convex hull
 of a multi-set `S` of points in \f$ d\f$-dimensional space. We call

Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d_to_polyhedron_3.h

@@ -1,7 +1,7 @@
 namespace CGAL {
 
 /*!
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 converts the convex hull `C` to polyhedral surface stored in 
 `P`. 
@@ -13,7 +13,7 @@ template <class R, class T, class HDS>
 void convex_hull_d_to_polyhedron_3( const Convex_hull_d<R>& C, Polyhedron_3<T,HDS>& P) ; 
 
 /*!
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead 
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead 
 
 constructs the representation of the surface of `C` as a 
 bidirected LEDA graph `G`. 

Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d_traits_3.h

@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgConvexHullDRef
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 <A NAME="Index_anchor_0"></A> 
 

Convex_hull_d/doc/Convex_hull_d/CGAL/Delaunay_d.h

@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgConvexHullDRef
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 An instance `DT` of type `Delaunay_d< R, Lifted_R >` is the
 nearest and furthest site Delaunay triangulation of a set `S` of

Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h

@@ -2,7 +2,7 @@
 \ingroup PkgConvexHullDConcepts
 \cgalConcept
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 Requirements of the traits class to be used with the 
 class `CGAL::Convex_hull_d`. 

Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h

@@ -2,7 +2,7 @@
 \ingroup PkgConvexHullDConcepts
 \cgalConcept
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 Requirements of the second traits class to be used with the 
 class `CGAL::Delaunay_d`. 

Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h

@@ -2,7 +2,7 @@
 \ingroup PkgConvexHullDConcepts
 \cgalConcept
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 Requirements of the first traits class to be used with the 
 class `CGAL::Delaunay_d`. 

Convex_hull_d/doc/Convex_hull_d/Convex_hull_d.txt

@@ -7,7 +7,7 @@ namespace CGAL {
 \anchor chapconvexhulld
 \authors Susan Hert and Michael Seel
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 \section Convex_hull_dIntroduction Introduction
 

Convex_hull_d/doc/Convex_hull_d/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgConvexHullDRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{dD Convex Hulls and Delaunay Triangulations,PkgConvexHullDSummary}
+\cgalPkgDescriptionBegin{dD Convex Hulls and Delaunay Triangulations,PkgConvexHullD}
 \cgalPkgPicture{convex_hull_d-teaser.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Susan Hert and Michael Seel}
@@ -18,7 +18,7 @@
 \cgalPkgShortInfoEnd
 \cgalPkgDescriptionEnd
 
-\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulationsSummary should be used instead.
+\deprecated This package is deprecated since the version 4.6 of \cgal. The package \ref PkgTriangulations should be used instead.
 
 A subset \f$ S \subseteq \mathbb{R}^d\f$ is convex if for any two points \f$ p\f$ and \f$ q\f$
 in the set the line segment with endpoints \f$ p\f$ and \f$ q\f$ is contained

Documentation/doc/Documentation/Developer_manual/Chapter_iterators_and_circulators.txt

@@ -19,15 +19,15 @@ Iterators are widely used in \cgal too.
 \cgal extends the idea of the iterator, which works for linear data
 structures, to circular data structures by defining the concept of
 a circulator.
-\ref PkgHandlesAndCirculatorsSummary "Circulators" are quite similar to iterators, with the
+\ref PkgHandlesAndCirculators "Circulators" are quite similar to iterators, with the
 major difference being the absence of a past-the-end position in a sequence.
 Note that circulators are NOT part of the \stl, but of \cgal.
 
-In \cgal, we also define the concept of \ref PkgHandlesAndCirculatorsSummary "handle",
+In \cgal, we also define the concept of \ref PkgHandlesAndCirculators "handle",
 which behaves roughly
 like a pointer to an object without an increment or decrement operation.
 More details about handles and their requirements can be found in 
-the \ref PkgHandlesAndCirculatorsSummary "chapter Circulators and Handles"
+the \ref PkgHandlesAndCirculators "chapter Circulators and Handles"
 of the Support Library part of \cgal manual. 
 Section  \ref sechandle_vs_it_vs_circ  below discusses when handles
 should be used in your code.
@@ -35,7 +35,7 @@ should be used in your code.
 The concepts of iterators is relatively well described in textbooks such as 
 Stroustrup's book (<I>The C++ Programming Language</I> \cgalCite{cgal:s-cpl-97})
 and Austern's book (<I>Generic Programming and the \stl</I> \cgalCite{cgal:a-gps-98})
-and in chapter \ref PkgHandlesAndCirculatorsSummary "Handles and Circulators"
+and in chapter \ref PkgHandlesAndCirculators "Handles and Circulators"
 of the <I>Support Library</I> part of the \cgal manual.
 which also presents the concepts of handles and circulators.
 Thus we will not give a full description of these concept here
@@ -325,7 +325,7 @@ over either a linear or circular sequence:
 - `CGAL_For_all( ic1, ic2)`
 - `CGAL_For_all_backwards( ic1, ic2)`.
 
-See the chapter \ref PkgHandlesAndCirculatorsSummary "Handles and Circulators"
+See the chapter \ref PkgHandlesAndCirculators "Handles and Circulators"
  in the <I>Support Library</I> part of \cgal manual 
 for more information and examples.
 

Documentation/doc/Documentation/Installation.txt

@@ -601,7 +601,7 @@ and designed to partition graphs and produce fill-reducing matrix orderings.
 \cgal offers wrappers around some of the methods of the \sc{METIS} library
 to allow the partitioning of graphs that are models of the concepts of the
 <A HREF="http://www.boost.org/libs/graph/doc/index.html">Boost Graph Library</A>,
-and, by extension, of surface meshes (see Section \ref BGLPartitioning of the package \ref PkgBGLSummary).
+and, by extension, of surface meshes (see Section \ref BGLPartitioning of the package \ref PkgBGL).
 
 More information is available on the METIS library
 at <A HREF="http://glaros.dtc.umn.edu/gkhome/metis/metis/overview">`http://glaros.dtc.umn.edu/gkhome/metis/metis/overview`</A>.

Documentation/doc/Documentation/Tutorials/Tutorial_hello_world.txt

@@ -318,7 +318,7 @@ This function only compiles if the `operator<(..)` is defined for the type used
 and we say that the type must be a model of `LessThanComparable`.
 
 An example for a concept with required free functions is the `HalfedgeListGraph` in the
-\cgal package \ref PkgBGLSummary. In order to be a model of `HalfedgeListGraph` a class `G` 
+\cgal package \ref PkgBGL. In order to be a model of `HalfedgeListGraph` a class `G` 
 there must be a global function `halfedges(const G&)`, etc.
 
 An example for a concept with a required traits class is `InputIterator`.

Envelope_2/doc/Envelope_2/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgEnvelope2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Envelopes,PkgEnvelope2Summary}
+\cgalPkgDescriptionBegin{2D Envelopes,PkgEnvelope2}
 \cgalPkgPicture{Envelope_2/fig/Envelope_2.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Ron Wein}
@@ -13,7 +13,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.3}
-\cgalPkgDependsOn{\ref PkgArrangement2Summary}
+\cgalPkgDependsOn{\ref PkgArrangement2}
 \cgalPkgBib{cgal:w-e2}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgShortInfoEnd

Envelope_3/doc/Envelope_3/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgEnvelope3Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{3D Envelopes,PkgEnvelope3Summary}
+\cgalPkgDescriptionBegin{3D Envelopes,PkgEnvelope3}
 \cgalPkgPicture{Envelope_3/fig/Envelope_3.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Dan Halperin, Michal Meyerovitch, Ron Wein, and Baruch Zukerman}
@@ -13,7 +13,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.3}
-\cgalPkgDependsOn{\ref PkgArrangement2Summary}
+\cgalPkgDependsOn{\ref PkgArrangement2}
 \cgalPkgBib{cgal:mwz-e3}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{3D Envelopes,envelope_3.zip,L1 Voronoi Diagram,l1_voronoi_diagram_2.zip}

Generalized_map/doc/Generalized_map/PackageDescription.txt

@@ -8,7 +8,7 @@
 
 /*!
 \addtogroup PkgGeneralizedMapsRef
-\cgalPkgDescriptionBegin{Generalized Maps,PkgGeneralizedMapsSummary}
+\cgalPkgDescriptionBegin{Generalized Maps,PkgGeneralizedMaps}
 \cgalPkgPicture{gmap_logo.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Guillaume Damiand}

Generator/doc/Generator/PackageDescription.txt

@@ -3,7 +3,7 @@
 /// \ingroup PkgGeneratorsRef
 /*!
 \addtogroup PkgGeneratorsRef
-\cgalPkgDescriptionBegin{Geometric Object Generators,PkgGeneratorsSummary}
+\cgalPkgDescriptionBegin{Geometric Object Generators,PkgGenerators}
 \cgalPkgPicture{dice.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pedro M. M. de Castro, Olivier Devillers, Susan Hert, Michael Hoffmann, Lutz Kettner, Sven Schönherr, Alexandru Tifrea, and Maxime Gimeno}

Geomview/doc/Geomview/PackageDescription.txt

@@ -2,7 +2,7 @@
 /*!
 \addtogroup PkgGeomviewRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Geomview,PkgGeomviewSummary}
+\cgalPkgDescriptionBegin{Geomview,PkgGeomview}
 \cgalPkgPicture{geomview.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Andreas Fabri and Sylvain Pion}

GraphicsView/doc/GraphicsView/PackageDescription.txt

@@ -9,7 +9,7 @@
 /*!
 \addtogroup PkgGraphicsViewRef
 
-\cgalPkgDescriptionBegin{CGAL and the Qt Graphics View Framework,PkgGraphicsViewSummary}
+\cgalPkgDescriptionBegin{CGAL and the Qt Graphics View Framework,PkgGraphicsView}
 \cgalPkgPicture{detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Andreas Fabri and Laurent Rineau}

HalfedgeDS/doc/HalfedgeDS/PackageDescription.txt

@@ -20,7 +20,7 @@
 /*!
 \addtogroup PkgHDSRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Halfedge Data Structures,PkgHDSSummary}
+\cgalPkgDescriptionBegin{Halfedge Data Structures,PkgHDS}
 \cgalPkgPicture{HalfedgeDS/fig/HalfedgeDS-teaser-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Lutz Kettner}

Inscribed_areas/doc/Inscribed_areas/PackageDescription.txt

@@ -6,7 +6,7 @@
 /*!
 \addtogroup PkgInscribedAreasRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Inscribed Areas,PkgInscribedAreasSummary}
+\cgalPkgDescriptionBegin{Inscribed Areas,PkgInscribedAreas}
 \cgalPkgPicture{ler-detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Michael Hoffmann and Eli Packer}

Interpolation/doc/Interpolation/Interpolation.txt

@@ -95,7 +95,7 @@ diagrams, also known as <em>power diagrams</em>, are obtained by considering wei
 defined between two weighted points \f$ (p, \omega_p) \f$ and \f$ (q, \omega_q) \f$ by
 \f$ \Pi( (p, \omega_p), (q, \omega_q) ) = pq^2 - \omega_p - \omega_q \f$.
 See \link Subsection_2D_Triangulations_Regular_Description this section \endlink
-of the package \ref PkgTriangulation2Summary for an in-depth description of power diagrams.
+of the package \ref PkgTriangulation2 for an in-depth description of power diagrams.
 
 \cgalFigureBegin{figrn_coords, rn_coords.svg}
 Illustration of regular neighbor coordinates. The point set is the same

Interpolation/doc/Interpolation/PackageDescription.txt

@@ -14,7 +14,7 @@
 
 /*!
 \addtogroup PkgInterpolation2Ref
-\cgalPkgDescriptionBegin{2D and Surface Function Interpolation,PkgInterpolation2Summary}
+\cgalPkgDescriptionBegin{2D and Surface Function Interpolation,PkgInterpolation2}
 \cgalPkgPicture{interpolation.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Julia Flötotto}

Interval_skip_list/doc/Interval_skip_list/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgIntervalSkipListRef
 
-\cgalPkgDescriptionBegin{Interval Skip List,PkgIntervalSkipListSummary}
+\cgalPkgDescriptionBegin{Interval Skip List,PkgIntervalSkipList}
 \cgalPkgPicture{Interval_skip_list/fig/query.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Andreas Fabri}

Jet_fitting_3/doc/Jet_fitting_3/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgJet_fitting_3Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Estimation of Local Differential Properties of Point-Sampled Surfaces,PkgJet_fitting_3Summary}
+\cgalPkgDescriptionBegin{Estimation of Local Differential Properties of Point-Sampled Surfaces,PkgJet_fitting_3}
 \cgalPkgPicture{DavidDetail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Marc Pouget  and Frédéric Cazals}
@@ -13,7 +13,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.3}
-\cgalPkgDependsOn{\ref PkgSolverSummary and \ref thirdpartyEigen}
+\cgalPkgDependsOn{\ref PkgSolver and \ref thirdpartyEigen}
 \cgalPkgBib{cgal:pc-eldp}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Kernel_23/doc/Kernel_23/PackageDescription.txt

@@ -35,7 +35,7 @@
 
 /*!
 \addtogroup PkgKernel23Ref
-\cgalPkgDescriptionBegin{2D and 3D Linear Geometry Kernel,PkgKernel23Summary}
+\cgalPkgDescriptionBegin{2D and 3D Linear Geometry Kernel,PkgKernel23}
 \cgalPkgPicture{pointSegmentTriangle.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Hervé Brönnimann, Andreas Fabri, Geert-Jan Giezeman, Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Stefan Schirra}

Kernel_d/doc/Kernel_d/PackageDescription.txt

@@ -22,7 +22,7 @@
 /*!
 \addtogroup PkgKernelDRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{dD Geometry Kernel,PkgKernelDSummary}
+\cgalPkgDescriptionBegin{dD Geometry Kernel,PkgKernelD}
 \cgalPkgPicture{hypercube.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Michael Seel}

Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt

@@ -30,7 +30,7 @@
 
 /*!
 \addtogroup PkgLinearCellComplexRef
-\cgalPkgDescriptionBegin{Linear Cell Complex,PkgLinearCellComplexSummary}
+\cgalPkgDescriptionBegin{Linear Cell Complex,PkgLinearCellComplex}
 \cgalPkgPicture{lcc_logo.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Guillaume Damiand}
@@ -39,8 +39,8 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.0}
-\cgalPkgDependsOn{\ref PkgCombinatorialMapsSummary}
+\cgalPkgDependsOn{\ref PkgCombinatorialMaps}
-\cgalPkgDependsOn{\ref PkgGeneralizedMapsSummary}
+\cgalPkgDependsOn{\ref PkgGeneralizedMaps}
 \cgalPkgBib{cgal:d-lcc-12}
 \cgalPkgLicense{\ref licensesLGPL "LGPL"}
 \cgalPkgDemo{3D Linear Cell Complex,linear_cell_complex_3.zip}

Matrix_search/doc/Matrix_search/PackageDescription.txt

@@ -6,7 +6,7 @@
 /*!
 \addtogroup PkgMatrixSearchRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Monotone and Sorted Matrix Search,PkgMatrixSearchSummary}
+\cgalPkgDescriptionBegin{Monotone and Sorted Matrix Search,PkgMatrixSearch}
 \cgalPkgPicture{matrix.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Michael Hoffmann}

Mesh_2/doc/Mesh_2/PackageDescription.txt

@@ -13,7 +13,7 @@
 
 /*!
 \addtogroup PkgMesh2Ref
-\cgalPkgDescriptionBegin{2D Conforming Triangulations and Meshes,PkgMesh2Summary}
+\cgalPkgDescriptionBegin{2D Conforming Triangulations and Meshes,PkgMesh2}
 \cgalPkgPicture{Mesh_2/fig/delaunaymesh-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Laurent Rineau}
@@ -27,7 +27,7 @@ The package can handle intersecting input constraints  and set no restriction on
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.1}
-\cgalPkgDependsOn{\ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation2}
 \cgalPkgBib{cgal:r-ctm2}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{2D Mesh Generator,constrained_delaunay_triangulation_2.zip}

Mesh_3/doc/Mesh_3/PackageDescription.txt

@@ -34,7 +34,7 @@
 /*!
 \addtogroup PkgMesh_3Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{3D Mesh Generation,PkgMesh_3Summary}
+\cgalPkgDescriptionBegin{3D Mesh Generation,PkgMesh_3}
 \cgalPkgPicture{Mesh_3/fig/multilabel_mesher_small.jpg}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pierre Alliez, Clément Jamin, Laurent Rineau, Stéphane Tayeb, Jane Tournois, Mariette Yvinec}
@@ -43,7 +43,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.5}
-\cgalPkgDependsOn{\ref PkgTriangulation3Summary and \ref thirdpartyEigen}
+\cgalPkgDependsOn{\ref PkgTriangulation3 and \ref thirdpartyEigen}
 \cgalPkgBib{cgal:rty-m3}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt

@@ -5,7 +5,7 @@
 
 /*!
 \addtogroup PkgMinkowskiSum2Ref
-\cgalPkgDescriptionBegin{2D Minkowski Sums,PkgMinkowskiSum2Summary}
+\cgalPkgDescriptionBegin{2D Minkowski Sums,PkgMinkowskiSum2}
 \cgalPkgPicture{Minkowski_sum_2/fig/Minkowski_sum_2.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Ron Wein, Alon Baram, Eyal Flato, Efi Fogel, Michael Hemmer, Sebastian Morr}
@@ -14,7 +14,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.3}
-\cgalPkgDependsOn{\ref PkgArrangement2Summary, \ref PkgAABB_treeSummary, \ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgArrangement2, \ref PkgAABB_tree, \ref PkgTriangulation2}
 \cgalPkgBib{cgal:w-rms2}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgShortInfoEnd

Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt

@@ -3,7 +3,7 @@
 /*!
 \addtogroup PkgMinkowskiSum3Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{3D Minkowski Sum of Polyhedra,PkgMinkowskiSum3Summary}
+\cgalPkgDescriptionBegin{3D Minkowski Sum of Polyhedra,PkgMinkowskiSum3}
 \cgalPkgPicture{Minkowski_sum_3/fig/Minkowski_sum_3_teaser.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Peter Hachenberger}
@@ -12,7 +12,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.5}
-\cgalPkgDependsOn{\ref PkgNef3Summary\, \ref PkgConvexDecomposition3Summary}
+\cgalPkgDependsOn{\ref PkgNef3\, \ref PkgConvexDecomposition3}
 \cgalPkgBib{cgal:h-msp3}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Miscellany/doc/Miscellany/PackageDescription.txt

@@ -3,7 +3,7 @@
 /// \ingroup PkgProfilingToolsRef
 /*!
 \addtogroup PkgProfilingToolsRef
-\cgalPkgDescriptionBegin{Profiling tools\, Hash Map\, Union-find\, Modifiers,PkgProfilingToolsSummary}
+\cgalPkgDescriptionBegin{Profiling tools\, Hash Map\, Union-find\, Modifiers,PkgProfilingTools}
 \cgalPkgPicture{stopwatch.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Lutz Kettner, Sylvain Pion, and Michael Seel}

Modular_arithmetic/doc/Modular_arithmetic/PackageDescription.txt

@@ -3,7 +3,7 @@
 /// \ingroup PkgModularArithmeticRef
 /*!
 \addtogroup PkgModularArithmeticRef
-\cgalPkgDescriptionBegin{Modular Arithmetic,PkgModularArithmeticSummary}
+\cgalPkgDescriptionBegin{Modular Arithmetic,PkgModularArithmetic}
 \cgalPkgPicture{Modular_arithmetic.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Michael Hemmer and Sylvain Pion}

Nef_2/doc/Nef_2/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgNef2Ref
 
-\cgalPkgDescriptionBegin{2D Boolean Operations on Nef Polygons,PkgNef2Summary}
+\cgalPkgDescriptionBegin{2D Boolean Operations on Nef Polygons,PkgNef2}
 \cgalPkgPicture{complex-teaser.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Michael Seel}

Nef_3/doc/Nef_3/PackageDescription.txt

@@ -7,7 +7,7 @@
 /*!
 \addtogroup PkgNef3Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{3D Boolean Operations on Nef Polyhedra,PkgNef3Summary}
+\cgalPkgDescriptionBegin{3D Boolean Operations on Nef Polyhedra,PkgNef3}
 \cgalPkgPicture{Nef_3-teaser.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Peter Hachenberger and Lutz Kettner}
@@ -16,7 +16,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.1}
-\cgalPkgDependsOn{\ref PkgNef2Summary\, \ref PkgNefS2Summary}
+\cgalPkgDependsOn{\ref PkgNef2\, \ref PkgNefS2}
 \cgalPkgBib{cgal:hk-bonp3}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Nef_S2/doc/Nef_S2/PackageDescription.txt

@@ -2,7 +2,7 @@
 /*!
 \addtogroup PkgNefS2Ref
 
-\cgalPkgDescriptionBegin{2D Boolean Operations on Nef Polygons Embedded on the Sphere,PkgNefS2Summary}
+\cgalPkgDescriptionBegin{2D Boolean Operations on Nef Polygons Embedded on the Sphere,PkgNefS2}
 \cgalPkgPicture{Nef_S2-teaser-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Peter Hachenberger and Lutz Kettner}
@@ -11,7 +11,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.1}
-\cgalPkgDependsOn{\ref PkgNef2Summary}
+\cgalPkgDependsOn{\ref PkgNef2}
 \cgalPkgBib{cgal:hk-bonpes2}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgShortInfoEnd

Number_types/doc/Number_types/PackageDescription.txt

@@ -34,7 +34,7 @@
 /*!
 \addtogroup PkgNumberTypesRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Number Types,PkgNumberTypesSummary}
+\cgalPkgDescriptionBegin{Number Types,PkgNumberTypes}
 \cgalPkgPicture{illustration.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Michael Hemmer, Susan Hert, Sylvain Pion, and Stefan Schirra}

Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/PackageDescription.txt

@@ -9,7 +9,7 @@
 
 /*!
 \addtogroup PkgOptimalTransportationReconstruction2Ref
-\cgalPkgDescriptionBegin{Optimal Transportation Curve Reconstruction, PkgOptimalTransportationReconstruction2Summary}
+\cgalPkgDescriptionBegin{Optimal Transportation Curve Reconstruction, PkgOptimalTransportationReconstruction2}
 \cgalPkgPicture{RS_2_small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Pierre Alliez, David Cohen-Steiner, Fernando de Goes, Clément Jamin, Ivo Vigan}
@@ -18,7 +18,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.8}
-\cgalPkgDependsOn{\ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation2}
 \cgalPkgBib{cgal:gavj-rs}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{2D Optimal Transportation Curve Reconstruction,otr2.zip}

Partition_2/doc/Partition_2/PackageDescription.txt

@@ -8,7 +8,7 @@
 /*!
 \addtogroup PkgPolygonPartitioning2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Polygon Partitioning,PkgPolygonPartitioning2Summary}
+\cgalPkgDescriptionBegin{2D Polygon Partitioning,PkgPolygonPartitioning2}
 \cgalPkgPicture{Partition_2/fig/Partition_2-teaser-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Susan Hert}

Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt

@@ -18,7 +18,7 @@
 /*!
 \addtogroup PkgPeriodic2Triangulation2Ref
  
-\cgalPkgDescriptionBegin{2D Periodic Triangulations,PkgPeriodic2Triangulation2Summary}
+\cgalPkgDescriptionBegin{2D Periodic Triangulations,PkgPeriodic2Triangulation2}
 \cgalPkgPicture{Periodic_2_triangulation_2/fig/p2Delaunay2_thumb.png}
  
 \cgalPkgSummaryBegin
@@ -29,7 +29,7 @@
  
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.3}
-\cgalPkgDependsOn{\ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation2}
 \cgalPkgBib{cgal:k-pt2-13}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Periodic Delaunay Triangulation,Periodic_2_Delaunay_triangulation_2.zip}

Periodic_3_mesh_3/doc/Periodic_3_mesh_3/PackageDescription.txt

@@ -24,19 +24,19 @@
 
 /*!
 \addtogroup PkgPeriodic_3_mesh_3Ref
-\cgalPkgDescriptionBegin{3D Periodic Mesh Generation,PkgPeriodic_3_mesh_3Summary}
+\cgalPkgDescriptionBegin{3D Periodic Mesh Generation,PkgPeriodic_3_mesh_3}
 \cgalPkgPicture{periodic_mesher_small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Mikhail Bogdanov, Aymeric Pellé, Mael Rouxel-Labbé, and Monique Teillaud}
 \cgalPkgDesc{This package is devoted to the generation of isotropic simplicial meshes
 discretizing periodic 3D domains. The domain to be meshed is a region of
 the three-dimensional flat torus. The periodic mesh generator provides users with the same
-flexibility that is offered in the \ref PkgMesh_3Summary package.}
+flexibility that is offered in the \ref PkgMesh_3 package.}
 \cgalPkgManuals{Chapter_3D_Periodic_Mesh_Generation,PkgPeriodic_3_mesh_3Ref}
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.13}
-\cgalPkgDependsOn{\ref PkgPeriodic3Triangulation3Summary, \ref PkgMesh_3Summary, and \ref thirdpartyEigen}
+\cgalPkgDependsOn{\ref PkgPeriodic3Triangulation3, \ref PkgMesh_3, and \ref thirdpartyEigen}
 \cgalPkgBib{cgal:btprl-p3m3}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgShortInfoEnd
@@ -49,14 +49,14 @@ manipulating duplicate points, well-chosen "dummy" points are inserted
 at the beginning of the meshing process, thus ensuring that the underlying periodic
 triangulation forms at all times a simplicial complex within a single copy of the periodic space \f$ \mathbb T_c^3\f$
 (see Sections \ref P3Triangulation3secspace and \ref P3Triangulation3secintro
-of the package \ref PkgPeriodic3Triangulation3Summary).
+of the package \ref PkgPeriodic3Triangulation3).
 By identifying a single copy of the flat torus \f$ \mathbb T_c^3\f$ (where `c`
 denotes the period) with a cube of side `c` in \f$ \mathbb R^3\f$, the meshing process
 can be exclusively conducted within a cube of side `c`.
-The mesh within a single copy is created using %CGAL's \ref PkgMesh_3Summary package, but
+The mesh within a single copy is created using %CGAL's \ref PkgMesh_3 package, but
-because %CGAL's \ref PkgMesh_3Summary package aims to mesh traditional (non-periodic)
+because %CGAL's \ref PkgMesh_3 package aims to mesh traditional (non-periodic)
-domains, an interface is necessary between %CGAL's \ref PkgMesh_3Summary package
+domains, an interface is necessary between %CGAL's \ref PkgMesh_3 package
-and %CGAL's \ref PkgPeriodic3Triangulation3Summary.
+and %CGAL's \ref PkgPeriodic3Triangulation3.
 This package offers these interfaces.
 
 \cgalClassifedRefPages
@@ -64,9 +64,9 @@ This package offers these interfaces.
 ## Concepts ##
 
 This package relies entirely on the \ref PkgMesh_3Concepts
-and the \ref PkgMesh_3SecondaryConcepts described in the \ref PkgMesh_3Summary package.
+and the \ref PkgMesh_3SecondaryConcepts described in the \ref PkgMesh_3 package.
 The following concepts are essentially identical to the concepts `MeshDomain_3`
-and `MeshDomainWithFeatures_3` in the package \ref PkgMesh_3Summary :
+and `MeshDomainWithFeatures_3` in the package \ref PkgMesh_3 :
 
 - `Periodic_3MeshDomain_3`
 - `Periodic_3MeshDomainWithFeatures_3`
@@ -97,7 +97,7 @@ The following functions handle the generation of a periodic mesh:
 ## Classes and Functions of `Mesh_3` ##
 
 Many classes and functions used by this package are defined within the package
-\ref PkgMesh_3Summary, see \ref PkgMesh_3MeshClasses, \ref PkgMesh_3Domains,
+\ref PkgMesh_3, see \ref PkgMesh_3MeshClasses, \ref PkgMesh_3Domains,
 and \ref PkgMesh_3Parameters.
 
 ## Input/Output Functions ##

Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Periodic_3_mesh_3.txt

@@ -20,7 +20,7 @@ A cut view of a periodic mesh.
 This package is devoted to the generation of isotropic simplicial
 meshes discretizing periodic 3D domains.
 The domain to be meshed is a subset of the three-dimensional flat torus
-(see Section \ref P3Triangulation3secspace of the package \ref PkgPeriodic3Triangulation3Summary).
+(see Section \ref P3Triangulation3secspace of the package \ref PkgPeriodic3Triangulation3).
 The domain may be connected or composed of multiple components
 and/or subdivided in several subdomains.
 The current implementation provides classes to represent
@@ -60,24 +60,24 @@ by a mesh optimization phase to remove slivers and provide a good quality mesh.
 
 \subsection Periodic_3_mesh_3Mesh_3 Relation to the 3D Mesh Generation and 3D Periodic Triangulations Packages
 
-This package is fundamentally linked to the package \ref PkgMesh_3Summary,
+This package is fundamentally linked to the package \ref PkgMesh_3,
 which is devoted to the generation of isotropic simplicial
-meshes discretizing (non-periodic) 3D domains and to the \ref PkgPeriodic3Triangulation3Summary of %CGAL,
+meshes discretizing (non-periodic) 3D domains and to the \ref PkgPeriodic3Triangulation3 of %CGAL,
 which are used as underlying triangulation structures of the mesh.
 
 A periodic mesh extends, by definition, infinitely in space. We consider the flat torus \f$ \mathbb T_c^3\f$,
 whose <I>canonical cube</I> has side length `c` (this canonical cube is named <I>original domain</I>
-in Chapter \ref PkgPeriodic3Triangulation3Summary; we rename it here to avoid the confusion
+in Chapter \ref PkgPeriodic3Triangulation3; we rename it here to avoid the confusion
-with the domain defined in Chapter \ref PkgMesh_3Summary). Well-chosen "dummy" points
+with the domain defined in Chapter \ref PkgMesh_3). Well-chosen "dummy" points
 are inserted at the beginning of the meshing process, ensuring that the projection
 of the periodic triangulation into the flat torus \f$ \mathbb T_c^3\f$ forms at all times a simplicial complex
 (see Sections \ref P3Triangulation3secspace and \ref P3Triangulation3secintro
 of the manual of 3D periodic triangulations).
 Thanks to this construction, the meshing process can be exclusively conducted
 within the canonical cube.
-The mesh can then be created using the \ref PkgMesh_3Summary package of %CGAL.
+The mesh can then be created using the \ref PkgMesh_3 package of %CGAL.
 As this package originally aims to mesh non-periodic domains of \f$ \mathbb R^3\f$, an interface
-is necessary between the packages \ref PkgMesh_3Summary and \ref PkgPeriodic3Triangulation3Summary.
+is necessary between the packages \ref PkgMesh_3 and \ref PkgPeriodic3Triangulation3.
 This package provides this interface.
 
 \subsection Periodic_3_mesh_3InputDomain Input Domain
@@ -227,7 +227,7 @@ and to guarantee that the refinement process terminates
 whatever may be the dihedral angles formed by input surface patches incident to a
 given 1-feature or the angles formed by two 1-features incident to a 0-feature.
 See Section \ref Mesh_3Protectionof0and1dimensionalExposed in the documentation
-of the package \ref PkgMesh_3Summary for further information.
+of the package \ref PkgMesh_3 for further information.
 
 Section \ref Periodic_3_mesh_3MeshingDomainswithSharpFeatures details how
 to prescribe sharp features and examples of periodic meshes with features.
@@ -236,7 +236,7 @@ to prescribe sharp features and examples of periodic meshes with features.
 
 The optimization phase is a succession of optimization processes which aim to
 improve the quality of the mesh in terms of shape of its elements.
-All the optimizers offered by the package \ref PkgMesh_3Summary are also available
+All the optimizers offered by the package \ref PkgMesh_3 are also available
 for periodic mesh generation:
 
 - The Lloyd and ODT-smoother are global optimizers, moving the mesh vertices
@@ -245,7 +245,7 @@ to minimize a mesh energy.
 the worst mesh elements.
 
 See Sections \ref Mesh_3OptimizationPhase, \ref Mesh_3TheOptimizationParameters,
-and \ref Mesh_3TuningMeshOptimization in the documentation of the package \ref PkgMesh_3Summary
+and \ref Mesh_3TuningMeshOptimization in the documentation of the package \ref PkgMesh_3
 for further information.
 
 \section Periodic_3_mesh_3_section_interface Interface
@@ -416,7 +416,7 @@ This section presents various use cases of the periodic mesh generator.
 \subsection Periodic_3_mesh_3SubMultipleCopies Visualizing Multiple Copies of a Periodic Mesh
 
 Generated meshes can be output to the `.mesh` file format, which can be visualized with the demo
-of the package \ref PkgPolyhedronSummary. The function \link PkgPeriodic_3_mesh_3IOFunctions `CGAL::output_periodic_mesh_to_medit()` \endlink
+of the package \ref PkgPolyhedron. The function \link PkgPeriodic_3_mesh_3IOFunctions `CGAL::output_periodic_mesh_to_medit()` \endlink
 takes a stream, a mesh complex, and - optionally - the number of periodic copies that should be drawn,
 making it easier to observe the periodicity of the result.
 \cgalFigureRef{Periodic_3_mesh_3Periodic_copies} illustrates the different output
@@ -674,16 +674,16 @@ A periodic mesh without (left) and with (right) sharp features protection.
 
 Advanced use cases of the 3D mesh generator with implicit domains, its optimizers,
 and protection mechanisms can be found in Section \ref Mesh_3_section_examples
-of the package \ref PkgMesh_3Summary.
+of the package \ref PkgMesh_3.
 
 \section Periodic_3_mesh_3DesignAndImpl Design and Implementation History
 
 \subsection Periodic_3_mesh_3TheoreticalFoundations Theoretical Foundations
 
 Theoretical foundations of periodic meshes are explained in detail in the package
-\ref PkgPeriodic3Triangulation3Summary.
+\ref PkgPeriodic3Triangulation3.
 For the theoretical foundations of the mesh generation process, see Section
-\ref Mesh_3TheoreticalFoundations of the package \ref PkgMesh_3Summary.
+\ref Mesh_3TheoreticalFoundations of the package \ref PkgMesh_3.
 
 \subsection Periodic_3_mesh_3ImplementationHistory Implementation History
 

Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt

@@ -12,7 +12,7 @@
 /*!
 \addtogroup PkgPeriodic3Triangulation3Ref
 
-\cgalPkgDescriptionBegin{3D Periodic Triangulations,PkgPeriodic3Triangulation3Summary}
+\cgalPkgDescriptionBegin{3D Periodic Triangulations,PkgPeriodic3Triangulation3}
 \cgalPkgPicture{p3Delaunay3_small.jpg}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Manuel Caroli, Aymeric Pellé, Mael Rouxel-Labbé, and Monique Teillaud}
@@ -25,7 +25,7 @@ nearest neighbor queries and primitives to build the dual Voronoi diagrams.}
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.5}
-\cgalPkgDependsOn{\ref PkgTDS3Summary}
+\cgalPkgDependsOn{\ref PkgTDS3}
 \cgalPkgBib{cgal:ct-pt3}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{3D Periodic Delaunay Triangulation,periodic_3_triangulation_3.zip,3D Periodic Lloyd,periodic_3_lloyd.zip}

Point_set_2/doc/Point_set_2/PackageDescription.txt

@@ -11,7 +11,7 @@
 /*!
 \addtogroup PkgPointSet2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Range and Neighbor Search,PkgPointSet2Summary}
+\cgalPkgDescriptionBegin{2D Range and Neighbor Search,PkgPointSet2}
 \cgalPkgPicture{Point_set_2/fig/point_set.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Matthias Bäsken}
@@ -20,7 +20,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{2.1}
-\cgalPkgDependsOn{\ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation2}
 \cgalPkgBib{cgal:b-ss2}
 \cgalPkgLicense{\ref licensesGPL  "GPL"}
 \cgalPkgShortInfoEnd

Point_set_3/doc/Point_set_3/PackageDescription.txt

@@ -1,7 +1,7 @@
 /*!
 \defgroup PkgPointSet3Ref 3D Point Set Reference
 
-\cgalPkgDescriptionBegin{3D Point Set, PkgPointSet3Summary}
+\cgalPkgDescriptionBegin{3D Point Set, PkgPointSet3}
 \cgalPkgPicture{point_set_3.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Simon Giraudot}
@@ -25,7 +25,7 @@
 \ingroup PkgPointSet3Ref
 
 \brief This module offers convenience overloads of input/ouput
-functions available in the \ref PkgPointSetProcessingSummary package.
+functions available in the \ref PkgPointSetProcessing package.
 These overloads, available after including `CGAL/Point_set_3/IO.h`,
 allow the user to call point set processing algorithms without having
 to handle manually property maps and iterators.

Point_set_processing_3/doc/Point_set_processing_3/PackageDescription.txt

@@ -27,7 +27,7 @@ Read and write points (with or without additional properties) in LAS
 format.
 
 \addtogroup PkgPointSetProcessingRef
-\cgalPkgDescriptionBegin{Point Set Processing,PkgPointSetProcessingSummary}
+\cgalPkgDescriptionBegin{Point Set Processing,PkgPointSetProcessing}
 \cgalPkgPicture{point_set_processing_detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pierre Alliez, Simon Giraudot, Clément Jamin, Florent Lafarge, Quentin Mérigot, Jocelyn Meyron, Laurent Saboret, Nader Salman, Shihao Wu}
@@ -36,7 +36,7 @@ format.
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.5}
-\cgalPkgDependsOn{\ref PkgSolverSummary} 
+\cgalPkgDependsOn{\ref PkgSolver} 
 \cgalPkgBib{cgal:ass-psp}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt

@@ -80,7 +80,7 @@ as, e.g., a class derived from the \cgal 3D point, or as a
 `std::pair<Point_3<K>, Vector_3<K>>`, or as a
 `boost::tuple<..,Point_3<K>, ..., Vector_3<K> >`.
 
-The following classes described in Chapter \ref PkgProperty_mapSummary
+The following classes described in Chapter \ref PkgProperty_map
 provide property maps for the implementations of points with normals
 listed above:
 
@@ -584,7 +584,7 @@ points that are on sharp edges:
 The function `structure_point_set()` generates a structured version of
 the input point set assigned to a set of planes. Such an input can be
 produced by a shape detection algorithm (see \ref
-PkgPointSetShapeDetection3Summary). Point set structuring is based on
+PkgPointSetShapeDetection3). Point set structuring is based on
 the article \cgalCite{cgal:la-srpss-13}.
 
 - __Planes__: inliers of each detected plane are replaced by sets of

Point_set_shape_detection_3/doc/Point_set_shape_detection_3/PackageDescription.txt

@@ -11,7 +11,7 @@
 
 \addtogroup PkgPointSetShapeDetection3Ref
 
-\cgalPkgDescriptionBegin{Point Set Shape Detection, PkgPointSetShapeDetection3Summary}
+\cgalPkgDescriptionBegin{Point Set Shape Detection, PkgPointSetShapeDetection3}
 \cgalPkgPicture{shapes_detail.png}
 
 \cgalPkgSummaryBegin

Poisson_surface_reconstruction_3/doc/Poisson_surface_reconstruction_3/PackageDescription.txt

@@ -1,7 +1,7 @@
 /// \defgroup PkgPoissonSurfaceReconstructionRef Poisson Surface Reconstruction Reference
 /*!
 \addtogroup PkgPoissonSurfaceReconstructionRef
-\cgalPkgDescriptionBegin{Poisson Surface Reconstruction,PkgPoissonSurfaceReconstructionSummary}
+\cgalPkgDescriptionBegin{Poisson Surface Reconstruction,PkgPoissonSurfaceReconstruction}
 \cgalPkgPicture{surface_reconstruction_points_detail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pierre Alliez, Laurent Saboret, Gaël Guennebaud}
@@ -10,7 +10,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.5}
-\cgalPkgDependsOn{\ref PkgSolverSummary} 
+\cgalPkgDependsOn{\ref PkgSolver} 
 \cgalPkgBib{cgal:asg-srps}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Polygon/doc/Polygon/PackageDescription.txt

@@ -9,7 +9,7 @@
 /*!
 \addtogroup PkgPolygon2Ref
 
-\cgalPkgDescriptionBegin{2D Polygons,PkgPolygon2Summary}
+\cgalPkgDescriptionBegin{2D Polygons,PkgPolygon2}
 \cgalPkgPicture{polygon.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Geert-Jan Giezeman and Wieger Wesselink}

Polygon_mesh_processing/doc/Polygon_mesh_processing/NamedParameters.txt

@@ -19,7 +19,7 @@ the type is more specific:
      predicates evaluated. Everywhere in this package, a \cgal `Kernel` fulfills the requirements.</li>
 </ul>
 
-The following named parameters, offered by the package \ref PkgBGLSummary
+The following named parameters, offered by the package \ref PkgBGL
 (see \ref bgl_namedparameters), are used in this package:
 
 \cgalNPTableBegin

Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt

@@ -61,7 +61,7 @@
 /*!
 \addtogroup PkgPolygonMeshProcessingRef
  
-\cgalPkgDescriptionBegin{Polygon Mesh Processing, PkgPolygonMeshProcessingSummary}
+\cgalPkgDescriptionBegin{Polygon Mesh Processing, PkgPolygonMeshProcessing}
 \cgalPkgPicture{hole_filling_ico.png}
  
 \cgalPkgSummaryBegin
@@ -74,7 +74,7 @@ ranging from basic operations on simplices, to complex geometry processing algor
  
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.7}
-\cgalPkgDependsOn{documented for each function; \ref PkgSolverSummary}
+\cgalPkgDependsOn{documented for each function; \ref PkgSolver}
 \cgalPkgBib{cgal:lty-pmp}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt

@@ -27,7 +27,7 @@ A polygon mesh can have any number of connected components, and also some self-i
 In this package, a polygon mesh is considered to have the topology of a 2-manifold.
 
 \subsection PMPAPI API
-This package follows the BGL API described in \ref PkgBGLSummary.
+This package follows the BGL API described in \ref PkgBGL.
 It can thus be used either with `Polyhedron_3`, `Surface_mesh`, or
 any class model of the concept `FaceGraph`. Each function or class of this package
 details the requirements on the input polygon mesh.
@@ -229,7 +229,7 @@ centered in the output volume is a topological ball. At the surface level this m
 that no non-manifold vertex or edge is allowed in the output. For example, it
 is not possible to compute the union of two cubes that are disjoint but sharing an edge.
 In case you have to deal with such scenarios, you should consider using the
-package \ref PkgNef3Summary.
+package \ref PkgNef3.
 
 It is possible to update the input so that it contains the result (in-place operation).
 In that case the whole mesh will not be copied and only the region around the
@@ -710,7 +710,7 @@ In the following example, a mesh is isotropically remeshed and the approximate d
 \subsection PoissonDistanceExample Max Distance Between Point Set and Surface Example
 In \ref Poisson_surface_reconstruction_3/poisson_reconstruction_example.cpp,
 a triangulated surface mesh is constructed from a point set using the
-\link PkgPoissonSurfaceReconstructionSummary Poisson reconstruction algorithm \endlink,
+\link PkgPoissonSurfaceReconstruction Poisson reconstruction algorithm \endlink,
 and the distance between the point set and the reconstructed surface is computed
 with the following code:
 

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h

@@ -359,7 +359,7 @@ struct Throw_at_first_output {
 // Note this is not officially documented
 /*
  * reports all the pairs of faces intersecting between two triangulated surface meshes.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \pre `CGAL::is_triangle_mesh(tm1)`
  * \pre `CGAL::is_triangle_mesh(tm2)`
@@ -478,7 +478,7 @@ compute_face_face_intersection(const FaceRange& face_range1,
  * a triangulated surface mesh and a polyline.
  * \attention If a polyline vertex intersects a face, the intersection will
  * be reported twice (even more if it is on a vertex, edge, or point).
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \pre `CGAL::is_triangle_mesh(tm)`
  *
@@ -603,7 +603,7 @@ compute_face_polyline_intersection( const FaceRange& face_range,
  * a triangulated surface mesh and a range of polylines.
  * \attention If a polyline vertex intersects a face, the intersection will
  * be reported twice (even more if it is on a vertex, edge, or point).
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \pre `CGAL::is_triangle_mesh(tm)`
  *
@@ -732,7 +732,7 @@ compute_face_polylines_intersection(const FaceRange& face_range,
 // Note this is not officially documented
 /*
  * detects and records intersections between two polylines.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  * \attention If a polyline vertex intersects another polyline, the intersection will
  * be reported twice (even more if it is on a vertex).
  * \tparam Polyline a `RandomAccessRange` of points.
@@ -815,7 +815,7 @@ compute_polyline_polyline_intersection(const Polyline& polyline1,
  * detects and records intersections between two ranges of polylines.
  *  \attention If a polyline vertex intersects another polyline, the intersection will
  * be reported twice (even more if it is on a vertex).
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \tparam PolylineRange a `RandomAccessRange` of `RandomAccessRange` of points.
  * \tparam OutputIterator a model of `OutputIterator` holding objects of type
@@ -915,7 +915,7 @@ compute_polylines_polylines_intersection(const PolylineRange& polylines1,
 // Note this is not officially documented
 /*
  * reports all the pairs of faces intersecting between two triangulated surface meshes.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * @pre `CGAL::is_triangle_mesh(tm1)`
  * @pre `CGAL::is_triangle_mesh(tm2)`
@@ -960,7 +960,7 @@ compute_face_face_intersection(const TriangleMesh& tm1,
  * and a polyline.
  *  \attention If a polyline vertex intersects a face or another polyline, the intersection will
  * be reported twice (even more if it is on a vertex, edge, or point).
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \pre `CGAL::is_triangle_mesh(tm)`
  *
@@ -1081,7 +1081,7 @@ bool is_mesh2_in_mesh1(const TriangleMesh& tm1,
  * \ingroup PMP_predicates_grp
  * returns `true` if any segment of any polyline of `polylines1` intersects
  * any segment of any polyline of `polylines2`, and `false` otherwise.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \tparam PolylineRange a `RandomAccessRange` of `RandomAccessRange` of points.
  *         The point type must be from a 3D point from a \cgal Kernel.
@@ -1123,7 +1123,7 @@ bool do_intersect(const PolylineRange& polylines1,
 /**
  * \ingroup PMP_predicates_grp
  * returns `true` if any segment of `polyline1` intersects any segment of `polyline2`, and `false` otherwise.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \tparam Polyline a `RandomAccessRange` of points.
  *         The point type must be from a 3D point type from \cgal Kernel.
@@ -1169,7 +1169,7 @@ bool do_intersect(const Polyline& polyline1,
  * \ingroup PMP_predicates_grp
  * returns `true` if any face of `tm1` intersects any face of `tm2`, and `false` otherwise.
  * If `do_overlap_test_of_bounded_sides` is set to `true`, the overlap of bounded sides are tested as well. In that case, the meshes must be closed.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * @pre `CGAL::is_triangle_mesh(tm1)`
  * @pre `CGAL::is_triangle_mesh(tm2)`
@@ -1257,7 +1257,7 @@ bool do_intersect(const TriangleMesh& tm1,
 /**
  * \ingroup PMP_predicates_grp
  * returns `true` if any face of `tm` and any segment of any polyline of `polylines` intersects, and `false` otherwise.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  * @pre `CGAL::is_triangle_mesh(tm)`
  *
  * \tparam TriangleMesh a model of `FaceListGraph`
@@ -1313,7 +1313,7 @@ bool do_intersect(const TriangleMesh& tm,
 /**
  * \ingroup PMP_predicates_grp
  * returns `true` if any face of `tm` and any segment of `polyline` intersects, and `false` otherwise.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  * @pre `CGAL::is_triangle_mesh(tm)`
  *
  * \tparam TriangleMesh a model of `FaceListGraph`
@@ -1529,7 +1529,7 @@ struct Mesh_callback
  * A pair of meshes intersecting is put in the output iterator `out` as a `std::pair<std::size_t, std::size_t>`,
  * each index refering to the index of the triangle mesh in the input range.
  * If `do_overlap_test_of_bounded_sides` is `true`, the overlap of bounded sides are tested as well. In that case, the meshes must be closed.
- * This function depends on the package \ref PkgBoxIntersectionDSummary.
+ * This function depends on the package \ref PkgBoxIntersectionD.
  *
  * \tparam TriangleMeshRange a model of `RandomAccessRange` of triangulated surface meshes model of `FaceListGraph`.
  * \tparam OutputIterator an output iterator in which `std::pair<std::size_t, std::size_t>` can be put.

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/self_intersections.h

@@ -235,7 +235,7 @@ self_intersections( const FaceRange& face_range,
 /**
  * \ingroup PMP_intersection_grp
  * detects and records self-intersections of a triangulated surface mesh.
- * This function depends on the package \ref PkgBoxIntersectionDSummary
+ * This function depends on the package \ref PkgBoxIntersectionD
  * @pre `CGAL::is_triangle_mesh(tmesh)`
  *
  * @tparam TriangleMesh a model of `FaceListGraph`
@@ -391,7 +391,7 @@ OutputIterator self_intersections(const FaceRange& face_range,
 /**
  * \ingroup PMP_intersection_grp
  * tests if a triangulated surface mesh self-intersects.
- * This function depends on the package \ref PkgBoxIntersectionDSummary
+ * This function depends on the package \ref PkgBoxIntersectionD
  * @pre `CGAL::is_triangle_mesh(tmesh)`
  *
  * @tparam TriangleMesh a model of `FaceListGraph`
@@ -431,7 +431,7 @@ bool does_self_intersect(const TriangleMesh& tmesh
 /**
  * \ingroup PMP_intersection_grp
  * tests if a set of faces of a triangulated surface mesh self-intersects.
- * This function depends on the package \ref PkgBoxIntersectionDSummary
+ * This function depends on the package \ref PkgBoxIntersectionD
  * @pre `CGAL::is_triangle_mesh(tmesh)`
  *
  * @tparam FaceRange a range of `face_descriptor`

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h

@@ -400,7 +400,7 @@ public:
 
 /**
 * \ingroup PMP_meshing_grp
-* triangulates a single face of a polygon mesh. This function depends on the package \ref PkgTriangulation2Summary
+* triangulates a single face of a polygon mesh. This function depends on the package \ref PkgTriangulation2
 * @tparam PolygonMesh a model of `FaceListGraph` and `MutableFaceGraph`
 * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
 *
@@ -449,7 +449,7 @@ bool triangulate_face(typename boost::graph_traits<PolygonMesh>::face_descriptor
 
 /**
 * \ingroup PMP_meshing_grp
-* triangulates given faces of a polygon mesh. This function depends on the package \ref PkgTriangulation2Summary
+* triangulates given faces of a polygon mesh. This function depends on the package \ref PkgTriangulation2
 *
 * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
           model of `Range`.
@@ -501,7 +501,7 @@ bool triangulate_faces(FaceRange face_range, PolygonMesh& pmesh)
 
 /**
 * \ingroup PMP_meshing_grp
-* triangulates all faces of a polygon mesh. This function depends on the package \ref PkgTriangulation2Summary
+* triangulates all faces of a polygon mesh. This function depends on the package \ref PkgTriangulation2
 * @tparam PolygonMesh a model of `FaceListGraph` and `MutableFaceGraph`
 * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
 *

Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h

@@ -63,7 +63,7 @@ namespace CGAL {
 ///         orthogonal to a frame axis, the non-null coefficient being 1 or -1.
 ///         The default is `true`.
 ///
-/// The implemenation of this class depends on the package \ref PkgAABB_treeSummary.
+/// The implemenation of this class depends on the package \ref PkgAABB_tree.
 /// \todo Shall we document more in details what is required?
 ///       `Traits` must provide:
 ///        - `Plane_3`

Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h

@@ -55,7 +55,7 @@ namespace CGAL {
  * will return in turns `CGAL::ON_BOUNDED_SIDE` and `CGAL::ON_UNBOUNDED_SIDE`,
  * following the aforementioned parity criterion.
  *
- * This class depends on the package \ref PkgAABB_treeSummary.
+ * This class depends on the package \ref PkgAABB_tree.
  *
  * @tparam TriangleMesh a triangulated surface mesh, model of `FaceListGraph`
  * @tparam GeomTraits a geometric traits class, model of `Kernel`

Polyhedron/doc/Polyhedron/PackageDescription.txt

@@ -16,7 +16,7 @@
 /*!
 \addtogroup PkgPolyhedronRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{3D Polyhedral Surface,PkgPolyhedronSummary}
+\cgalPkgDescriptionBegin{3D Polyhedral Surface,PkgPolyhedron}
 \cgalPkgPicture{Polyhedron-teaser-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Lutz Kettner}
@@ -25,7 +25,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{1.0}
-\cgalPkgDependsOn{\ref PkgHDSSummary}
+\cgalPkgDependsOn{\ref PkgHDS}
 \cgalPkgBib{cgal:k-ps}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}

Polyline_simplification_2/doc/Polyline_simplification_2/PackageDescription.txt

@@ -13,7 +13,7 @@
 
 /*!
 \addtogroup PkgPolylineSimplification2Ref
-\cgalPkgDescriptionBegin{2D Polyline Simplification,PkgPolylineSimplification2Summary}
+\cgalPkgDescriptionBegin{2D Polyline Simplification,PkgPolylineSimplification2}
 \cgalPkgPicture{PolylineSimplification-small.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Andreas Fabri}
@@ -22,7 +22,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.6}
-\cgalPkgDependsOn{\ref PkgTriangulation2Summary}
+\cgalPkgDependsOn{\ref PkgTriangulation2}
 \cgalPkgBib{cgal:f-ps2}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Polyline Simplification,polyline_simplification_2.zip}

Polyline_simplification_2/doc/Polyline_simplification_2/Polyline_simplification_2.txt

@@ -46,7 +46,7 @@ true, for instance, upon reaching a desired number of vertices or
 reaching a maximum simplification error.
 
 The polyline simplification algorithm operates on a triangulation
-class from Chapter \ref PkgTriangulation2Summary, namely
+class from Chapter \ref PkgTriangulation2, namely
 `Constrained_triangulation_plus_2`.  This data structure allows to
 remove vertices of a polyline constraint, while keeping the points of
 the removed vertices of the polyline constraint. The fact that it is a

Polynomial/doc/Polynomial/PackageDescription.txt

@@ -10,7 +10,7 @@
 /*!
 \addtogroup PkgPolynomialRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Polynomial,PkgPolynomialSummary}
+\cgalPkgDescriptionBegin{Polynomial,PkgPolynomial}
 \cgalPkgPicture{Polynomial.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Michael Hemmer}

Polytope_distance_d/doc/Polytope_distance_d/PackageDescription.txt

@@ -5,7 +5,7 @@
 /*!
 \addtogroup PkgOptimalDistancesRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Optimal Distances,PkgOptimalDistancesSummary}
+\cgalPkgDescriptionBegin{Optimal Distances,PkgOptimalDistances}
 \cgalPkgPicture{dist.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Kaspar Fischer, Bernd Gärtner, Thomas Herrmann, Michael Hoffmann, and Sven Schönherr}

Principal_component_analysis/doc/Principal_component_analysis/PackageDescription.txt

@@ -18,7 +18,7 @@
 /*!
 \addtogroup PkgPrincipalComponentAnalysisDRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Principal Component Analysis,PkgPrincipalComponentAnalysisDSummary}
+\cgalPkgDescriptionBegin{Principal Component Analysis,PkgPrincipalComponentAnalysisD}
 \cgalPkgPicture{teaserLeastSquaresFitting.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Pierre Alliez, Sylvain Pion and Ankit Gupta}
@@ -27,7 +27,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.2}
-\cgalPkgDependsOn{\ref PkgSolverSummary} 
+\cgalPkgDependsOn{\ref PkgSolver} 
 \cgalPkgBib{cgal:ap-pcad}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgDemo{Principal Component Analysis,pca.zip,Operations on Polygons,polygon.zip,Polyhedron demo,polyhedron_3.zip}

Property_map/doc/Property_map/PackageDescription.txt

@@ -3,7 +3,7 @@
 /*!
 \addtogroup PkgProperty_mapRef
 
-\cgalPkgDescriptionBegin{CGAL and Boost Property Maps,PkgProperty_mapSummary}
+\cgalPkgDescriptionBegin{CGAL and Boost Property Maps,PkgProperty_map}
 \cgalPkgPicture{property_map.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Andreas Fabri and Laurent Saboret}

QP_solver/doc/QP_solver/PackageDescription.txt

@@ -73,7 +73,7 @@ Programs can be written to an output stream in MPSFormat, using one of the follo
 /*!
 \addtogroup PkgQPSolverRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Linear and Quadratic Programming Solver,PkgQPSolverSummary}
+\cgalPkgDescriptionBegin{Linear and Quadratic Programming Solver,PkgQPSolver}
 \cgalPkgPicture{qp.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Kaspar Fischer, Bernd Gärtner, Sven Schönherr, and Frans Wessendorp}

Ridges_3/doc/Ridges_3/PackageDescription.txt

@@ -6,7 +6,7 @@
 /*!
 \addtogroup PkgRidges_3Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{Approximation of Ridges and Umbilics on Triangulated Surface Meshes,PkgRidges_3Summary}
+\cgalPkgDescriptionBegin{Approximation of Ridges and Umbilics on Triangulated Surface Meshes,PkgRidges_3}
 \cgalPkgPicture{RidgesMechPartDetail.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Marc Pouget and Frédéric Cazals}
@@ -15,7 +15,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.3}
-\cgalPkgDependsOn{\ref PkgSolverSummary} 
+\cgalPkgDependsOn{\ref PkgSolver} 
 \cgalPkgBib{cgal:cp-arutsm}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgShortInfoEnd

Ridges_3/doc/Ridges_3/Ridges_3.txt

@@ -26,7 +26,7 @@ analysis. Based on the results of the article
 different parts of this singular ridge curve as well as umbilics on a
 surface given as a triangulated surface mesh. Differential quantities
 associated to the mesh vertices are assumed to be given for these
-algorithms; such quantities may be computed by the package \ref PkgJet_fitting_3Summary.
+algorithms; such quantities may be computed by the package \ref PkgJet_fitting_3.
 
 
 Note that this package needs the third party library \ref thirdpartyEigen for linear algebra operations.
@@ -404,7 +404,7 @@ neighborhood.
 \subsection Ridges_3Exampleprogram Example Program
 
 The following program computes ridges and umbilics from an off
-file.\cgalFootnote{Model data may be downloaded via ftp://ftp.mpi-sb.mpg.de/pub/outgoing/CGAL/Ridges_3_datafiles.tgz . The mechanical part model has been provided courtesy of Dassault System to produce \cgalFigureRef{figmechanical_crest_filteredintro}, due to copyright issues the available model is not the same, it is provided by the AIM\@SHAPE Shape Repository.} It uses the package \ref PkgJet_fitting_3Summary to estimate the differential
+file.\cgalFootnote{Model data may be downloaded via ftp://ftp.mpi-sb.mpg.de/pub/outgoing/CGAL/Ridges_3_datafiles.tgz . The mechanical part model has been provided courtesy of Dassault System to produce \cgalFigureRef{figmechanical_crest_filteredintro}, due to copyright issues the available model is not the same, it is provided by the AIM\@SHAPE Shape Repository.} It uses the package \ref PkgJet_fitting_3 to estimate the differential
 quantities. 
 The default output file gives rough data for visualization purpose, a
 verbose output file may also be asked for. Parameters are

STL_Extension/doc/STL_Extension/PackageDescription.txt

@@ -12,7 +12,7 @@
 
 /*!
 \addtogroup PkgStlExtensionRef
-\cgalPkgDescriptionBegin{STL Extensions for CGAL,PkgStlExtensionSummary}
+\cgalPkgDescriptionBegin{STL Extensions for CGAL,PkgStlExtension}
 \cgalPkgPicture{plusplus.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Ron Wein}

Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/PackageDescription.txt

@@ -9,7 +9,7 @@
 
 /*!
 \addtogroup PkgScaleSpaceReconstruction3Ref
-\cgalPkgDescriptionBegin{Scale-Space Surface Reconstruction,PkgScaleSpaceReconstruction3Summary}
+\cgalPkgDescriptionBegin{Scale-Space Surface Reconstruction,PkgScaleSpaceReconstruction3}
 \cgalPkgPicture{knot_thumb.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthors{Thijs van Lankveld}
@@ -20,7 +20,7 @@
 \cgalPkgSince{4.6}
 \cgalPkgBib{cgal:ssr3}
 \cgalPkgLicense{\ref licensesGPL "GPL" }
-\cgalPkgDependsOn{\ref PkgAlphaShapes3Summary, \ref PkgSpatialSearchingDSummary, \ref PkgSolverSummary}
+\cgalPkgDependsOn{\ref PkgAlphaShapes3, \ref PkgSpatialSearchingD, \ref PkgSolver}
 \cgalPkgShortInfoEnd
 \cgalPkgDescriptionEnd
 

SearchStructures/doc/SearchStructures/PackageDescription.txt

@@ -11,7 +11,7 @@
 /*!
 \addtogroup PkgRangeSegmentTreesDRef
 \todo check generated documentation
-\cgalPkgDescriptionBegin{dD Range and Segment Trees,PkgRangeSegmentTreesDSummary}
+\cgalPkgDescriptionBegin{dD Range and Segment Trees,PkgRangeSegmentTreesD}
 \cgalPkgPicture{segment_tree.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Gabriele Neyer}

Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/PackageDescription.txt

@@ -4,7 +4,7 @@
 /*!
 \addtogroup PkgSegmentDelaunayGraph2Ref
 \todo check generated documentation
-\cgalPkgDescriptionBegin{2D Segment Delaunay Graphs,PkgSegmentDelaunayGraph2Summary}
+\cgalPkgDescriptionBegin{2D Segment Delaunay Graphs,PkgSegmentDelaunayGraph2}
 \cgalPkgPicture{svd.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Menelaos Karavelas}
@@ -13,7 +13,7 @@
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
 \cgalPkgSince{3.1}
-\cgalPkgDependsOn{\ref PkgTDS2Summary}
+\cgalPkgDependsOn{\ref PkgTDS2}
 \cgalPkgBib{cgal:k-sdg2}
 \cgalPkgLicense{\ref licensesGPL}
 \cgalPkgDemo{2D Segment Voronoi Diagram,segment_voronoi_diagram_2.zip}

Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/PackageDescription.txt

@@ -6,7 +6,7 @@
 \addtogroup PkgSDGLinfRef
 \todo check generated documentation
 
-\cgalPkgDescriptionBegin{L Infinity Segment Delaunay Graphs,PkgSDGLinfSummary}
+\cgalPkgDescriptionBegin{L Infinity Segment Delaunay Graphs,PkgSDGLinf}
 \cgalPkgPicture{sdglinf-small.png}
 
 \cgalPkgSummaryBegin
@@ -19,7 +19,7 @@ the Voronoi diagram of a set of points and segments under the
 
 \cgalPkgShortInfoBegin
 \cgalPkgSince{4.7}
-\cgalPkgDependsOn{\ref PkgSegmentDelaunayGraph2Summary}
+\cgalPkgDependsOn{\ref PkgSegmentDelaunayGraph2}
 \cgalPkgBib{cgal:cdp-sdglinf2}
 \cgalPkgLicense{\ref licensesGPL "GPL"}
 \cgalPkgShortInfoEnd