diff --git a/Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt b/Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt index 0cb8a3aacb3..2ff4d5e6088 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt +++ b/Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt @@ -7,7 +7,7 @@ \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} \cgalbib{cgal:h-af-12} -\license{ \ref licensesLGPL} +\license{ \ref licensesLGPL "LGPL"} \PkgDescriptionEnd */ diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt b/Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt index 4f8915396b8..0d2265c3bbf 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt @@ -11,7 +11,7 @@ \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} \cgalbib{ cgal:d-as2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd This chapter presents a framework for alpha shapes. The description is based on diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt b/Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt index a0ead163972..c9897026102 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt @@ -10,7 +10,7 @@ \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} \cgalbib{ cgal:dy-as3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd Alpha shapes definition is based on an underlying diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt b/Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt index 25c37673b34..bdfa38392dc 100644 --- a/Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt +++ b/Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{Algorithms for computing the Apollonius graph in two dimensions. The Apollonius graph is the dual of the Apollonius diagram, also known as the additively weighted Voronoi diagram. 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} \cgalbib{ cgal:ky-ag2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Bounding_volumes/doc/Bounding_volumes/PackageDescription.txt b/Bounding_volumes/doc/Bounding_volumes/PackageDescription.txt index c4f87da0b2f..fb2ca186f42 100644 --- a/Bounding_volumes/doc/Bounding_volumes/PackageDescription.txt +++ b/Bounding_volumes/doc/Bounding_volumes/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package provides algorithms for computing optimal bounding volumes of point sets. In d-dimensional space, the smallest enclosing sphere, ellipsoid (approximate), and annulus can be computed. In 3-dimensional space, the smallest enclosing strip is available as well, and in 2-dimensional space, there are algorithms for a number of additional volumes (rectangles, parallelograms, \f$ k=2,3,4\f$ axis-aligned rectangles). The smallest enclosing sphere algorithm can also be applied to a set of d-dimensional spheres.} \PkgSince{1.1} \cgalbib{ cgal:fghhs-bv-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd The optimization code uses infix `OPTIMISATION` in the assertions, diff --git a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt index 59b53e7fe50..87425310015 100644 --- a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt +++ b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{An efficient algorithm for finding all intersecting pairs for large numbers of iso-oriented boxes, in order to apply a user defined callback on them. Typically these boxes will be bounding boxes of more complicated geometries. The algorithm is useful for (self-) intersection tests of surfaces etc. } \PkgSince{3.1} \cgalbib{ cgal:kmz-isiobd-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/CGAL_ipelets/doc/CGAL_ipelets/PackageDescription.txt b/CGAL_ipelets/doc/CGAL_ipelets/PackageDescription.txt index 6ad75bda880..64d17ed5ee3 100644 --- a/CGAL_ipelets/doc/CGAL_ipelets/PackageDescription.txt +++ b/CGAL_ipelets/doc/CGAL_ipelets/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package provides a generic framework to easily write ipelets (plug-in's) using \cgal for the the Ipe extensible drawing editor.} \PkgSince{3.5} \cgalbib{ cgal:lp-gi-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd */ diff --git a/Circulator/doc/Circulator/PackageDescription.txt b/Circulator/doc/Circulator/PackageDescription.txt index 612b75058cf..60b1f4915e4 100644 --- a/Circulator/doc/Circulator/PackageDescription.txt +++ b/Circulator/doc/Circulator/PackageDescription.txt @@ -11,7 +11,7 @@ \PkgDesc{This package descibes handles and circulators. They are related to iterators. Handles allow to dereference but neither to increment nor to decrement. Circulators have no notion of past-the-end, and they are used in \cgal whenever we have cyclic stuctures. } \PkgSince{1.0} \cgalbib{ cgal:dksy-hc-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd The concept of iterators in the \stl is tailored for linear sequences. diff --git a/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt b/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt index cb6d39aa907..9f77165da15 100644 --- a/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt +++ b/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt @@ -9,7 +9,7 @@ \PkgDesc{This packages provides a function for decomposing a bounded polyhedron into convex sub-polyhedra. The decomposition yields \f$ O(r^2)\f$ convex pieces, where \f$ r\f$ is the number of edges, whose adjacent facets form an angle of more than 180 degrees with respect to the polyhedron's interior. This bound is worst-case optimal. } \PkgSince{3.5} \cgalbib{ cgal:h-emspe-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Convex_hull_2/doc/Convex_hull_2/PackageDescription.txt b/Convex_hull_2/doc/Convex_hull_2/PackageDescription.txt index cef35f446f6..0ad417d4c78 100644 --- a/Convex_hull_2/doc/Convex_hull_2/PackageDescription.txt +++ b/Convex_hull_2/doc/Convex_hull_2/PackageDescription.txt @@ -27,7 +27,7 @@ \PkgDesc{This package provides functions for computing convex hulls in two dimensions as well as functions for checking if sets of points are strongly convex are not. There are also a number of functions described for computing particular extreme points and subsequences of hull points, such as the lower and upper hull of a set of points.} \PkgSince{1.0} \cgalbib{ cgal:hs-chep2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd Assertions diff --git a/Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt b/Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt index 090cd89c4fa..08de317b3f5 100644 --- a/Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt +++ b/Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt @@ -21,7 +21,7 @@ \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} \cgalbib{ cgal:hs-ch3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd Assertions diff --git a/Convex_hull_d/doc/Convex_hull_d/PackageDescription.txt b/Convex_hull_d/doc/Convex_hull_d/PackageDescription.txt index bcb6664de87..8a3077d8d26 100644 --- a/Convex_hull_d/doc/Convex_hull_d/PackageDescription.txt +++ b/Convex_hull_d/doc/Convex_hull_d/PackageDescription.txt @@ -11,7 +11,7 @@ \PkgDesc{This package provides functions for computing convex hulls and Delaunay triangulations in \f$ d\f$-dimensional Euclidean space.} \PkgSince{2.3} \cgalbib{ cgal:hs-chdt3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Envelope_2/doc/Envelope_2/PackageDescription.txt b/Envelope_2/doc/Envelope_2/PackageDescription.txt index 824619806dd..ea17be9d4c1 100644 --- a/Envelope_2/doc/Envelope_2/PackageDescription.txt +++ b/Envelope_2/doc/Envelope_2/PackageDescription.txt @@ -12,7 +12,7 @@ \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} \cgalbib{ cgal:w-e2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd This package consists of functions that compute the lower (or upper) diff --git a/Envelope_3/doc/Envelope_3/PackageDescription.txt b/Envelope_3/doc/Envelope_3/PackageDescription.txt index ecc9c2b7673..5239717ef79 100644 --- a/Envelope_3/doc/Envelope_3/PackageDescription.txt +++ b/Envelope_3/doc/Envelope_3/PackageDescription.txt @@ -12,7 +12,7 @@ \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} \cgalbib{ cgal:mwz-e3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd This package consists of functions that compute the lower (or upper) diff --git a/Generator/doc/Generator/PackageDescription.txt b/Generator/doc/Generator/PackageDescription.txt index 6fa1fbd42ee..791bc567d4d 100644 --- a/Generator/doc/Generator/PackageDescription.txt +++ b/Generator/doc/Generator/PackageDescription.txt @@ -11,7 +11,7 @@ \PkgDesc{This package provides a variety of generators for geometric objects. They are useful as synthetic test data sets, e.g. for testing algorithms on degenerate object sets and for performance analysis. } \PkgSince{1.0} \cgalbib{ cgal:dhhk-gog-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd This chapter describes the functions and classes provided in \cgal diff --git a/Geomview/doc/Geomview/PackageDescription.txt b/Geomview/doc/Geomview/PackageDescription.txt index d8eefc24af2..c11c39f39bf 100644 --- a/Geomview/doc/Geomview/PackageDescription.txt +++ b/Geomview/doc/Geomview/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package implements an interface to Geomview, an interactive 3D viewing program, originally developed at the Geometry Center in Minneapolis.} \PkgSince{2.0} \cgalbib{ cgal:fp-gv-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd */ diff --git a/GraphicsView/doc/GraphicsView/PackageDescription.txt b/GraphicsView/doc/GraphicsView/PackageDescription.txt index 583a790cbaa..52cfeba3be2 100644 --- a/GraphicsView/doc/GraphicsView/PackageDescription.txt +++ b/GraphicsView/doc/GraphicsView/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package provides classes for displaying \cgal objects and data structures in the Qt 4 Graphics View Framework.} \PkgSince{3.4} \cgalbib{ cgal:fr-cqgvf-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd This package provides some classes which allow to use \cgal classes in diff --git a/HalfedgeDS/doc/HalfedgeDS/PackageDescription.txt b/HalfedgeDS/doc/HalfedgeDS/PackageDescription.txt index f2908b1c1cf..5aefd7ed5d4 100644 --- a/HalfedgeDS/doc/HalfedgeDS/PackageDescription.txt +++ b/HalfedgeDS/doc/HalfedgeDS/PackageDescription.txt @@ -10,7 +10,7 @@ \PkgDesc{A halfedge data structure is an edge-centered data structure capable of maintaining incidence information of vertices, edges and faces, for example for planar maps, polyhedra, or other orientable, two-dimensional surfaces embedded in arbitrary dimension. Each edge is decomposed into two halfedges with opposite orientations. One incident face and one incident vertex are stored in each halfedge. For each face and each vertex, one incident halfedge is stored. Reduced variants of the halfedge data structure can omit some of these information, for example the halfedge pointers in faces or the storage of faces at all.} \PkgSince{1.0} \cgalbib{ cgal:k-hds-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd A halfedge data structure (abbreviated as `HalfedgeDS`, or diff --git a/Interval_skip_list/doc/Interval_skip_list/PackageDescription.txt b/Interval_skip_list/doc/Interval_skip_list/PackageDescription.txt index b30f7eb4e66..c0c4a98279a 100644 --- a/Interval_skip_list/doc/Interval_skip_list/PackageDescription.txt +++ b/Interval_skip_list/doc/Interval_skip_list/PackageDescription.txt @@ -10,7 +10,7 @@ \PkgDesc{An interval skip list is a data structure for finding all intervals that contain a point, and for stabbing queries, that is for answering the question whether a given point is contained in an interval or not. For a triangulated terrain, this allows to quickly identify the triangles which intersect an iso line. } \PkgSince{3.0} \cgalbib{ cgal:f-isl-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd This chapter presents the interval skip list introduced by Hanson \cite h-islds-91, diff --git a/Jet_fitting_3/doc/Jet_fitting_3/PackageDescription.txt b/Jet_fitting_3/doc/Jet_fitting_3/PackageDescription.txt index cf6ec79b758..75173a50f27 100644 --- a/Jet_fitting_3/doc/Jet_fitting_3/PackageDescription.txt +++ b/Jet_fitting_3/doc/Jet_fitting_3/PackageDescription.txt @@ -10,7 +10,7 @@ \PkgDesc{For a surface discretized as a point cloud or a mesh, it is desirable to estimate pointwise differential quantities. More precisely, first order properties correspond to the normal or the tangent plane; second order properties provide the principal curvatures and directions, third order properties provide the directional derivatives of the principal curvatures along the curvature lines, etc. This package allows the estimation of local differential quantities of a surface from a point sample.} \PkgSince{3.3} \cgalbib{ cgal:pc-eldp-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Mesh_2/doc/Mesh_2/PackageDescription.txt b/Mesh_2/doc/Mesh_2/PackageDescription.txt index b9a88c347d9..c6b2f14fc40 100644 --- a/Mesh_2/doc/Mesh_2/PackageDescription.txt +++ b/Mesh_2/doc/Mesh_2/PackageDescription.txt @@ -11,7 +11,7 @@ \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} \cgalbib{ cgal:r-ctm2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt index 98574470352..8cdaf702df1 100644 --- a/Mesh_3/doc/Mesh_3/PackageDescription.txt +++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt @@ -12,7 +12,7 @@ \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} \cgalbib{ cgal:rty-m3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt b/Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt index 6ad26ce87ad..2a886bcc4c5 100644 --- a/Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt +++ b/Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt @@ -12,7 +12,7 @@ \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 offsetting or dilating a polygon. The package can compute the exact representation of the offset polygon, or provide a guaranteed approximation of the offset.} \PkgSince{3.3} \cgalbib{ cgal:w-rms2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd This package consist of functions for computing the Minkowksi sum diff --git a/Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt b/Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt index f4b05cdd1b7..731072fe195 100644 --- a/Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt +++ b/Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt @@ -10,7 +10,7 @@ \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} \cgalbib{ cgal:h-msp3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Miscellany/doc/Miscellany/PackageDescription.txt b/Miscellany/doc/Miscellany/PackageDescription.txt index df9c73fd62e..a40b3dbac08 100644 --- a/Miscellany/doc/Miscellany/PackageDescription.txt +++ b/Miscellany/doc/Miscellany/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package provides classes for profiling time and memory consumption, a hash map, a union find data structure and a modifier.} \PkgSince{3.2} \cgalbib{ cgal:kps-pthum-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd diff --git a/Modular_arithmetic/doc/Modular_arithmetic/PackageDescription.txt b/Modular_arithmetic/doc/Modular_arithmetic/PackageDescription.txt index 07e7f55e1dc..adc7e23a3ea 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/PackageDescription.txt +++ b/Modular_arithmetic/doc/Modular_arithmetic/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package provides arithmetic over finite fields. The provided tools are in particular useful for filters based on modular arithmetic and algorithms based on Chinese remainder. } \PkgSince{3.4} \cgalbib{ cgal:h-ma-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd */ diff --git a/Nef_2/doc/Nef_2/PackageDescription.txt b/Nef_2/doc/Nef_2/PackageDescription.txt index f2c0020221d..bed7f9216e6 100644 --- a/Nef_2/doc/Nef_2/PackageDescription.txt +++ b/Nef_2/doc/Nef_2/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{A Nef polygon is any set that can be obtained from a finite set of open halfspaces by set complement and set intersection operations. Due to the fact that all other binary set operations like union, difference and symmetric difference can be reduced to intersection and complement calculations, Nef polygons are also closed under those operations. Apart from the set complement operation there are more topological unary set operations that are closed in the domain of Nef polygons interior, boundary, and closure.} \PkgSince{2.3} \cgalbib{ cgal:s-bonp2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd Planar Nef Polyhedra are whatever can be constructed with a finite number of diff --git a/Nef_3/doc/Nef_3/PackageDescription.txt b/Nef_3/doc/Nef_3/PackageDescription.txt index c8e580dfd44..ab5273e7206 100644 --- a/Nef_3/doc/Nef_3/PackageDescription.txt +++ b/Nef_3/doc/Nef_3/PackageDescription.txt @@ -12,7 +12,7 @@ \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} \cgalbib{ cgal:hk-bonp3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd A Nef polyhedron is any point set generated from a finite number of diff --git a/Nef_S2/doc/Nef_S2/PackageDescription.txt b/Nef_S2/doc/Nef_S2/PackageDescription.txt index a27255c8d41..ddc72d0a401 100644 --- a/Nef_S2/doc/Nef_S2/PackageDescription.txt +++ b/Nef_S2/doc/Nef_S2/PackageDescription.txt @@ -12,7 +12,7 @@ \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} \cgalbib{ cgal:hk-bonpes2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL"} \PkgDescriptionEnd Nef polyhedra are defined as a subset of the d-dimensional space obtained by diff --git a/Partition_2/doc/Partition_2/PackageDescription.txt b/Partition_2/doc/Partition_2/PackageDescription.txt index 9b36b87e1f3..e0022be5f8c 100644 --- a/Partition_2/doc/Partition_2/PackageDescription.txt +++ b/Partition_2/doc/Partition_2/PackageDescription.txt @@ -12,7 +12,7 @@ \PkgDesc{This package provides functions for partitioning polygons in monotone or convex polygons. The algorithms can produce results with the minimal number of polygons, as well as approximations which have no more than four times the optimal number of convex pieces but they differ in their runtime complexities.} \PkgSince{2.3} \cgalbib{ cgal:h-pp2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd The assertion flags for this package use `PARTITION` in their names diff --git a/Point_set_2/doc/Point_set_2/PackageDescription.txt b/Point_set_2/doc/Point_set_2/PackageDescription.txt index a045b3688d9..75f83e8ff08 100644 --- a/Point_set_2/doc/Point_set_2/PackageDescription.txt +++ b/Point_set_2/doc/Point_set_2/PackageDescription.txt @@ -14,7 +14,7 @@ \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} \cgalbib{ cgal:b-ss2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd The two dimensional point set is a class for geometric queries. It diff --git a/Polytope_distance_d/doc/Polytope_distance_d/PackageDescription.txt b/Polytope_distance_d/doc/Polytope_distance_d/PackageDescription.txt index a662f1848c3..87d5abc35b7 100644 --- a/Polytope_distance_d/doc/Polytope_distance_d/PackageDescription.txt +++ b/Polytope_distance_d/doc/Polytope_distance_d/PackageDescription.txt @@ -10,7 +10,7 @@ \PkgDesc{This package provides algorithms for computing the distance between the convex hulls of two point sets in d-dimensional space, without explicitely constructing the convex hulls. It further provides an algorithm to compute the width of a point set, and the furthest point for each vertex of a convex polygon. } \PkgSince{1.1} \cgalbib{ cgal:fghhs-od-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd The optimization code uses infix `OPTIMISATION` in the assertions, diff --git a/STL_Extension/doc/STL_Extension/PackageDescription.txt b/STL_Extension/doc/STL_Extension/PackageDescription.txt index 09e3402a515..9f77ebfd152 100644 --- a/STL_Extension/doc/STL_Extension/PackageDescription.txt +++ b/STL_Extension/doc/STL_Extension/PackageDescription.txt @@ -10,7 +10,7 @@ \PkgDesc{\cgal is designed in the spirit of the generic programming paradigm to work together with the Standard Template Library (\stl). This package provides non-geometric \stl-like algorithms and datastructures that are not provided in the \stl standard but in \cgal} \PkgSince{1.0} \cgalbib{ cgal:hkpw-se-12 } -\license{ \ref licensesLGPL } +\license{ \ref licensesLGPL "LGPL" } \PkgDescriptionEnd */ diff --git a/Skin_surface_3/doc/Skin_surface_3/PackageDescription.txt b/Skin_surface_3/doc/Skin_surface_3/PackageDescription.txt index 642f4646357..7042a30ae29 100644 --- a/Skin_surface_3/doc/Skin_surface_3/PackageDescription.txt +++ b/Skin_surface_3/doc/Skin_surface_3/PackageDescription.txt @@ -11,7 +11,7 @@ \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} \cgalbib{ cgal:k-ssm3-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd Skin surfaces form a class of tangent continuous surfaces defined by a diff --git a/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt b/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt index 9712953baf0..8530273848e 100644 --- a/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt +++ b/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt @@ -10,7 +10,7 @@ \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} \cgalbib{ cgal:p-sr2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Spatial_searching/doc/Spatial_searching/PackageDescription.txt b/Spatial_searching/doc/Spatial_searching/PackageDescription.txt index 19dc2a10514..e360eac0139 100644 --- a/Spatial_searching/doc/Spatial_searching/PackageDescription.txt +++ b/Spatial_searching/doc/Spatial_searching/PackageDescription.txt @@ -32,7 +32,7 @@ \PkgDesc{This package implements exact and approximate distance browsing by providing exact and approximate algorithms for range searching, k-nearest and k-furthest neighbor searching, as well as incremental nearest and incremental furthest neighbor searching, where the query items are points in dD Euclidean space.} \PkgSince{3.0} \cgalbib{ cgal:tf-ssd-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */ diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/PackageDescription.txt b/Straight_skeleton_2/doc/Straight_skeleton_2/PackageDescription.txt index 7fd4cfe5519..5d6c6752128 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/PackageDescription.txt +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/PackageDescription.txt @@ -12,7 +12,7 @@ \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} \cgalbib{ cgal:c-sspo2-12 } -\license{ \ref licensesGPL } +\license{ \ref licensesGPL "GPL" } \PkgDescriptionEnd */