update links

Author: sloriot

Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt

@@ -81,7 +81,7 @@ compatibility all functionality is also
 accessible through global functions defined within namespace `CGAL`,
 e.g., \link sqrt `CGAL::sqrt(x)` \endlink. This is realized via function templates using
 the according functor of the traits class. For an overview see
-Section \ref PkgAlgebraicFoundationsRef in the reference manual.
+\ref PkgAlgebraicFoundationsRef.
 
 \subsection Algebraic_foundationsTagsinAlgebraicStructure Tags in Algebraic Structure Traits
 

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt

@@ -4196,7 +4196,7 @@ are both parameterized by a geometric kernel and model the concepts
 `AosTraits_2` and `AosLandmarkTraits_2`.
 \cgalFootnote{They also model the refined concept
 \cgalFootnoteCode{AosDirectionalXMonotoneTraits_2}, which enables Boolean set
-operations; see Package \ref PkgBooleanSetOperations2Ref.} The class
+operations; see Package \ref PkgBooleanSetOperations2.} The class
 template `Arr_non_caching_segment_traits_2<Kernel>` derives from the
 instance `Arr_non_caching_segment_basic_traits_2<Kernel>`, which
 models the `AosLandmarkTraits_2` traits concept but not the
@@ -4937,7 +4937,7 @@ template models the concepts `AosTraits_2` and
 `AosOpenBoundaryTraits_2`, but it does not model the
 `AosLandmarkTraits_2` concept. It also models the refined
 concept `AosDirectionalXMonotoneTraits_2`, which enables
-Boolean set operations; see Package \ref PkgBooleanSetOperations2Ref.
+Boolean set operations; see Package \ref PkgBooleanSetOperations2.
 Note that it is not a model of `AosLandmarkTraits_2` concept,
 so it is impossible to use the landmark point-location strategy with
 this traits class.
@@ -5167,7 +5167,7 @@ Every instance of the `Arr_Bezier_curve_traits_2` class templates
 models the concept `AosTraits_2` (but it does not model the
 `AosLandmarkTraits_2` concept). It also models the refined
 concept `AosDirectionalXMonotoneTraits_2`, which enables
-Boolean set operations; see Package \ref PkgBooleanSetOperations2Ref.
+Boolean set operations; see Package \ref PkgBooleanSetOperations2.
 
 <!-- ----------------------------------------------------------------------- -->
 \cgalFigureBegin{aos_fig-bezier_curves,bezier_curves.png}

BGL/doc/BGL/BGL.txt

@@ -698,7 +698,7 @@ using one of the following tags:
 - `CGAL::Alpha_expansion_boost_adjacency_list_tag` (default)
 - `CGAL::Alpha_expansion_boost_compressed_sparse_raw_tag`
 - `CGAL::Alpha_expansion_MaxFlow_tag`, released under GPL
-  license and provided by the \ref PkgSurfaceMeshSegmentationRef
+  license and provided by the \ref PkgSurfaceMeshSegmentation
   package
 
 All these implementations produce the exact same result but behave

BGL/include/CGAL/boost/graph/alpha_expansion_graphcut.h

@@ -509,7 +509,7 @@ class Alpha_expansion_MaxFlow_impl;
      \cgalParamNEnd
    \cgalNamedParamsEnd
 
-   \note The `MaxFlow` implementation is provided by the \ref PkgSurfaceMeshSegmentationRef
+   \note The `MaxFlow` implementation is provided by the \ref PkgSurfaceMeshSegmentation
    under GPL license. The header `<CGAL/boost/graph/Alpha_expansion_MaxFlow_tag.h>`
    must be included if users want to use this implementation.
 */

Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Barycentric_coordinates_2.txt

@@ -53,7 +53,7 @@ All analytic barycentric coordinates for polygons can be computed either by inst
 or through one of the free functions. Harmonic coordinates can be computed only by
 instantiating a class that must be parameterized by a model of the concept `DiscretizedDomain_2`.
 Segment and triangle coordinates can be computed only through the free functions.
-For more information see the \ref PkgBarycentricCoordinates2Ref "Reference Manual".
+For more information see the \ref PkgBarycentricCoordinates2Ref.
 
 Any point in the plane may be taken as a query point. However, we do not recommend using
 Wachspress and discrete harmonic coordinates with query points outside the closure

Documentation/doc/Documentation/Third_party.txt

@@ -143,7 +143,7 @@ The \eigen web site is <A HREF="https://eigen.tuxfamily.org/index.php?title=Main
 
 \opengr is a set C++ libraries for 3D Global Registration released under the terms of the APACHE V2 license.
 
-\cgal provides wrappers for the Super4PCS algorithm of \opengr in the \ref PkgPointSetProcessing3Ref
+\cgal provides wrappers for the Super4PCS algorithm of \opengr in the \ref PkgPointSetProcessing3
 packages. In order to use \opengr in \cgal programs, the executables should be linked with the CMake imported target `CGAL::OpenGR_support` provided in `CGAL_OpenGR_support.cmake`.
 
 The \opengr web site is <A HREF="https://github.com/STORM-IRIT/OpenGR">`https://github.com/STORM-IRIT/OpenGR`</A>.
@@ -152,7 +152,7 @@ The \opengr web site is <A HREF="https://github.com/STORM-IRIT/OpenGR">`https://
 
 \libpointmatcher is a modular library implementing the Iterative Closest Point (ICP) algorithm for aligning point clouds, released under a permissive BSD license.
 
-\cgal provides wrappers for the ICP algorithm of \libpointmatcher in the \ref PkgPointSetProcessing3Ref
+\cgal provides wrappers for the ICP algorithm of \libpointmatcher in the \ref PkgPointSetProcessing3
 packages. In order to use \libpointmatcher in \cgal programs, the
 executables should be linked with the CMake imported target
 `CGAL::pointmatcher_support` provided in
@@ -276,7 +276,7 @@ for instance, on Windows, you can download it from <A HREF="https://www.zlib.net
 
 \ceres is an open source C++ library for modeling and solving large, complicated optimization problems.
 
-In \cgal, \ceres is used by the \ref PkgPolygonMeshProcessingRef package for mesh smoothing, which
+In \cgal, \ceres is used by the \ref PkgPolygonMeshProcessing package for mesh smoothing, which
 requires solving complex non-linear least squares problems.
 
 Visit the official website of the library at <A HREF="http://ceres-solver.org/index.html">`ceres-solver.org`</A>

Documentation/doc/Documentation/Tutorials/Tutorial_GIS.txt

@@ -303,14 +303,14 @@ described in this tutorial.
 
 This tutorial is based on the following \cgal packages:
 
-- \ref PkgTriangulation2Ref
-- \ref PkgPointSet3Ref
-- \ref PkgPointSetProcessing3Ref
+- \ref PkgTriangulation2
+- \ref PkgPointSet3
+- \ref PkgPointSetProcessing3
 - \ref PkgSurface_mesh
-- \ref PkgBGLRef
-- \ref PkgPolygonMeshProcessingRef
-- \ref PkgPolylineSimplification2Ref
-- \ref PkgClassificationRef
+- \ref PkgBGL
+- \ref PkgPolygonMeshProcessing
+- \ref PkgPolylineSimplification2
+- \ref PkgClassification
 
 The data set used throughout this tutorial comes from the
 https://www.usgs.gov/ database, licensed under the _US Government

Number_types/doc/Number_types/NumberTypeSupport.txt

@@ -16,7 +16,7 @@ requirements, such that they can be successfully used in \cgal code.
 In general they are expected to be a model of an algebraic structure
 concepts and in case they model a subring of the real numbers they are
 also a model of `RealEmbeddable`. For an overview of the algebraic
-structure concepts see Section \ref PkgAlgebraicFoundationsRef.
+structure concepts see Section \ref PkgAlgebraicFoundations.
 
 \section Number_typesBuilt Built-in Number Types
 

Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h

@@ -11,7 +11,7 @@ the geometric primitives used in the triangulation and some function
 object types for the required predicates on those primitives.
 
 It refines the concept
-`TriangulationTraits_2` from the \cgal \ref PkgTriangulation2Ref package. It redefines the
+`TriangulationTraits_2` from the \cgal \ref PkgTriangulation2 package. It redefines the
 geometric objects, predicates and constructions to work with
 point-offset pairs. In most cases the offsets will be (0,0) and the
 predicates from `TriangulationTraits_2` can be used

Point_set_3/doc/Point_set_3/PackageDescription.txt

@@ -25,7 +25,7 @@
 /// header or by the LAS standard.
 ///
 /// For a complete documentation of these functions, please refer to the
-/// \ref PkgPointSetProcessing3Ref manual.
+/// \ref PkgPointSetProcessing3Ref "Point Set Processing Reference Manual".
 
 /// \defgroup PkgPointSet3IOLAS Input/Output (LAS)
 /// I/O Functions for the \ref IOStreamLAS

Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt

@@ -139,7 +139,7 @@ CGAL::jet_estimate_normals<Concurrency_tag>
    normal_map (CGAL::Second_of_pair_property_map<PointVectorPair>()));
 \endcode
 
-Please refer to the [Reference Manual](@ref PkgPointSetProcessing3Ref) for
+Please refer to the @ref PkgPointSetProcessing3Ref for
 the detailed API of the Point Set Processing functions.
 
 
@@ -973,7 +973,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 PkgShapeDetectionRef).
+produced by a shape detection algorithm (see its \ref PkgShapeDetectionRef).
 Point set structuring is based on the article \cgalCite{cgal:la-srpss-13}.
 
 - __Planes__: inliers of each detected plane are replaced by sets of
@@ -1025,7 +1025,7 @@ point set:
 
 Several functions of this package provide a callback mechanism that enables the user to track the progress of the algorithms and to interrupt them if needed. A callback, in this package, is an instance of `std::function<bool(double)>` that takes the advancement as a parameter (between 0. when the algorithm begins to 1. when the algorithm is completed) and that returns `true` if the algorithm should carry on, `false` otherwise. It is passed as a named parameter with an empty function as default.
 
-Algorithms that support this mechanism are detailed in the [Reference Manual](@ref PkgPointSetProcessing3Ref), along with the effect that an early interruption has on the output.
+Algorithms that support this mechanism are detailed in the @ref PkgPointSetProcessing3Ref, along with the effect that an early interruption has on the output.
 
 \subsection Point_set_processing_3Example_callbacks Example
 

Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt

@@ -57,7 +57,7 @@ mesh, which includes point location and self intersection tests.
 \subsection PMPIO Reading and Writing Polygon Meshes
 
 In all functions of this package, the polygon meshes are required to be models
-of the graph concepts defined in the package \ref PkgBGLRef. Using common graph concepts
+of the graph concepts defined in the package \ref PkgBGL. Using common graph concepts
 enables having common input/output functions for all the models of these concepts.
 The page \ref PkgBGLIOFct provides an exhaustive description of the available I/O functions.
 In addition, this package offers the function `CGAL::Polygon_mesh_processing::IO::read_polygon_mesh()`,