Add PkgDependsOn to the package summary

Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h

@@ -15,7 +15,7 @@ for Homogeneous kernels.
 \hasModel `CGAL::Gmpq` 
 \hasModel `CGAL::Gmpz` 
 \hasModel` CGAL::Interval_nt` 
-\hasModel `CGAL::Interval_nt_advanced `
+\hasModel \ref CGAL::Interval_nt_advanced
 \hasModel `CGAL::Lazy_exact_nt<RingNumberType>` 
 \hasModel `CGAL::MP_Float` 
 \hasModel `CGAL::Gmpzf`

Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt

@@ -46,7 +46,7 @@
 \PkgDescriptionBegin{Algebraic Foundations,PkgAlgebraicFoundationsSummary}
 \PkgPicture{Algebraic_foundations2.png}
 \PkgAuthor{Michael Hemmer}
-\PkgDesc{This package defines what algebra means for \cgal, in terms of concepts, classes and functions. The main features are: (i) explicit concepts for interoperability of types  (ii) separation between algebraic types (not necessarily embeddable into the reals), and number types (embeddable into the reals). }
+\PkgDesc{This package defines what algebra means for \cgal, in terms of concepts, classes and functions. The main features are: (i) explicit concepts for interoperability of types  (ii) separation between algebraic types (not necessarily embeddable into the reals), and number types (embeddable into the reals).}
 \PkgSince{3.3}
 \PkgBib{cgal:h-af}
 \PkgLicense{\ref licensesLGPL "LGPL"}

Algebraic_kernel_d/doc/Algebraic_kernel_d/PackageDescription.txt

@@ -22,6 +22,7 @@
 \PkgAuthor{Eric Berberich, Michael Hemmer, Michael Kerber, Sylvain Lazard, Luis Peñaranda, and Monique Teillaud}
 \PkgDesc{Real solving of polynomials is a fundamental problem with a wide application range.  This package is targeted to provide black-box implementations of state-of-the-art  algorithms to determine, compare and approximate real roots of univariate polynomials and bivariate polynomial systems. Such a black-box is called an <I>Algebraic Kernel</I>.  So far the package only provides models for the univariate kernel. Nevertheless,  it already defines concepts for the bivariate kernel, since this settles the interface for upcoming implementations.}
 \PkgSince{3.6}
+\PkgDependsOn{Some models depend on \ref thirdpartyRS.}
 \PkgBib{cgal:bht-ak}
 \PkgLicense{\ref licensesLGPL "LGPL"}
 \PkgManuals{Chapter_Algebraic_Kernel,PkgAlgebraicKerneld}

Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt

@@ -10,6 +10,7 @@
 \PkgAuthor{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}
 \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

@@ -9,6 +9,7 @@
 \PkgAuthor{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}
 \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

@@ -11,6 +11,7 @@
 \PkgAuthor{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}
 \PkgBib{cgal:ky-ag2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{2D Apollonius Graph,apollonius_graph_2.zip}

Arrangement_on_surface_2/doc/Sweep_line_2/PackageDescription.txt

@@ -7,6 +7,7 @@
 \PkgAuthor{Baruch Zukerman, Ron Wein, and Efi Fogel}
 \PkgDesc{This package provides three free functions implemented based on the sweep-line paradigm: given a collection of input curves, compute all intersection points, compute the set of subcurves that are pairwise interior-disjoint induced by them, and check whether there is at least one pair of curves among them that intersect in their interior.}
 \PkgSince{2.4}
+\PkgDependsOn{\ref PkgArrangement2}
 \PkgBib{cgal:wfz-ic2}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgManuals{Chapter_2D_Intersection_of_Curves,PkgIntersectionOfCurves2}

Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt

@@ -10,6 +10,7 @@
 \PkgAuthor{Efi Fogel, Ophir Setter, Ron Wein, Guy Zucker, Baruch Zukerman, and Dan Halperin}
 \PkgDesc{This package consists of the implementation of Boolean set-operations on point sets bounded by weakly x-monotone curves in 2-dimensional Euclidean space. In particular, it contains the implementation of regularized Boolean set-operations, intersection predicates, and point containment predicates.}
 \PkgSince{3.2}
+\PkgDependsOn{\ref PkgArrangement2}
 \PkgBib{cgal:fwzh-rbso2}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Boolean operations,boolean_operations_2.zip}

Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt

@@ -20,6 +20,7 @@
 \PkgAuthor{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 PkgPolyhedron.The dynamic algorithms depend on \ref PkgTriangulation3.}
 \PkgBib{cgal:hs-ch3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{See Polyhedral Surface,polyhedron_3.zip}

Documentation/Doxyfile

@@ -223,6 +223,7 @@ ALIASES += "PkgAuthor{1}=<div class=\"PkgDescription\"><I>\1</I><BR>"
 ALIASES += "PkgAuthors{1}=<div class=\"PkgDescription\"><I>\1</I><BR>"
 ALIASES += "PkgDesc{1}=\1</div><div class=\"PkgSummary\">"
 ALIASES += "PkgSince{1}=<B>Introduced in:</B> \cgal \1<BR>"
+ALIASES += "PkgDependsOn{1}=<B>Depends on:</B> \1<BR>"
 ALIASES += "PkgLicense{1}=<B>License:</B> \1<BR>"
 ALIASES += "PkgDemo{2}=<B>Demo:</B> <a href=\"http://www.cgal.org/demo/4.0.2/\2\">\1</a><BR>"
 ALIASES += "PkgDescriptionEnd=\n\n</div>"

Documentation/cgal_stylesheet.css

@@ -40,7 +40,11 @@ h2.groupheader {
 }
 
 .PkgDescription {
-    width: 50%;
+    width: 60%;
+}
+
+.PkgSummary {
+    width: 20%;
 }
 
 .PkgDescription, .PkgSummary, .PkgImage, .PkgImage .image {

Envelope_2/doc/Envelope_2/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Ron Wein}
 \PkgDesc{This package consits of functions that computes the lower (or upper) envelope of a set of arbitrary curves in 2D. The output is represented as an envelope diagram, namely a subdivision of the \f$ x\f$-axis into intervals, such that the identity of the curves that induce the envelope on each interval is unique.}
 \PkgSince{3.3}
+\PkgDependsOn{\ref PkgArrangement2}
 \PkgBib{cgal:w-e2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_Envelopes_of_Curves_in_2D,PkgEnvelope2}

Envelope_3/doc/Envelope_3/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Dan Halperin, Michal Meyerovitch, Ron Wein, and Baruch Zukerman}
 \PkgDesc{This package consits of functions that compute the lower (or upper) envelope of a set of arbitrary surfaces in 3D. The output is represented as an 2D envelope diagram, namely a planar subdivision such that the identity of the surfaces that induce the envelope over each diagram cell is unique.}
 \PkgSince{3.3}
+\PkgDependsOn{\ref PkgArrangement2}
 \PkgBib{cgal:mwz-e3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{3D Envelopes,envelope_3.zip}

GraphicsView/doc/GraphicsView/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Andreas Fabri  and Laurent Rineau}
 \PkgDesc{This package provides classes for displaying \cgal objects  and data structures in the <A HREF="http://doc.qt.nokia.com/latest/graphicsview.html">Qt 4 Graphics View Framework</A>.}
 \PkgSince{3.4}
+\PkgDependsOn{\ref thirdpartyQt}
 \PkgBib{cgal:fr-cqgvf}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_CGAL_and_the_Qt_Graphics_View_Framework,PkgGraphicsView}

Jet_fitting_3/doc_tex/Jet_fitting_3/PkgDescription.tex

@@ -10,7 +10,7 @@
   curvature lines, etc. This package allows the estimation of local
   differential quantities of a surface from a point sample.}
 %
-\ccPkgDependsOn{Solvers as \ccThirdPartyEigen, or \ccThirdPartyLapack\ and \ccThirdPartyBlas}
+\ccPkgDependsOn{Solvers as \ref thirdPartyEigen, or \ref thirdPartyLapack and \ref thirdPartyBlas}
 \ccPkgIntroducedInCGAL{3.3}
 \ccPkgLicense{\ccLicenseGPL}
 %\ccPkgDemo{Operations on Polyhedra}{polyhedron_3.zip}

Kinetic_data_structures/doc/Kinetic_data_structures/PackageDescription.txt

@@ -24,6 +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.}
 \PkgBib{cgal:r-kds}
 \PkgLicense{\ref licensesLGPL "LGPL"}
 \PkgManuals{Chapter_Kinetic_Data_Structures,PkgKds}

Kinetic_data_structures/doc/Kinetic_framework/PackageDescription.txt

@@ -25,6 +25,7 @@
 \PkgAuthor{Daniel Russel}
 \PkgDesc{Kinetic data structures allow combinatorial geometric structures to be maintained as the primitives move. The package provides a framework to ease implementing and debugging kinetic data structures. The package supports exact or inexact operations on primitives which move along polynomial trajectories.  }
 \PkgSince{3.2}
+\PkgDependsOn{Two dimensional visualization depends on \ref thirdpartyQt\, three dimensional visualization depends on \ref thirdpartyCoin.}
 \PkgBib{cgal:r-kdsf}
 \PkgLicense{\ref licensesLGPL "LGPL"}
 \PkgManuals{Chapter_Kinetic_Framework,PkgKdsFramework}

Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt

@@ -22,6 +22,7 @@
 \PkgAuthor{Guillaume Damiand}
 \PkgDesc{This package implements linear cell complexes, objects in <I>d</I>-dimension with linear geometry. The combinatorial part of objects is described by a combinatorial map, representing all the cells of the object plus the incidence and adjacency relations between cells. Geometry is added to combinatorial maps simply by associating a point to each vertex of the map. Taking a 2D combinatorial map, and using 3D points, gives a linear cell complex equivalent to a <I>Polyhedron_3</I>.}
 \PkgSince{4.0}
+\PkgDependsOn{\ref PkgCombinatorialMaps}
 \PkgBib{cgal:d-lcc-12}
 \PkgLicense{\ref licensesLGPL "LGPL"}
 \PkgDemo{3D Linear Cell Complex,linear_cell_complex_3.zip}

Mesh_2/doc/Mesh_2/PackageDescription.txt

@@ -10,6 +10,7 @@
 \PkgAuthor{Laurent Rineau}
 \PkgDesc{This package implements a Delaunay refinement algorithm to construct  conforming triangulations and 2D meshes.  Conforming Delaunay triangulations are obtained from constrained Delaunay triangulations by refining constrained edges until they are Delaunay edges. Conforming Gabriel triangulations  are obtained by further refining constrained edges until they become Gabriel edges.  The package provides also a 2D mesh generator that refines triangles and constrained edges until user defined size and shape criteria on triangles are satisfied.  The package can handle intersecting input constraints  and set no restriction on the angle formed  by two constraints sharing an endpoint.}
 \PkgSince{3.1}
+\PkgDependsOn{\ref PkgTriangulation2}
 \PkgBib{cgal:r-ctm2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{2D Mesh Generator,constrained_delaunay_triangulation_2.zip}

Mesh_3/doc/Mesh_3/PackageDescription.txt

@@ -36,6 +36,7 @@
 \PkgAuthor{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}
 \PkgBib{cgal:rty-m3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{3D Mesh Generation,mesh_3.zip}

Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Ron Wein}
 \PkgDesc{This package consists of functions that compute the Minkowski sum of two simple straight-edge polygons in the plane. It also contains functions for computing the Minkowski sum of a polygon and a disc, an operation known as <I>offsetting</I> or <I>dilating</I> a polygon. The package can compute the exact representation of the offset polygon, or provide a guaranteed approximation of the offset.}
 \PkgSince{3.3}
+\PkgDependsOn{\ref PkgArrangement2}
 \PkgBib{cgal:w-rms2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_2D_Minkowski_Sums,PkgMinkowskiSum2}

Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt

@@ -9,6 +9,7 @@
 \PkgAuthor{Peter Hachenberger}
 \PkgDesc{This package provides a function, which computes the Minkowski sum of two point sets in \f$ \mathbb{R}^3\f$. These point sets may consist of isolated vertices, isolated edges, surfaces with convex facets without holes, and open and closed solids. Thus, it is possible to compute the configuration space of translational robots (even in tight passage scenarios) as well as several graphics operations, like for instance the glide operation, which computes the point set swept by a polyhedron that moves along a polygonal line.}
 \PkgSince{3.5}
+\PkgDependsOn{\ref PkgNef2\, \ref PkgNefS2\, \ref PkgNef3\, \ref PkgConvexDecomposition3}
 \PkgBib{cgal:h-msp3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{Operations on Polyhedra,polyhedron_3.zip}

Nef_3/doc/Nef_3/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Peter Hachenberger  and Lutz Kettner}
 \PkgDesc{3D Nef polyhedra, are a boundary representation for cell-complexes bounded by halfspaces that supports Boolean operations and topological operations in full generality including unbounded cells, mixed dimensional cells (e.g., isolated vertices and antennas). Nef polyhedra distinguish between open and closed sets and can represent non-manifold geometry.}
 \PkgSince{3.1}
+\PkgDependsOn{\ref PkgNef2\, \ref PkgNefS2}
 \PkgBib{cgal:hk-bonp3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{Operations on Polyhedra,polyhedron_3.zip}

Nef_S2/doc/Nef_S2/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Peter Hachenberger  and Lutz Kettner}
 \PkgDesc{This package offers the equivalent to 2D Nef Polygons in the plane. Here halfplanes correspond to half spheres delimited by great circles.}
 \PkgSince{3.1}
+\PkgDependsOn{\ref PkgNef2}
 \PkgBib{cgal:hk-bonpes2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_2D_Boolean_Operations_on_Nef_Polygons_Embedded_on_the_Sphere,PkgNefS2}

Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt

@@ -19,6 +19,7 @@
 \PkgAuthor{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}
 \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,6 +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}
 \PkgBib{cgal:b-ss2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_2D_Range_and_Neighbor_Search,PkgPointSet2}

Point_set_processing_3/doc/Point_set_processing_3/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Pierre Alliez, Laurent Saboret, Nader Salman}
 \PkgDesc{This \cgal component implements methods to analyze and process unorganized point sets. The input is an unorganized point set, possibly with normal attributes (unoriented or oriented). The point set can be analyzed to measure its average spacing, and processed through functions devoted to the simplification, outlier removal, smoothing, normal estimation and normal orientation.}
 \PkgSince{3.5}
+\PkgDependsOn{\ref thirdpartyLapack}
 \PkgBib{cgal:ass-psp}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Surface Reconstruction,surface_reconstruction_points_3.zip}

Polyhedron/doc/Polyhedron/PackageDescription.txt

@@ -9,6 +9,7 @@
 \PkgAuthor{Lutz Kettner}
 \PkgDesc{Polyhedral surfaces in three dimensions are composed of vertices, edges, facets and an incidence relationship on them. The organization beneath is a halfedge data structure, which restricts the class of representable surfaces to orientable 2-manifolds - with and without boundary. If the surface is closed we call it a polyhedron.}
 \PkgSince{1.0}
+\PkgDependsOn{\ref PkgHDS}
 \PkgBib{cgal:k-ps}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Operations on Polyhedra,polyhedron_3.zip}

Ridges_3/doc/Ridges_3/PackageDescription.txt

@@ -21,6 +21,7 @@
 \PkgAuthor{Marc Pouget and Frédéric Cazals}
 \PkgDesc{Global features related to curvature extrema encode important informations used in segmentation, registration, matching and surface analysis. Given pointwise estimations of local differential quantities, this package allows the approximation of differential features on a triangulated surface mesh. Such curvature related features are curves: ridges or crests, and points: umbilics.}
 \PkgSince{3.3}
+\PkgDependsOn{Solvers as \ref thirdpartyEigen\, or \ref thirdpartyLapack and \ref thirdpartyBlas.} 
 \PkgBib{cgal:cp-arutsm}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgManuals{Chapter_Approximation_of_Ridges_and_Umbilics_on_Triangulated_Surface_Meshes,PkgRidges_3}

Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/PackageDescription.txt

@@ -9,6 +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}
 \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,6 +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}
 \PkgBib{cgal:k-ssm3}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgManuals{Chapter_3D_Skin_Surface_Meshing,PkgSkinSurface3}

Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt

@@ -9,6 +9,7 @@
 \PkgAuthor{Eli Packer}
 \PkgDesc{Snap Rounding is a well known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation. In the study of robust geometric computing, it can be classified as a finite precision approximation technique. Iterated Snap Rounding is a modification of Snap Rounding in which each vertex is at least half-the-width-of-a-pixel away from any non-incident edge. This package supports both methods.}
 \PkgSince{3.1}
+\PkgDependsOn{\ref PkgArrangement2}
 \PkgBib{cgal:p-sr2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{2D Snap Rounding,snap_rounding_2.zip}

Straight_skeleton_2/doc/Straight_skeleton_2/PackageDescription.txt

@@ -11,6 +11,7 @@
 \PkgAuthor{Fernando Cacciola}
 \PkgDesc{This package implements an algorithm to construct a halfedge data structure representing the straight skeleton in the interior of 2D polygons with holes and an algorithm to construct inward offset polygons at any offset distance given a straight skeleton.}
 \PkgSince{3.2}
+\PkgDependsOn{\ref PkgHDS}
 \PkgBib{cgal:c-sspo2}
 \PkgLicense{\ref licensesGPL  "GPL"}
 \PkgDemo{2D Straight Skeleton,straight_skeleton_2.zip}

Stream_lines_2/doc/Stream_lines_2/PackageDescription.txt

@@ -9,6 +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}
 \PkgBib{cgal:m-ps}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{2D Stream Lines,streamlines.zip}

Surface_mesh_parameterization/doc/Surface_mesh_parameterization/PackageDescription.txt

@@ -156,6 +156,7 @@ sparse linear solvers:
 \PkgAuthor{Laurent Saboret, Pierre Alliez  and Bruno Lévy}
 \PkgDesc{Parameterizing a surface amounts to finding a one-to-one mapping from a suitable domain to the surface. In this package, we focus on triangulated surfaces that are homeomorphic to a disk and on piecewise linear mappings into a planar domain.  This package implements several surface mesh parameterization methods, such as least squares conformal maps, discrete conformal map, discrete authalic parameterization, Floater mean value coordinates or Tutte barycentric mapping.}
 \PkgSince{3.2}
+\PkgDependsOn{Solvers as \ref thirdpartyEigen or \ref thirdpartyOpenNL or \ref thirdpartyTaucs.}
 \PkgBib{cgal:sal-pptsm2}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Operations on Polyhedra,polyhedron_3.zip}

Surface_mesh_simplification/doc/Surface_mesh_simplification/PackageDescription.txt

@@ -11,6 +11,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 PkgPolyhedron}
 \PkgBib{cgal:c-tsms-12}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Operations on Polyhedra,polyhedron_3.zip}

Surface_reconstruction_points_3/doc/Surface_reconstruction_points_3/PackageDescription.txt

@@ -7,6 +7,7 @@
 \PkgAuthor{Pierre Alliez, Laurent Saboret, Gaël Guennebaud}
 \PkgDesc{This \cgal package implements a surface reconstruction method: Poisson Surface Reconstruction. It takes as input a set of points with oriented normals and computes an implicit function. The \cgal surface mesh generator can then be used to extract an iso-surface from this function. }
 \PkgSince{3.5}
+\PkgDependsOn{\ref thirdpartyEigen or \ref thirdpartyTaucs}
 \PkgBib{cgal:asg-srps}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Surface Reconstruction,surface_reconstruction_points_3.zip}

Triangulation_2/doc/Triangulation_2/PackageDescription.txt

@@ -24,6 +24,7 @@
 \PkgAuthor{Mariette Yvinec}
 \PkgDesc{This package  allows to build and handle various triangulations for point sets two dimensions. Any \cgal triangulation covers the convex hull of its vertices. Triangulations are build incrementally  and can be modified by insertion  or removal  of vertices.  They offer point location facilities.  The package provides plain triangulation (whose faces depend on the insertion order of the vertices) and Delaunay triangulations.  Regular triangulations are also provided for sets of weighted points. Delaunay and regular triangulations offer nearest neighbor queries and primitives to build the dual Voronoi and power diagrams.   Finally, constrained and Delaunay constrained triangulations allows to force some constrained segments to appear as edges of the triangulation.  Several versions of constrained and Delaunay constrained triangulations are provided: some of them handle intersections between input constraints segment while others do not. }
 \PkgSince{0.9}
+\PkgDependsOn{\ref PkgTDS2}
 \PkgBib{cgal:y-t2}
 \PkgLicense{\ref licensesGPL "GPL"}
 \PkgDemo{Delaunay Triangulation,delaunay_triangulation_2.zip}