Fix some PkgDependsOn to stay inside the package overview, fix an

off-by-one in hacks.js, add a missing dependency

Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt

@@ -10,7 +10,7 @@
 \PkgAuthors{Tran Kai Frank Da}
 \PkgDesc{This package offers  a data structure encoding the whole family of alpha-complexes related to a given 2D Delaunay or regular triangulation. In particular, the data structure allows to retrieve   the alpha-complex for any alpha value, the whole spectrum of critical alpha values and a filtration on the triangulation faces (this filtration is based on the first  alpha value for which each face is included on the alpha-complex).}
 \PkgSince{2.1}
-\PkgDependsOn{\ref PkgTriangulation2}
+\PkgDependsOn{\ref PkgTriangulation2Summary}
 \PkgBib{cgal:d-as2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{2D Alpha Shapes,alpha_shapes_2.zip}

Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt

@@ -8,7 +8,7 @@
 \PkgAuthors{Tran Kai Frank Da, Sébastien Loriot, and Mariette Yvinec}
 \PkgDesc{This package offers a data structure encoding either one alpha-complex or the whole family of alpha-complexes related to a given 3D Delaunay or regular triangulation. In the latter case, the data structure allows to retrieve   the alpha-complex for any alpha value, the whole spectrum of critical alpha values and a filtration on the triangulation faces (this filtration is based on the first  alpha value for which each face is included on the alpha-complex). }
 \PkgSince{2.3}
-\PkgDependsOn{\ref PkgTriangulation3}
+\PkgDependsOn{\ref PkgTriangulation3Summary}
 \PkgBib{cgal:dy-as3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{3D Alpha Shapes,alpha_shape_3.zip}

Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt

@@ -9,7 +9,7 @@
 \PkgAuthors{Menelaos Karavelas and Mariette Yvinec}
 \PkgDesc{Algorithms for computing the Apollonius graph in two dimensions. The Apollonius graph is the dual of the Apollonius diagram, also known as the <I>additively weighted Voronoi diagram</I>. The latter can be thought of as the Voronoi diagram of a set of disks under the Euclidean metric, and it is a generalization of the standard Voronoi diagram for points. The algorithms provided are dynamic.}
 \PkgSince{3.0}
-\PkgDependsOn{\ref PkgTDS2}
+\PkgDependsOn{\ref PkgTDS2Summary}
 \PkgBib{cgal:ky-ag2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{2D Apollonius Graph,apollonius_graph_2.zip}
@@ -23,15 +23,15 @@ point of the plane from a disk is defined as the Euclidean
 distance of the point and the center of the circle, minus the radius
 of the disk.
 
-\cgal provides the class `CGAL::Apollonius_graph_2<Gt,Agds>
` for
+\cgal provides the class `CGAL::Apollonius_graph_2<Gt,Agds>` for
 computing the 2D Apollonius graph. The two template parameters must be
-models of the `ApolloniusGraphTraits_2
` and
+models of the `ApolloniusGraphTraits_2` and
-`ApolloniusGraphDataStructure_2
` concepts. The first concept is
+`ApolloniusGraphDataStructure_2` concepts. The first concept is
 related to the geometric objects and predicates associated with
 Apollonius graphs, whereas the second concept refers to the data
 structure used to represent the Apollonius graph. The classes
-`Apollonius_graph_traits_2<K,Method_tag>
` and
+`Apollonius_graph_traits_2<K,Method_tag>` and
-`Triangulation_data_structure_2<Vb,Fb>
` are models of the
+`Triangulation_data_structure_2<Vb,Fb>` are models of the
 aforementioned concepts.
 */
 

Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h

@@ -96,7 +96,7 @@ struct Attribute_type
  \pre 0\f$ \leq\f$<I>i</I>\f$ \leq\f$<I>dimension</I> and <I>i</I>-attributes are non void. 
  */ 
 template<unsigned int i> 
-typedef Hidden_type Attribute_type<i>::type;
+typedef  Attribute_type<i>::type;
 
 template<unsigned int i> 
 struct Attribute_handle {

Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt

@@ -21,7 +21,7 @@
 \PkgAuthors{Susan Hert and Stefan Schirra}
 \PkgDesc{This package provides functions  for computing convex hulls in three dimensions as well as functions for checking if sets of points are strongly convex or not. One can compute the convex hull of a set of points in three dimensions in one of three ways: using a static algorithm, using an incremental construction algorithm, or using a triangulation to get a fully dynamic computation.}
 \PkgSince{1.1}
-\PkgDependsOn{All algorithms produce as output a \ref PkgPolyhedronSummary "Polyhedron". The dynamic algorithms depend on \ref PkgTriangulation3Summary.} "3D Triangulations".
+\PkgDependsOn{All algorithms produce as output a \ref PkgPolyhedronSummary "Polyhedron". The dynamic algorithms depend on \ref PkgTriangulation3Summary "3D Triangulations".} 
 \PkgBib{cgal:hs-ch3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{See Polyhedral Surface,polyhedron_3.zip}

Documentation/doxyassist.xml

@@ -1046,6 +1046,8 @@ namespace for the XML file to be processed properly.  -->
           <string name="IMAGE_PATH">../Circulator/doc/Circulator/fig</string>
           <string name="EXAMPLE_PATH">../Circulator/examples</string>
           <list name="TAGFILES" append="false">
+            <item>./tags/Manual.tag=../../CGAL.CGAL/html</item>
+            <item>./tags/STL_Extension.tag=../../CGAL.CGAL.STL-Extensions-for-CGAL/html</item>
           </list>
         </doxygen>
       </project>

Documentation/hacks.js

@@ -1,6 +1,6 @@
 function generate_autotoc() {
     var toc = $("#autotoc").append('<ul></ul>');
-    if(toc.length > 1) { // an autotoc has been requested
+    if(toc.length > 0) { // an autotoc has been requested
         toc = toc.find('ul');
         $("h1, h2, h3").each(function(i) {
             var current = $(this);

Kinetic_data_structures/doc/Kinetic_data_structures/PackageDescription.txt

@@ -24,7 +24,7 @@
 \PkgAuthor{Daniel Russel}
 \PkgDesc{Kinetic data structures allow combinatorial structures to be maintained as the primitives move. The package provides implementations of kinetic data structures for Delaunay triangulations in two and three dimensions, sorting of points in one dimension and regular triangulations in three dimensions. The package supports exact or inexact operations on primitives which move along polynomial trajectories.  }
 \PkgSince{3.2}
-\PkgDependsOn{\ref PkgKdsFramework. Two dimensional visualization depends on \ref thirdpartyQt\, three dimensional visualization depends on \ref thirdpartyCoin.}
+\PkgDependsOn{\ref PkgKdsFrameworkSummary. Two dimensional visualization depends on \ref thirdpartyQt\, three dimensional visualization depends on \ref thirdpartyCoin.}
 \PkgBib{cgal:r-kds}
 \PkgLicense{\ref licensesLGPL "LGPL"}
 \PkgManuals{Chapter_Kinetic_Data_Structures,PkgKds}

Mesh_3/doc/Mesh_3/PackageDescription.txt

@@ -36,7 +36,7 @@
 \PkgAuthors{Pierre Alliez, Laurent Rineau, Stéphane Tayeb, Jane Tournois, Mariette Yvinec}
 \PkgDesc{This package is devoted to the generation of  isotropic simplicial meshes discretizing 3D domains. The domain to be meshed is a region of 3D space that has to be bounded. The region may be connected or  composed of multiple components and/or subdivided in several subdomains.  The domain is input as an oracle able to answer  queries, of a few different types, on the domain. Boundary and subdivision surfaces  are either smooth or piecewise smooth surfaces, formed with planar or curved surface patches. Surfaces may exhibit 1-dimensional features (e.g. crease edges) and 0-dimensional features (e.g. singular points as corners  tips, cusps or darts), that have to be fairly approximated in the mesh. }
 \PkgSince{3.5}
-\PkgDependsOn{\ref PkgTriangulation3}
+\PkgDependsOn{\ref PkgTriangulation3Summary}
 \PkgBib{cgal:rty-m3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{3D Mesh Generation,mesh_3.zip}

Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt

@@ -19,7 +19,7 @@
 \PkgAuthors{Manuel Caroli and Monique Teillaud}
 \PkgDesc{This package allows to build and handle triangulations of point sets in the three dimensional flat torus. Triangulations are built incrementally and can be modified by insertion or removal of vertices. They offer point location facilities. The package provides Delaunay triangulations and offers nearest neighbor queries and primitives to build the dual Voronoi diagrams.}
 \PkgSince{3.5}
-\PkgDependsOn{\ref PkgTriangulation3 and \ref PkgTDS3}
+\PkgDependsOn{\ref PkgTriangulation3Summary and \ref PkgTDS3Summary}
 \PkgBib{cgal:ct-pt3}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Periodic Delaunay Triangulation,periodic_3_triangulation_3.zip}

Point_set_2/doc/Point_set_2/PackageDescription.txt

@@ -13,7 +13,7 @@
 \PkgAuthor{Matthias Bäsken}
 \PkgDesc{This package supports circular, triangular, and isorectangular range search queries as well as (k) nearest neighbor search queries on 2D point sets. In contrast to the spatial searching package, this package uses a  Delaunay triangulation as underlying data structure.}
 \PkgSince{2.1}
-\PkgDependsOn{\ref PkgTriangulation2}
+\PkgDependsOn{\ref PkgTriangulation2Summary}
 \PkgBib{cgal:b-ss2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_2D_Range_and_Neighbor_Search,PkgPointSet2}

Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/PackageDescription.txt

@@ -9,7 +9,7 @@
 \PkgAuthor{Menelaos Karavelas}
 \PkgDesc{An algorithm for computing the dual of a Voronoi diagram of a set       of segments under the Euclidean metric. It is a generalization of the       standard Voronoi diagram for points.  The algorithms provided are       dynamic.}
 \PkgSince{3.1}
-\PkgDependsOn{\ref PkgTDS2}
+\PkgDependsOn{\ref PkgTDS2Summary}
 \PkgBib{cgal:k-sdg2}
 \PkgLicense{\ref licensesGPL}
 \PkgDemo{2D Segment Voronoi Diagram,segment_voronoi_diagram_2.zip}

Skin_surface_3/doc/Skin_surface_3/PackageDescription.txt

@@ -10,7 +10,7 @@
 \PkgAuthor{Nico Kruithof}
 \PkgDesc{This package allows to build a triangular mesh of a skin surface.     Skin surfaces are used for modeling large molecules in biological     computing. The surface is defined by a set of balls, representing     the atoms of the molecule, and a shrink factor that determines the     size of the smooth patches gluing the balls together.      The construction of a triangular mesh of a smooth skin surface is     often necessary for further analysis and for fast visualization.     This package provides functions to construct a triangular mesh     approximating the skin surface from a set of balls and a shrink     factor. It also contains code to subdivide the mesh efficiently.     }
 \PkgSince{3.3}
-\PkgDependsOn{\ref PkgTriangulation3 and \ref PkgPolyhedron}
+\PkgDependsOn{\ref PkgTriangulation3Summary and \ref PkgPolyhedronSummary}
 \PkgBib{cgal:k-ssm3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_3D_Skin_Surface_Meshing,PkgSkinSurface3}

Stream_lines_2/doc/Stream_lines_2/PackageDescription.txt

@@ -9,7 +9,7 @@
 \PkgAuthor{Abdelkrim Mebarki}
 \PkgDesc{Visualizing vector fields is important for many application domains. A good way to do it is to generate streamlines that describe the flow behavior. This package implements the "Farthest Point Seeding" algorithm for placing streamlines in 2D vector fields. It generates a list of streamlines corresponding to an input flow using a specified separating distance. The algorithm uses a Delaunay triangulation to model objects and address different queries, and relies on choosing the centers of the biggest empty circles to start the integration of the streamlines.}
 \PkgSince{3.2}
-\PkgDependsOn{\ref PkgTriangulation2}
+\PkgDependsOn{\ref PkgTriangulation2Summary}
 \PkgBib{cgal:m-ps}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{2D Stream Lines,streamlines.zip}

Surface_mesh_simplification/doc/Surface_mesh_simplification/PackageDescription.txt

@@ -9,8 +9,8 @@
 \PkgAuthor{Fernando Cacciola}
 \PkgDesc{This package provides an algorithm to simplify a triangulated surface mesh  by edge collapsing.  It is an implementation of the Turk/Lindstrom <I>memoryless</I>  mesh simplification algorithm.}
 \PkgSince{3.3}
-\PkgDependsOn{\ref PkgBGL}
+\PkgDependsOn{\ref PkgBGLSummary}
-\PkgDependsOn{\ref PkgPolyhedron}
+\PkgDependsOn{\ref PkgPolyhedronSummary}
 \PkgBib{cgal:c-tsms-12}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Operations on Polyhedra,polyhedron_3.zip}