From fdb7ea6c6b12a74e7ca8f44c1198c50f4a1db7eb Mon Sep 17 00:00:00 2001 From: Laurent Rineau Date: Wed, 28 Sep 2011 16:15:05 +0000 Subject: [PATCH] prepare ccPkgHowToCiteCgal for CGAL-3.10 (in 2012) --- AABB_tree/doc_tex/AABB_tree/PkgDescription.tex | 2 +- .../doc_tex/Algebraic_foundations/PkgDescription.tex | 2 +- .../doc_tex/Algebraic_kernel_d/PkgDescription.tex | 2 +- Alpha_shapes_2/doc_tex/Alpha_shapes_2/PkgDescription.tex | 2 +- Alpha_shapes_3/doc_tex/Alpha_shapes_3/PkgDescription.tex | 2 +- .../doc_tex/Apollonius_graph_2/PkgDescription.tex | 2 +- .../doc_tex/Arrangement_on_surface_2/PkgDescription.tex | 2 +- .../doc_tex/Sweep_line_2/PkgDescription.tex | 2 +- BGL/doc_tex/BGL/PkgDescription.tex | 2 +- .../doc_tex/Boolean_set_operations_2/PkgDescription.tex | 2 +- .../doc_tex/Box_intersection_d/PkgDescription.tex | 2 +- CGAL_ipelets/doc_tex/CGAL_ipelets/PkgDescription.tex | 2 +- Circular_kernel_2/doc_tex/Circular_kernel_2/PkgDescription.tex | 2 +- Circular_kernel_3/doc_tex/Circular_kernel_3/PkgDescription.tex | 2 +- Circulator/doc_tex/Circulator/PkgDescription.tex | 2 +- Combinatorial_map/doc_tex/Combinatorial_map/PkgDescription.tex | 2 +- .../doc_tex/Convex_decomposition_3/PkgDescription.tex | 2 +- Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex | 2 +- Convex_hull_3/doc_tex/Convex_hull_3/PkgDescription.tex | 2 +- Convex_hull_d/doc_tex/Convex_hull_d/PkgDescription.tex | 2 +- Envelope_2/doc_tex/Envelope_2/PkgDescription.tex | 2 +- Envelope_3/doc_tex/Envelope_3/PkgDescription.tex | 2 +- Generator/doc_tex/Generator/PkgDescription.tex | 2 +- Geomview/doc_tex/Geomview/PkgDescription.tex | 2 +- GraphicsView/doc_tex/GraphicsView/PkgDescription.tex | 2 +- HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex | 2 +- Installation/doc_tex/Installation/PkgDescription.tex | 2 +- Interpolation/doc_tex/Interpolation/PkgDescription.tex | 2 +- .../doc_tex/Interval_skip_list/PkgDescription.tex | 2 +- Jet_fitting_3/doc_tex/Jet_fitting_3/PkgDescription.tex | 2 +- Kernel_23/doc_tex/Kernel_23/PkgDescription.tex | 2 +- Kernel_d/doc_tex/Kernel_d/PkgDescription.tex | 2 +- .../doc_tex/Kinetic_data_structures/PkgDescription.tex | 2 +- .../doc_tex/Kinetic_framework/PkgDescription.tex | 2 +- Manual/doc_tex/Introduction/PkgDescription.tex | 2 +- Manual/doc_tex/Miscellany/PkgDescription.tex | 2 +- Manual/doc_tex/Preliminaries/PkgDescription.tex | 2 +- Matrix_search/doc_tex/Matrix_search/PkgDescription.tex | 2 +- Mesh_2/doc_tex/Mesh_2/PkgDescription.tex | 2 +- Mesh_3/doc_tex/Mesh_3/PkgDescription.tex | 2 +- Minkowski_sum_2/doc_tex/Minkowski_sum_2/PkgDescription.tex | 2 +- Minkowski_sum_3/doc_tex/Minkowski_sum_3/PkgDescription.tex | 2 +- .../doc_tex/Modular_arithmetic/PkgDescription.tex | 2 +- Nef_2/doc_tex/Nef_2/PkgDescription.tex | 2 +- Nef_3/doc_tex/Nef_3/PkgDescription.tex | 2 +- Nef_S2/doc_tex/Nef_S2/PkgDescription.tex | 2 +- Number_types/doc_tex/NumberTypeSupport/PkgDescription.tex | 2 +- Optimisation_doc/doc_tex/Bounding_volumes/PkgDescription.tex | 2 +- Optimisation_doc/doc_tex/Inscribed_areas/PkgDescription.tex | 2 +- Partition_2/doc_tex/Partition_2/PkgDescription.tex | 2 +- .../doc_tex/Periodic_3_triangulation_3/PkgDescription.tex | 2 +- Point_set_2/doc_tex/Point_set_2/PkgDescription.tex | 2 +- .../doc_tex/Point_set_processing_3/PkgDescription.tex | 2 +- Point_set_processing_3/doc_tex/Property_map/PkgDescription.tex | 2 +- Polygon/doc_tex/Polygon/PkgDescription.tex | 2 +- Polyhedron/doc_tex/Polyhedron/PkgDescription.tex | 2 +- Polynomial/doc_tex/Polynomial/PkgDescription.tex | 2 +- .../doc_tex/Polytope_distance_d/PkgDescription.tex | 2 +- .../doc_tex/Principal_component_analysis/PkgDescription.tex | 2 +- QP_solver/doc_tex/QP_solver/PkgDescription.tex | 2 +- Ridges_3/doc_tex/Ridges_3/PkgDescription.tex | 2 +- STL_Extension/doc_tex/STL_Extension/PkgDescription.tex | 2 +- SearchStructures/doc_tex/SearchStructures/PkgDescription.tex | 2 +- .../doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex | 2 +- Skin_surface_3/doc_tex/Skin_surface_3/PkgDescription.tex | 2 +- Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex | 2 +- Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex | 2 +- Spatial_sorting/doc_tex/Spatial_sorting/PkgDescription.tex | 2 +- .../doc_tex/Straight_skeleton_2/PkgDescription.tex | 2 +- Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex | 2 +- .../doc_tex/Subdivision_method_3/PkgDescription.tex | 2 +- .../doc_tex/Surface_mesh_parameterization/PkgDescription.tex | 2 +- .../doc_tex/Surface_mesh_simplification/PkgDescription.tex | 2 +- Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex | 2 +- .../doc_tex/Surface_reconstruction_points_3/PkgDescription.tex | 2 +- Triangulation_2/doc_tex/TDS_2/PkgDescription.tex | 2 +- Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex | 2 +- Triangulation_3/doc_tex/TriangulationDS_3/PkgDescription.tex | 2 +- Triangulation_3/doc_tex/Triangulation_3/PkgDescription.tex | 2 +- Voronoi_diagram_2/doc_tex/Voronoi_diagram_2/PkgDescription.tex | 2 +- iostream/doc_tex/IOstream/PkgDescription.tex | 2 +- 81 files changed, 81 insertions(+), 81 deletions(-) diff --git a/AABB_tree/doc_tex/AABB_tree/PkgDescription.tex b/AABB_tree/doc_tex/AABB_tree/PkgDescription.tex index 87277284802..a2b407c92f4 100644 --- a/AABB_tree/doc_tex/AABB_tree/PkgDescription.tex +++ b/AABB_tree/doc_tex/AABB_tree/PkgDescription.tex @@ -1,7 +1,7 @@ \begin{ccPkgDescription}{3D Fast Intersection and Distance Computation (AABB Tree)\label{Pkg:AABB_tree}} \ccPkgSummary{The AABB (axis-aligned bounding box) tree component offers a static data structure and algorithms to perform efficient intersection and distance queries on sets of finite 3D geometric objects.} -\ccPkgHowToCiteCgal{cgal:atw-aabb-11b} +\ccPkgHowToCiteCgal{cgal:atw-aabb-12} \ccPkgIntroducedInCGAL{3.5} \ccPkgDemo{AABB Tree}{AABB_demo.zip} \ccPkgIllustration{AABB_tree/figs/teaser-thumb.png}{AABB_tree/figs/teaser.png} diff --git a/Algebraic_foundations/doc_tex/Algebraic_foundations/PkgDescription.tex b/Algebraic_foundations/doc_tex/Algebraic_foundations/PkgDescription.tex index cdca7ffbfad..68b3509c4d4 100644 --- a/Algebraic_foundations/doc_tex/Algebraic_foundations/PkgDescription.tex +++ b/Algebraic_foundations/doc_tex/Algebraic_foundations/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Algebraic Foundations\label{Pkg:AlgebraicFoundations}} -\ccPkgHowToCiteCgal{cgal:h-af-11b} +\ccPkgHowToCiteCgal{cgal:h-af-12} \ccPkgSummary{ This package defines what algebra means for \cgal, in terms of concepts, classes and functions. The main features are: diff --git a/Algebraic_kernel_d/doc_tex/Algebraic_kernel_d/PkgDescription.tex b/Algebraic_kernel_d/doc_tex/Algebraic_kernel_d/PkgDescription.tex index 0b5636d94e8..8b83998059b 100644 --- a/Algebraic_kernel_d/doc_tex/Algebraic_kernel_d/PkgDescription.tex +++ b/Algebraic_kernel_d/doc_tex/Algebraic_kernel_d/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Algebraic Kernel \label{Pkg:AlgebraicKerneld}} -\ccPkgHowToCiteCgal{cgal:bht-ak-11b} +\ccPkgHowToCiteCgal{cgal:bht-ak-12} \ccPkgSummary{ 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 diff --git a/Alpha_shapes_2/doc_tex/Alpha_shapes_2/PkgDescription.tex b/Alpha_shapes_2/doc_tex/Alpha_shapes_2/PkgDescription.tex index 88abe472263..ab6eea04998 100644 --- a/Alpha_shapes_2/doc_tex/Alpha_shapes_2/PkgDescription.tex +++ b/Alpha_shapes_2/doc_tex/Alpha_shapes_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Alpha Shapes\label{Pkg:AlphaShape2}} -\ccPkgHowToCiteCgal{cgal:d-as2-11b} +\ccPkgHowToCiteCgal{cgal:d-as2-12} \ccPkgSummary{ 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 diff --git a/Alpha_shapes_3/doc_tex/Alpha_shapes_3/PkgDescription.tex b/Alpha_shapes_3/doc_tex/Alpha_shapes_3/PkgDescription.tex index c487ab09f4a..eda97411df6 100644 --- a/Alpha_shapes_3/doc_tex/Alpha_shapes_3/PkgDescription.tex +++ b/Alpha_shapes_3/doc_tex/Alpha_shapes_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Alpha Shapes\label{Pkg:AlphaShapes3}} -\ccPkgHowToCiteCgal{cgal:dy-as3-11b} +\ccPkgHowToCiteCgal{cgal:dy-as3-12} \ccPkgSummary{ This package offers a data structure encoding either one alpha-complex or diff --git a/Apollonius_graph_2/doc_tex/Apollonius_graph_2/PkgDescription.tex b/Apollonius_graph_2/doc_tex/Apollonius_graph_2/PkgDescription.tex index c786519e8e5..2cb7c0f1d17 100644 --- a/Apollonius_graph_2/doc_tex/Apollonius_graph_2/PkgDescription.tex +++ b/Apollonius_graph_2/doc_tex/Apollonius_graph_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Apollonius Graphs (Delaunay Graphs of Disks)\label{Pkg:ApolloniusGraph2}} -\ccPkgHowToCiteCgal{cgal:ky-ag2-11b} +\ccPkgHowToCiteCgal{cgal:ky-ag2-12} \ccPkgSummary{ Algorithms for computing the Apollonius graph in two dimensions. The Apollonius graph is the dual of the diff --git a/Arrangement_on_surface_2/doc_tex/Arrangement_on_surface_2/PkgDescription.tex b/Arrangement_on_surface_2/doc_tex/Arrangement_on_surface_2/PkgDescription.tex index 67bb6dfd762..41e81817667 100644 --- a/Arrangement_on_surface_2/doc_tex/Arrangement_on_surface_2/PkgDescription.tex +++ b/Arrangement_on_surface_2/doc_tex/Arrangement_on_surface_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Arrangement\label{Pkg:Arrangement2}} -\ccPkgHowToCiteCgal{cgal:wfzh-a2-11b} +\ccPkgHowToCiteCgal{cgal:wfzh-a2-12} \ccPkgSummary{ This package can be used to construct, maintain, alter, and display arrangements in the plane. Once an arrangement is constructed, the diff --git a/Arrangement_on_surface_2/doc_tex/Sweep_line_2/PkgDescription.tex b/Arrangement_on_surface_2/doc_tex/Sweep_line_2/PkgDescription.tex index 24c01f93a1c..60295d72ceb 100644 --- a/Arrangement_on_surface_2/doc_tex/Sweep_line_2/PkgDescription.tex +++ b/Arrangement_on_surface_2/doc_tex/Sweep_line_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Intersection of Curves\label{Pkg:IntersectionOfCurves2}} -\ccPkgHowToCiteCgal{cgal:wfz-ic2-11b} +\ccPkgHowToCiteCgal{cgal:wfz-ic2-12} \ccPkgSummary{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 diff --git a/BGL/doc_tex/BGL/PkgDescription.tex b/BGL/doc_tex/BGL/PkgDescription.tex index 0992951b147..0830d769e83 100644 --- a/BGL/doc_tex/BGL/PkgDescription.tex +++ b/BGL/doc_tex/BGL/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{CGAL and the Boost Graph Library\label{Pkg:BGL}} -\ccPkgHowToCiteCgal{cgal:cfw-cbgl-11b} +\ccPkgHowToCiteCgal{cgal:cfw-cbgl-12} \ccPkgSummary{This package provides a framework for interfacing \cgal\ data structures with the algorithms of the {\sc BGL}. It allows to run diff --git a/Boolean_set_operations_2/doc_tex/Boolean_set_operations_2/PkgDescription.tex b/Boolean_set_operations_2/doc_tex/Boolean_set_operations_2/PkgDescription.tex index 3fd6049c201..c57b3a908b3 100644 --- a/Boolean_set_operations_2/doc_tex/Boolean_set_operations_2/PkgDescription.tex +++ b/Boolean_set_operations_2/doc_tex/Boolean_set_operations_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Regularized Boolean Set-Operations\label{Pkg:BooleanSetOperations2}} -\ccPkgHowToCiteCgal{cgal:fwzh-rbso2-11b} +\ccPkgHowToCiteCgal{cgal:fwzh-rbso2-12} \ccPkgSummary{ This package consists of the implementation of Boolean set-operations on point sets bounded by weakly x-monotone curves in 2-dimensional diff --git a/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex b/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex index c60287dfbc9..4a150e7776c 100644 --- a/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex +++ b/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Intersecting Sequences of dD Iso-oriented Boxes\label{Pkg:BoxIntersectionD}} -\ccPkgHowToCiteCgal{cgal:kmz-isiobd-11b} +\ccPkgHowToCiteCgal{cgal:kmz-isiobd-12} \ccPkgSummary{ An efficient algorithm for finding all intersecting pairs for large numbers of iso-oriented boxes, in order to apply a user defined callback diff --git a/CGAL_ipelets/doc_tex/CGAL_ipelets/PkgDescription.tex b/CGAL_ipelets/doc_tex/CGAL_ipelets/PkgDescription.tex index afcedb611ff..5cbc6d285ac 100644 --- a/CGAL_ipelets/doc_tex/CGAL_ipelets/PkgDescription.tex +++ b/CGAL_ipelets/doc_tex/CGAL_ipelets/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{CGAL Ipelets \label{Pkg:CGALIpelets}} -\ccPkgHowToCiteCgal{cgal:lp-gi-11b} +\ccPkgHowToCiteCgal{cgal:lp-gi-12} \ccPkgSummary{This package provides a generic framework to easily write ipelets (plug-in's) using \cgal{} for the the Ipe extensible drawing editor.} diff --git a/Circular_kernel_2/doc_tex/Circular_kernel_2/PkgDescription.tex b/Circular_kernel_2/doc_tex/Circular_kernel_2/PkgDescription.tex index 4b3e378d66b..c29d1e6b7af 100644 --- a/Circular_kernel_2/doc_tex/Circular_kernel_2/PkgDescription.tex +++ b/Circular_kernel_2/doc_tex/Circular_kernel_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Circular Geometry Kernel \label{Pkg:CircularKernel2}} -\ccPkgHowToCiteCgal{cgal:cpt-cgk2-11b} +\ccPkgHowToCiteCgal{cgal:cpt-cgk2-12} \ccPkgSummary{ This package is an extension of the linear \cgal\ kernel. It offers functionalities on circles, circular arcs and line segments in the diff --git a/Circular_kernel_3/doc_tex/Circular_kernel_3/PkgDescription.tex b/Circular_kernel_3/doc_tex/Circular_kernel_3/PkgDescription.tex index e61fc9dd510..b428a855db7 100644 --- a/Circular_kernel_3/doc_tex/Circular_kernel_3/PkgDescription.tex +++ b/Circular_kernel_3/doc_tex/Circular_kernel_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{3D Spherical Geometry Kernel \label{Pkg:SphericalKernel3}} -\ccPkgHowToCiteCgal{cgal:cclt-sgk3-11b} +\ccPkgHowToCiteCgal{cgal:cclt-sgk3-12} \ccPkgSummary{ This package is an extension of the linear \cgal\ Kernel. It offers functionalities on spheres, circles, circular arcs and line segments, diff --git a/Circulator/doc_tex/Circulator/PkgDescription.tex b/Circulator/doc_tex/Circulator/PkgDescription.tex index d7d0b31177c..91c8138b2a2 100644 --- a/Circulator/doc_tex/Circulator/PkgDescription.tex +++ b/Circulator/doc_tex/Circulator/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Handles and Circulators\label{Pkg:HandlesAndCirculators}} -\ccPkgHowToCiteCgal{cgal:dksy-hc-11b} +\ccPkgHowToCiteCgal{cgal:dksy-hc-12} \ccPkgSummary{This package descibes handles and circulators. They are related to iterators. Handles allow to dereference but neither to increment nor to decrement. diff --git a/Combinatorial_map/doc_tex/Combinatorial_map/PkgDescription.tex b/Combinatorial_map/doc_tex/Combinatorial_map/PkgDescription.tex index 8d5c90eae06..c095bf6d79b 100644 --- a/Combinatorial_map/doc_tex/Combinatorial_map/PkgDescription.tex +++ b/Combinatorial_map/doc_tex/Combinatorial_map/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Combinatorial Maps\label{Pkg:CombinatorialMaps}} - \ccPkgHowToCiteCgal{cgal:d-cm-11b} \ccPkgSummary{This package + \ccPkgHowToCiteCgal{cgal:d-cm-12} \ccPkgSummary{This package implements Combinatorial Maps in \emph{d}-dimension. A combinatorial map is a data structure allowing to represent an orientable subdivided object by describing all the cells of the subdivision diff --git a/Convex_decomposition_3/doc_tex/Convex_decomposition_3/PkgDescription.tex b/Convex_decomposition_3/doc_tex/Convex_decomposition_3/PkgDescription.tex index bc1cd60ef54..0af42a30ae1 100644 --- a/Convex_decomposition_3/doc_tex/Convex_decomposition_3/PkgDescription.tex +++ b/Convex_decomposition_3/doc_tex/Convex_decomposition_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Convex Decomposition of Polyhedra\label{Pkg:ConvexDecomposition3}} -\ccPkgHowToCiteCgal{cgal:h-emspe-11b} +\ccPkgHowToCiteCgal{cgal:h-emspe-12} \ccPkgSummary{ This packages provides a function for decomposing a bounded polyhedron into convex sub-polyhedra. The decomposition yields $O(r^2)$ convex diff --git a/Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex b/Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex index 37ec917a7ba..053203f4cb8 100644 --- a/Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex +++ b/Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Convex Hulls and Extreme Points \label{Pkg:ConvexHull2}} -\ccPkgHowToCiteCgal{cgal:hs-chep2-11b} +\ccPkgHowToCiteCgal{cgal:hs-chep2-12} \ccPkgSummary{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 diff --git a/Convex_hull_3/doc_tex/Convex_hull_3/PkgDescription.tex b/Convex_hull_3/doc_tex/Convex_hull_3/PkgDescription.tex index 96d8e33ca6a..c5ff252da5e 100644 --- a/Convex_hull_3/doc_tex/Convex_hull_3/PkgDescription.tex +++ b/Convex_hull_3/doc_tex/Convex_hull_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Convex Hulls\label{Pkg:ConvexHull3}} -\ccPkgHowToCiteCgal{cgal:hs-ch3-11b} +\ccPkgHowToCiteCgal{cgal:hs-ch3-12} \ccPkgSummary{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 diff --git a/Convex_hull_d/doc_tex/Convex_hull_d/PkgDescription.tex b/Convex_hull_d/doc_tex/Convex_hull_d/PkgDescription.tex index bf9edd3dfbd..3086363ab1b 100644 --- a/Convex_hull_d/doc_tex/Convex_hull_d/PkgDescription.tex +++ b/Convex_hull_d/doc_tex/Convex_hull_d/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{dD Convex Hulls and Delaunay Triangulations\label{Pkg:ConvexHullD}} -\ccPkgHowToCiteCgal{cgal:hs-chdt3-11b} +\ccPkgHowToCiteCgal{cgal:hs-chdt3-12} \ccPkgSummary{This package provides functions for computing convex hulls and Delaunay triangulations in $d$-dimensional Euclidean space.} diff --git a/Envelope_2/doc_tex/Envelope_2/PkgDescription.tex b/Envelope_2/doc_tex/Envelope_2/PkgDescription.tex index 544af95212f..6ee33572fbb 100644 --- a/Envelope_2/doc_tex/Envelope_2/PkgDescription.tex +++ b/Envelope_2/doc_tex/Envelope_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Envelopes\label{Pkg:Envelope2}} -\ccPkgHowToCiteCgal{cgal:w-e2-11b} +\ccPkgHowToCiteCgal{cgal:w-e2-12} \ccPkgSummary{ This package consits of functions that computes the lower (or upper) envelope of a set of arbitrary curves in 2D. The output is diff --git a/Envelope_3/doc_tex/Envelope_3/PkgDescription.tex b/Envelope_3/doc_tex/Envelope_3/PkgDescription.tex index 089d6f71632..a78761bac6a 100644 --- a/Envelope_3/doc_tex/Envelope_3/PkgDescription.tex +++ b/Envelope_3/doc_tex/Envelope_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{3D Envelopes\label{Pkg:Envelope3}} -\ccPkgHowToCiteCgal{cgal:mwz-e3-11b} +\ccPkgHowToCiteCgal{cgal:mwz-e3-12} \ccPkgSummary{ This package consits of functions that compute the lower (or upper) envelope of a set of arbitrary surfaces in 3D. The output is diff --git a/Generator/doc_tex/Generator/PkgDescription.tex b/Generator/doc_tex/Generator/PkgDescription.tex index 3a1f8854ae1..462d7e2f1ae 100644 --- a/Generator/doc_tex/Generator/PkgDescription.tex +++ b/Generator/doc_tex/Generator/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Geometric Object Generators\label{Pkg:Generators}} -\ccPkgHowToCiteCgal{cgal:hhk-gog-11b} +\ccPkgHowToCiteCgal{cgal:hhk-gog-12} \ccPkgSummary{This package provides a variety of generators for geometric objects. They are useful as synthetic test data sets, e.g.~for testing diff --git a/Geomview/doc_tex/Geomview/PkgDescription.tex b/Geomview/doc_tex/Geomview/PkgDescription.tex index 2ddd479a69b..d2ffa94302e 100644 --- a/Geomview/doc_tex/Geomview/PkgDescription.tex +++ b/Geomview/doc_tex/Geomview/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Geomview\label{Pkg:Geomview}} -\ccPkgHowToCiteCgal{cgal:fp-gv-11b} +\ccPkgHowToCiteCgal{cgal:fp-gv-12} \ccPkgSummary{ This package implements an interface to Geomview, an interactive 3D viewing program, diff --git a/GraphicsView/doc_tex/GraphicsView/PkgDescription.tex b/GraphicsView/doc_tex/GraphicsView/PkgDescription.tex index 551afa1e8d1..a96abcba59d 100644 --- a/GraphicsView/doc_tex/GraphicsView/PkgDescription.tex +++ b/GraphicsView/doc_tex/GraphicsView/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{CGAL and the Qt Graphics View Framework \label{Pkg:GraphicsView}} -\ccPkgHowToCiteCgal{cgal:fr-cqgvf-11b} +\ccPkgHowToCiteCgal{cgal:fr-cqgvf-12} \ccPkgSummary{This package provides classes for displaying \cgal\ objects and data structures in the \ccAnchor{http://doc.qt.nokia.com/latest/graphicsview.html}{Qt 4 Graphics View Framework}.} diff --git a/HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex b/HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex index e70e2ea67c3..3fb24ce78c1 100644 --- a/HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex +++ b/HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Halfedge Data Structures \label{Pkg:HDS}} -\ccPkgHowToCiteCgal{cgal:k-hds-11b} +\ccPkgHowToCiteCgal{cgal:k-hds-12} \ccPkgSummary{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, diff --git a/Installation/doc_tex/Installation/PkgDescription.tex b/Installation/doc_tex/Installation/PkgDescription.tex index aab7330fd07..9870ace5c78 100644 --- a/Installation/doc_tex/Installation/PkgDescription.tex +++ b/Installation/doc_tex/Installation/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Installation\label{Pkg:Installation}} -\ccPkgHowToCiteCgal{cgal:cr-i-11b} +\ccPkgHowToCiteCgal{cgal:cr-i-12} \ccPkgSummary{ This chapter describes how to install \cgal, and lists the third party libraries on which \cgal\ depends, or for which \cgal\ provides interfaces. diff --git a/Interpolation/doc_tex/Interpolation/PkgDescription.tex b/Interpolation/doc_tex/Interpolation/PkgDescription.tex index 3641d2c9133..f8278032783 100644 --- a/Interpolation/doc_tex/Interpolation/PkgDescription.tex +++ b/Interpolation/doc_tex/Interpolation/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D and Surface Function Interpolation\label{Pkg:Interpolation2}} -\ccPkgHowToCiteCgal{cgal:f-i-11b} +\ccPkgHowToCiteCgal{cgal:f-i-12} \ccPkgSummary{ This package implements different methods for scattered data interpolation: Given measures of a function on a set of discrete data diff --git a/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex b/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex index 3ff37313681..6285657b121 100644 --- a/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex +++ b/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Interval Skip List\label{Pkg:IntervalSkipList}} -\ccPkgHowToCiteCgal{cgal:f-isl-11b} +\ccPkgHowToCiteCgal{cgal:f-isl-12} \ccPkgSummary{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 diff --git a/Jet_fitting_3/doc_tex/Jet_fitting_3/PkgDescription.tex b/Jet_fitting_3/doc_tex/Jet_fitting_3/PkgDescription.tex index b73cb366842..3165ad51ed0 100644 --- a/Jet_fitting_3/doc_tex/Jet_fitting_3/PkgDescription.tex +++ b/Jet_fitting_3/doc_tex/Jet_fitting_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Estimation of Local Differential Properties \label{Pkg:Jet_fitting_3}} -\ccPkgHowToCiteCgal{cgal:pc-eldp-11b} +\ccPkgHowToCiteCgal{cgal:pc-eldp-12} \ccPkgSummary{For a surface discretized as a point cloud or a mesh, it is desirable to estimate pointwise differential quantities. More diff --git a/Kernel_23/doc_tex/Kernel_23/PkgDescription.tex b/Kernel_23/doc_tex/Kernel_23/PkgDescription.tex index 86393609ac1..eb3ba91e7a9 100644 --- a/Kernel_23/doc_tex/Kernel_23/PkgDescription.tex +++ b/Kernel_23/doc_tex/Kernel_23/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D and 3D Linear Geometry Kernel\label{Pkg:Kernel23}} -\ccPkgHowToCiteCgal{cgal:bfghhkps-lgk23-11b} +\ccPkgHowToCiteCgal{cgal:bfghhkps-lgk23-12} \ccPkgSummary{ This package contains kernels each containing objects of constant size, such as point, vector, direction, line, ray, segment, circle as well as predicates and constructions for these objects. The kernels diff --git a/Kernel_d/doc_tex/Kernel_d/PkgDescription.tex b/Kernel_d/doc_tex/Kernel_d/PkgDescription.tex index 5f69ab91fa8..6a3b3b97d72 100644 --- a/Kernel_d/doc_tex/Kernel_d/PkgDescription.tex +++ b/Kernel_d/doc_tex/Kernel_d/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{dD Geometry Kernel\label{Pkg:KernelD}} -\ccPkgHowToCiteCgal{cgal:s-gkd-11b} +\ccPkgHowToCiteCgal{cgal:s-gkd-12} \ccPkgSummary{The dD Kernel contains objects of constant size, such as point, vector, direction, line, ray, segment, circle in d dimensional Euclidean space, as well as predicates and constructions for these objects.} diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/PkgDescription.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/PkgDescription.tex index 33b14390475..f806f6d649a 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/PkgDescription.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Kinetic Data Structures\label{Pkg:Kds}} -\ccPkgHowToCiteCgal{cgal:r-kds-11b} +\ccPkgHowToCiteCgal{cgal:r-kds-12} \ccPkgSummary{ Kinetic data structures allow combinatorial structures to be maintained as the primitives move. The package provides implementations of kinetic data structures for Delaunay triangulations diff --git a/Kinetic_data_structures/doc_tex/Kinetic_framework/PkgDescription.tex b/Kinetic_data_structures/doc_tex/Kinetic_framework/PkgDescription.tex index 63d1385fc18..578deb2a3d2 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_framework/PkgDescription.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_framework/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Kinetic Framework\label{Pkg:KdsFramework}} -\ccPkgHowToCiteCgal{cgal:r-kdsf-11b} +\ccPkgHowToCiteCgal{cgal:r-kdsf-12} \ccPkgSummary{ Kinetic data structures allow combinatorial geometric structures to be maintained as the primitives move. The package provides a framework to diff --git a/Manual/doc_tex/Introduction/PkgDescription.tex b/Manual/doc_tex/Introduction/PkgDescription.tex index fb70a08814e..0fd05d0dee3 100644 --- a/Manual/doc_tex/Introduction/PkgDescription.tex +++ b/Manual/doc_tex/Introduction/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Introduction\label{Pkg:GeneralIntroduction}} -\ccPkgHowToCiteCgal{cgal:eb-gi-11b} +\ccPkgHowToCiteCgal{cgal:eb-gi-12} \ccPkgSummary{ This chapter explains how the manual is organized, presents a ``Hello World'' program, and gives recommendations for further readings.} diff --git a/Manual/doc_tex/Miscellany/PkgDescription.tex b/Manual/doc_tex/Miscellany/PkgDescription.tex index 9d54b18e067..b586ee49dd6 100644 --- a/Manual/doc_tex/Miscellany/PkgDescription.tex +++ b/Manual/doc_tex/Miscellany/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Profiling tools, Hash Map, Union-find, Modifiers \label{Pkg:ProfilingTools}} -\ccPkgHowToCiteCgal{cgal:kps-pthum-11b} +\ccPkgHowToCiteCgal{cgal:kps-pthum-12} \ccPkgSummary{This package provides classes for profiling time and memory consumption, a hash map, a union find data structure and a modifier.} diff --git a/Manual/doc_tex/Preliminaries/PkgDescription.tex b/Manual/doc_tex/Preliminaries/PkgDescription.tex index d491779b3a2..c07f6673cd6 100644 --- a/Manual/doc_tex/Preliminaries/PkgDescription.tex +++ b/Manual/doc_tex/Preliminaries/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Preliminaries\label{Pkg:Preliminaries}} -\ccPkgHowToCiteCgal{cgal:eb-gi-11b} +\ccPkgHowToCiteCgal{cgal:eb-gi-12} \ccPkgSummary{ This chapter lists the licenses under which the \cgal\ datastructures and algorithms are distributed, diff --git a/Matrix_search/doc_tex/Matrix_search/PkgDescription.tex b/Matrix_search/doc_tex/Matrix_search/PkgDescription.tex index 8b046ce7569..785a41d8f66 100644 --- a/Matrix_search/doc_tex/Matrix_search/PkgDescription.tex +++ b/Matrix_search/doc_tex/Matrix_search/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Monotone and Sorted Matrix Search \label{Pkg:MatrixSearch}} -\ccPkgHowToCiteCgal{cgal:h-msms-11b} +\ccPkgHowToCiteCgal{cgal:h-msms-12} \ccPkgSummary{ This package provides a matrix search framework, which is the underlying technique for the computation of all furthest neighbors for the vertices of a convex polygon, diff --git a/Mesh_2/doc_tex/Mesh_2/PkgDescription.tex b/Mesh_2/doc_tex/Mesh_2/PkgDescription.tex index 86763691112..aceb220df9b 100644 --- a/Mesh_2/doc_tex/Mesh_2/PkgDescription.tex +++ b/Mesh_2/doc_tex/Mesh_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Conforming Triangulations and Meshes\label{Pkg:Mesh2}} -\ccPkgHowToCiteCgal{cgal:r-ctm2-11b} +\ccPkgHowToCiteCgal{cgal:r-ctm2-12} \ccPkgSummary{ This package implements a Delaunay refinement algorithm to construct conforming triangulations and 2D meshes. diff --git a/Mesh_3/doc_tex/Mesh_3/PkgDescription.tex b/Mesh_3/doc_tex/Mesh_3/PkgDescription.tex index c5139604613..5fa2e000d52 100644 --- a/Mesh_3/doc_tex/Mesh_3/PkgDescription.tex +++ b/Mesh_3/doc_tex/Mesh_3/PkgDescription.tex @@ -13,7 +13,7 @@ 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. } -\ccPkgHowToCiteCgal{cgal:rty-m3-11b} +\ccPkgHowToCiteCgal{cgal:rty-m3-12} \ccPkgDependsOn{\ccRef[3D Triangulations]{Pkg:Triangulation3}, \ccRef[2D Meshes]{Pkg:Mesh2}, \ccRef[3D Surface Mesh Generation]{Pkg:SurfaceMesher3} diff --git a/Minkowski_sum_2/doc_tex/Minkowski_sum_2/PkgDescription.tex b/Minkowski_sum_2/doc_tex/Minkowski_sum_2/PkgDescription.tex index 5ab62b53c63..bf663c22197 100644 --- a/Minkowski_sum_2/doc_tex/Minkowski_sum_2/PkgDescription.tex +++ b/Minkowski_sum_2/doc_tex/Minkowski_sum_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Minkowski Sums\label{Pkg:MinkowskiSum2}} -\ccPkgHowToCiteCgal{cgal:w-rms2-11b} +\ccPkgHowToCiteCgal{cgal:w-rms2-12} \ccPkgSummary{ This package consists of functions that compute the Minkowski sum of two simple straight-edge polygons in the plane. It also contains diff --git a/Minkowski_sum_3/doc_tex/Minkowski_sum_3/PkgDescription.tex b/Minkowski_sum_3/doc_tex/Minkowski_sum_3/PkgDescription.tex index 24deafceda0..824e7bb5a0c 100644 --- a/Minkowski_sum_3/doc_tex/Minkowski_sum_3/PkgDescription.tex +++ b/Minkowski_sum_3/doc_tex/Minkowski_sum_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{3D Minkowski Sum of Polyhedra\label{Pkg:MinkowskiSum3}} -\ccPkgHowToCiteCgal{cgal:h-msp3-11b} +\ccPkgHowToCiteCgal{cgal:h-msp3-12} \ccPkgSummary{ This package provides a function, which computes the Minkowski sum of two point sets in $\mathbb{R}^3$. These point sets may consist of diff --git a/Modular_arithmetic/doc_tex/Modular_arithmetic/PkgDescription.tex b/Modular_arithmetic/doc_tex/Modular_arithmetic/PkgDescription.tex index 4811b26f562..9103e40d673 100644 --- a/Modular_arithmetic/doc_tex/Modular_arithmetic/PkgDescription.tex +++ b/Modular_arithmetic/doc_tex/Modular_arithmetic/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Modular Arithmetic \label{Pkg:ModularArithmetic}} -\ccPkgHowToCiteCgal{cgal:h-ma-11b} +\ccPkgHowToCiteCgal{cgal:h-ma-12} \ccPkgSummary{ This package provides arithmetic over finite fields. The provided tools are in particular useful for filters based on diff --git a/Nef_2/doc_tex/Nef_2/PkgDescription.tex b/Nef_2/doc_tex/Nef_2/PkgDescription.tex index 01fbf6ea602..b69cb0ad07f 100644 --- a/Nef_2/doc_tex/Nef_2/PkgDescription.tex +++ b/Nef_2/doc_tex/Nef_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Boolean Operations on Nef Polygons \label{Pkg:Nef2}} -\ccPkgHowToCiteCgal{cgal:s-bonp2-11b} +\ccPkgHowToCiteCgal{cgal:s-bonp2-12} \ccPkgSummary{ A Nef polygon is any set that can be obtained from a finite set of open halfspaces by set complement and set intersection diff --git a/Nef_3/doc_tex/Nef_3/PkgDescription.tex b/Nef_3/doc_tex/Nef_3/PkgDescription.tex index 2a20a17fd9a..ba12ed3c7cd 100644 --- a/Nef_3/doc_tex/Nef_3/PkgDescription.tex +++ b/Nef_3/doc_tex/Nef_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Boolean Operations on Nef Polyhedra\label{Pkg:Nef3}} -\ccPkgHowToCiteCgal{cgal:hk-bonp3-11b} +\ccPkgHowToCiteCgal{cgal:hk-bonp3-12} \ccPkgSummary{ 3D Nef polyhedra, are a boundary representation for cell-complexes bounded by halfspaces that diff --git a/Nef_S2/doc_tex/Nef_S2/PkgDescription.tex b/Nef_S2/doc_tex/Nef_S2/PkgDescription.tex index c528d6a69c4..88923d5e1c9 100644 --- a/Nef_S2/doc_tex/Nef_S2/PkgDescription.tex +++ b/Nef_S2/doc_tex/Nef_S2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Boolean Operations on Nef Polygons Embedded on the Sphere \label{Pkg:NefS2}} -\ccPkgHowToCiteCgal{cgal:hk-bonpes2-11b} +\ccPkgHowToCiteCgal{cgal:hk-bonpes2-12} \ccPkgSummary{This package offers the equivalent to 2D Nef Polygons in the plane. Here halfplanes correspond to half spheres delimited by great circles. } diff --git a/Number_types/doc_tex/NumberTypeSupport/PkgDescription.tex b/Number_types/doc_tex/NumberTypeSupport/PkgDescription.tex index 28f8c6132b4..7242a3f316c 100644 --- a/Number_types/doc_tex/NumberTypeSupport/PkgDescription.tex +++ b/Number_types/doc_tex/NumberTypeSupport/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Number Types\label{Pkg:NumberTypes}} -\ccPkgHowToCiteCgal{cgal:hhkps-nt-11b} +\ccPkgHowToCiteCgal{cgal:hhkps-nt-12} \ccPkgSummary{ This package provides number type concepts as well as number type classes and wrapper classes for third party number type libraries. diff --git a/Optimisation_doc/doc_tex/Bounding_volumes/PkgDescription.tex b/Optimisation_doc/doc_tex/Bounding_volumes/PkgDescription.tex index d859820b689..7eee3702852 100644 --- a/Optimisation_doc/doc_tex/Bounding_volumes/PkgDescription.tex +++ b/Optimisation_doc/doc_tex/Bounding_volumes/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Bounding Volumes \label{Pkg:BoundingVolumes}} - \ccPkgHowToCiteCgal{cgal:fghhs-bv-11b} + \ccPkgHowToCiteCgal{cgal:fghhs-bv-12} \ccPkgSummary{ This package provides algorithms for computing optimal bounding volumes of point sets. In d-dimensional space, the smallest enclosing sphere, diff --git a/Optimisation_doc/doc_tex/Inscribed_areas/PkgDescription.tex b/Optimisation_doc/doc_tex/Inscribed_areas/PkgDescription.tex index 71cee9eb5bb..6dce5cc1213 100644 --- a/Optimisation_doc/doc_tex/Inscribed_areas/PkgDescription.tex +++ b/Optimisation_doc/doc_tex/Inscribed_areas/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Inscribed Areas \label{Pkg:InscribedAreas}} -\ccPkgHowToCiteCgal{cgal:hp-ia-11b} +\ccPkgHowToCiteCgal{cgal:hp-ia-12} \ccPkgSummary{ This package provides algorithms for computing inscribed areas. The algorithms for computing inscribed areas are: the largest inscribed diff --git a/Partition_2/doc_tex/Partition_2/PkgDescription.tex b/Partition_2/doc_tex/Partition_2/PkgDescription.tex index f0a74544cfc..6cdcb566a85 100644 --- a/Partition_2/doc_tex/Partition_2/PkgDescription.tex +++ b/Partition_2/doc_tex/Partition_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Polygon Partitioning \label{Pkg:PolygonPartitioning2}} -\ccPkgHowToCiteCgal{cgal:h-pp2-11b} +\ccPkgHowToCiteCgal{cgal:h-pp2-12} \ccPkgSummary{This package provides functions for partitioning polygons in monotone or convex polygons. The algorithms can produce results with the minimal number of diff --git a/Periodic_3_triangulation_3/doc_tex/Periodic_3_triangulation_3/PkgDescription.tex b/Periodic_3_triangulation_3/doc_tex/Periodic_3_triangulation_3/PkgDescription.tex index 8d864278e8d..d6dc002b36f 100644 --- a/Periodic_3_triangulation_3/doc_tex/Periodic_3_triangulation_3/PkgDescription.tex +++ b/Periodic_3_triangulation_3/doc_tex/Periodic_3_triangulation_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{3D Periodic Triangulations\label{Pkg:Periodic3Triangulation3}} -\ccPkgHowToCiteCgal{cgal:ct-pt3-11b} +\ccPkgHowToCiteCgal{cgal:ct-pt3-12} \ccPkgSummary{ This package allows to build and handle triangulations of point sets in the three dimensional flat torus. Triangulations are built diff --git a/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex b/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex index 69ad4b8a127..95134bd1f5e 100644 --- a/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex +++ b/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Range and Neighbor Search\label{Pkg:PointSet2}} -\ccPkgHowToCiteCgal{cgal:b-ss2-11b} +\ccPkgHowToCiteCgal{cgal:b-ss2-12} \ccPkgSummary{ This package supports circular, triangular, and isorectangular range search queries as well as (k) nearest neighbor search queries on 2D point sets. diff --git a/Point_set_processing_3/doc_tex/Point_set_processing_3/PkgDescription.tex b/Point_set_processing_3/doc_tex/Point_set_processing_3/PkgDescription.tex index a2d7c0d58cc..4652fba2613 100644 --- a/Point_set_processing_3/doc_tex/Point_set_processing_3/PkgDescription.tex +++ b/Point_set_processing_3/doc_tex/Point_set_processing_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Point Set Processing\label{Pkg:PointSetProcessing}} -\ccPkgHowToCiteCgal{cgal:ass-psp-11b} +\ccPkgHowToCiteCgal{cgal:ass-psp-12} \ccPkgSummary{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 diff --git a/Point_set_processing_3/doc_tex/Property_map/PkgDescription.tex b/Point_set_processing_3/doc_tex/Property_map/PkgDescription.tex index bda4ed47191..f652fc39847 100644 --- a/Point_set_processing_3/doc_tex/Property_map/PkgDescription.tex +++ b/Point_set_processing_3/doc_tex/Property_map/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{CGAL and Boost Property Maps\label{Pkg:Property_map}} -\ccPkgHowToCiteCgal{cgal:fs-cbpm-11b} +\ccPkgHowToCiteCgal{cgal:fs-cbpm-12} \ccPkgSummary{This package provides a framework for interfacing \cgal\ data structures with algorithms expecting Boost Property Maps.} diff --git a/Polygon/doc_tex/Polygon/PkgDescription.tex b/Polygon/doc_tex/Polygon/PkgDescription.tex index 75ad2883c30..221320d1ca5 100644 --- a/Polygon/doc_tex/Polygon/PkgDescription.tex +++ b/Polygon/doc_tex/Polygon/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Polygon\label{Pkg:Polygon2}} -\ccPkgHowToCiteCgal{cgal:gw-p2-11b} +\ccPkgHowToCiteCgal{cgal:gw-p2-12} \ccPkgSummary{ This package provides a 2D polygon class and operations on sequences diff --git a/Polyhedron/doc_tex/Polyhedron/PkgDescription.tex b/Polyhedron/doc_tex/Polyhedron/PkgDescription.tex index 3399b0b8279..443d898f06b 100644 --- a/Polyhedron/doc_tex/Polyhedron/PkgDescription.tex +++ b/Polyhedron/doc_tex/Polyhedron/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Polyhedral Surface \label{Pkg:Polyhedron}} -\ccPkgHowToCiteCgal{cgal:k-ps-11b} +\ccPkgHowToCiteCgal{cgal:k-ps-12} \ccPkgSummary{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 diff --git a/Polynomial/doc_tex/Polynomial/PkgDescription.tex b/Polynomial/doc_tex/Polynomial/PkgDescription.tex index 2425d4ca321..3879dcb91b8 100644 --- a/Polynomial/doc_tex/Polynomial/PkgDescription.tex +++ b/Polynomial/doc_tex/Polynomial/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Polynomial \label{Pkg:Polynomial}} -\ccPkgHowToCiteCgal{cgal:h-p-11b} +\ccPkgHowToCiteCgal{cgal:h-p-12} \ccPkgSummary{ This package introduces a concept for univariate and multivariate polynomials in $d$ variables. Though the concept is written for an arbitrary diff --git a/Polytope_distance_d/doc_tex/Polytope_distance_d/PkgDescription.tex b/Polytope_distance_d/doc_tex/Polytope_distance_d/PkgDescription.tex index fca4689eb87..5c4ff688eb7 100644 --- a/Polytope_distance_d/doc_tex/Polytope_distance_d/PkgDescription.tex +++ b/Polytope_distance_d/doc_tex/Polytope_distance_d/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Optimal Distances \label{Pkg:OptimalDistances}} -\ccPkgHowToCiteCgal{cgal:fghhs-od-11b} +\ccPkgHowToCiteCgal{cgal:fghhs-od-12} \ccPkgSummary{ This package provides algorithms for computing the distance between the convex hulls of two point sets in d-dimensional space, without diff --git a/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex b/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex index 8e5901e03d7..a2e64eacaf3 100644 --- a/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex +++ b/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Principal Component Analysis\label{Pkg:PrincipalComponentAnalysisD}} -\ccPkgHowToCiteCgal{cgal:ap-pcad-11b} +\ccPkgHowToCiteCgal{cgal:ap-pcad-12} \ccPkgSummary{This package provides functions to compute global information about the shape of a set of 2D or 3D objects. It provides the computation of axis-aligned bounding boxes for point sets, and barycenters of weighted point sets. In addition, it provides computation of centroids (center of mass) and linear least squares fitting for point sets as well as for sets of other bounded objects. More specifically, it is possible to fit 2D lines to 2D segments, circles, disks, iso rectangles and triangles, as well as to fit 3D lines or 3D planes to 3D segments, triangles, iso cuboids, tetrahedra, spheres and balls. The common interface to these functions takes an iterator range of objects.} %\ccPkgDependsOn{} diff --git a/QP_solver/doc_tex/QP_solver/PkgDescription.tex b/QP_solver/doc_tex/QP_solver/PkgDescription.tex index 782e98e64e8..57347a60381 100644 --- a/QP_solver/doc_tex/QP_solver/PkgDescription.tex +++ b/QP_solver/doc_tex/QP_solver/PkgDescription.tex @@ -1,7 +1,7 @@ \begin{ccPkgDescription}{Linear and Quadratic Programming Solver \label{Pkg:QPSolver}} -\ccPkgHowToCiteCgal{cgal:fgsw-lqps-11b} +\ccPkgHowToCiteCgal{cgal:fgsw-lqps-12} \ccPkgSummary{This package contains algorithms for minimizing linear and convex quadratic functions over polyhedral domains, described by linear equations and inequalities. The algorithms are exact, i.e. the solution diff --git a/Ridges_3/doc_tex/Ridges_3/PkgDescription.tex b/Ridges_3/doc_tex/Ridges_3/PkgDescription.tex index fb4e4b577c8..67b40592da6 100644 --- a/Ridges_3/doc_tex/Ridges_3/PkgDescription.tex +++ b/Ridges_3/doc_tex/Ridges_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Approximation of Ridges and Umbilics on Triangulated Surface Meshes \label{Pkg:Ridges_3}} - \ccPkgHowToCiteCgal{cgal:cp-arutsm-11b} + \ccPkgHowToCiteCgal{cgal:cp-arutsm-12} \ccPkgSummary{Global features related to curvature extrema encode important informations used in segmentation, registration, diff --git a/STL_Extension/doc_tex/STL_Extension/PkgDescription.tex b/STL_Extension/doc_tex/STL_Extension/PkgDescription.tex index 374818d390d..fdcbfa54a7d 100644 --- a/STL_Extension/doc_tex/STL_Extension/PkgDescription.tex +++ b/STL_Extension/doc_tex/STL_Extension/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{STL Extensions for CGAL\label{Pkg:StlExtension}} -\ccPkgHowToCiteCgal{cgal:hkpw-se-11b} +\ccPkgHowToCiteCgal{cgal:hkpw-se-12} \ccPkgSummary{\cgal\ is designed in the spirit of the generic programming paradigm to work together with the Standard Template Library (\stl). This package provides diff --git a/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex b/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex index c60960fd050..e790f81d06d 100644 --- a/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex +++ b/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{dD Range and Segment Trees \label{Pkg:RangeSegmentTreesD}} -\ccPkgHowToCiteCgal{cgal:n-rstd-11b} +\ccPkgHowToCiteCgal{cgal:n-rstd-12} \ccPkgSummary{Range and segment trees allow to perform window queries on point sets, and to enumerate all ranges enclosing a query point. The provided data structures are static and they are optimized for fast queries.} diff --git a/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex b/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex index e600db40793..df96af54c8a 100644 --- a/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex +++ b/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Segment Delaunay Graphs \label{Pkg:SegmentDelaunayGraph2}} -\ccPkgHowToCiteCgal{cgal:k-sdg2-11b} +\ccPkgHowToCiteCgal{cgal:k-sdg2-12} \ccPkgSummary{ 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 diff --git a/Skin_surface_3/doc_tex/Skin_surface_3/PkgDescription.tex b/Skin_surface_3/doc_tex/Skin_surface_3/PkgDescription.tex index 5cc14ba1e8b..5d9a610ead9 100644 --- a/Skin_surface_3/doc_tex/Skin_surface_3/PkgDescription.tex +++ b/Skin_surface_3/doc_tex/Skin_surface_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{3D Skin Surface Meshing \label{Pkg:SkinSurface3}} -\ccPkgHowToCiteCgal{cgal:k-ssm3-11b} +\ccPkgHowToCiteCgal{cgal:k-ssm3-12} \ccPkgSummary{ % This package allows to build a triangular mesh of a skin surface. Skin surfaces are used for modeling large molecules in biological diff --git a/Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex b/Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex index 839a299f93d..7cf4b75e4d7 100644 --- a/Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex +++ b/Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Snap Rounding \label{Pkg:SnapRounding2}} -\ccPkgHowToCiteCgal{cgal:p-sr2-11b} +\ccPkgHowToCiteCgal{cgal:p-sr2-12} \ccPkgSummary{ Snap Rounding is a well known method for converting arbitrary-precision arrangements of segments into a fixed-precision diff --git a/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex b/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex index 422acb79ca1..ba5ca7d375e 100644 --- a/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex +++ b/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{dD Spatial Searching\label{Pkg:SpatialSearchingD}} -\ccPkgHowToCiteCgal{cgal:tf-ssd-11b} +\ccPkgHowToCiteCgal{cgal:tf-ssd-12} \ccPkgSummary{ This package implements exact and approximate distance browsing by diff --git a/Spatial_sorting/doc_tex/Spatial_sorting/PkgDescription.tex b/Spatial_sorting/doc_tex/Spatial_sorting/PkgDescription.tex index f7853960e77..12e611e70dc 100644 --- a/Spatial_sorting/doc_tex/Spatial_sorting/PkgDescription.tex +++ b/Spatial_sorting/doc_tex/Spatial_sorting/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Spatial Sorting \label{Pkg:SpatialSorting}} -\ccPkgHowToCiteCgal{cgal:d-ss-11b} +\ccPkgHowToCiteCgal{cgal:d-ss-12} \ccPkgSummary{This package provides functions for sorting geometric objects in two, three and higher dimensions, in order to improve efficiency of incremental geometric algorithms.} diff --git a/Straight_skeleton_2/doc_tex/Straight_skeleton_2/PkgDescription.tex b/Straight_skeleton_2/doc_tex/Straight_skeleton_2/PkgDescription.tex index 65d90ced946..fbaeca1308e 100644 --- a/Straight_skeleton_2/doc_tex/Straight_skeleton_2/PkgDescription.tex +++ b/Straight_skeleton_2/doc_tex/Straight_skeleton_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Straight Skeleton and Polygon Offsetting \label{Pkg:StraightSkeleton2}} -\ccPkgHowToCiteCgal{cgal:c-sspo2-11b} +\ccPkgHowToCiteCgal{cgal:c-sspo2-12} \ccPkgSummary{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 diff --git a/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex b/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex index 1efa8e64f24..6fe29d1e7c8 100644 --- a/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex +++ b/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Placement of Streamlines\label{Pkg:PlacementOfStreamlines2}} -\ccPkgHowToCiteCgal{cgal:m-ps-11b} +\ccPkgHowToCiteCgal{cgal:m-ps-12} \ccPkgSummary{ Visualizing vector fields is important for many application domains. A good way to do it is to generate streamlines that describe the flow diff --git a/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex b/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex index f4670b9c01b..4325ffc9965 100644 --- a/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex +++ b/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Surface Subdivision Methods\label{Pkg:SurfaceSubdivisionMethods3}} -\ccPkgHowToCiteCgal{cgal:s-ssm2-11b} +\ccPkgHowToCiteCgal{cgal:s-ssm2-12} \ccPkgSummary{ Subdivision methods recursively refine a control mesh and generate points approximating the limit surface. This package consists of four diff --git a/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex b/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex index c4ca0864d4e..74f40a625e5 100644 --- a/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex +++ b/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Planar Parameterization of Triangulated Surface Meshes\label{Pkg:SurfaceParameterization}} -\ccPkgHowToCiteCgal{cgal:sal-pptsm2-11b} +\ccPkgHowToCiteCgal{cgal:sal-pptsm2-12} \ccPkgSummary{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 diff --git a/Surface_mesh_simplification/doc_tex/Surface_mesh_simplification/PkgDescription.tex b/Surface_mesh_simplification/doc_tex/Surface_mesh_simplification/PkgDescription.tex index 8d6792c1377..5889b4af5d1 100644 --- a/Surface_mesh_simplification/doc_tex/Surface_mesh_simplification/PkgDescription.tex +++ b/Surface_mesh_simplification/doc_tex/Surface_mesh_simplification/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Triangulated Surface Mesh Simplification\label{Pkg:SurfaceMeshSimplification}} -\ccPkgHowToCiteCgal{cgal:c-tsms-11b} +\ccPkgHowToCiteCgal{cgal:c-tsms-12} \ccPkgSummary{This package provides an algorithm to simplify a triangulated surface mesh by edge collapsing. It is an implementation of the Turk/Lindstrom {\em memoryless} mesh simplification algorithm.} diff --git a/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex b/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex index f7aec137255..6d03d03225b 100644 --- a/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex +++ b/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Surface Mesh Generation\label{Pkg:SurfaceMesher3}} -\ccPkgHowToCiteCgal{cgal:ry-smg-11b} +\ccPkgHowToCiteCgal{cgal:ry-smg-12} \ccPkgSummary{ This package provides functions to generate surface meshes that interpolate diff --git a/Surface_reconstruction_points_3/doc_tex/Surface_reconstruction_points_3/PkgDescription.tex b/Surface_reconstruction_points_3/doc_tex/Surface_reconstruction_points_3/PkgDescription.tex index 17c8bed4983..f879a0dac5d 100644 --- a/Surface_reconstruction_points_3/doc_tex/Surface_reconstruction_points_3/PkgDescription.tex +++ b/Surface_reconstruction_points_3/doc_tex/Surface_reconstruction_points_3/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{Surface Reconstruction from Point Sets\label{Pkg:SurfaceReconstructionFromPointSets}} -\ccPkgHowToCiteCgal{cgal:asg-srps-11b} +\ccPkgHowToCiteCgal{cgal:asg-srps-12} \ccPkgSummary{ 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. } \ccPkgDependsOn{\ccThirdPartyTaucs} diff --git a/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex b/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex index 64554b0fbad..0cfc9a9fde3 100644 --- a/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex +++ b/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Triangulation Data Structure \label{Pkg:TDS2}} -\ccPkgHowToCiteCgal{cgal:py-tds2-11b} +\ccPkgHowToCiteCgal{cgal:py-tds2-12} \ccPkgSummary{ This package provides a data structure to store a two-dimensional triangulation that has the topology of a two-dimensional sphere. diff --git a/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex b/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex index c749c411611..911aeda5ffe 100644 --- a/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex +++ b/Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Triangulation \label{Pkg:Triangulation2}} -\ccPkgHowToCiteCgal{cgal:y-t2-11b} +\ccPkgHowToCiteCgal{cgal:y-t2-12} \ccPkgSummary{This package allows to build and handle various triangulations for point sets two dimensions. Any \cgal\ triangulation covers the convex hull of its diff --git a/Triangulation_3/doc_tex/TriangulationDS_3/PkgDescription.tex b/Triangulation_3/doc_tex/TriangulationDS_3/PkgDescription.tex index 2a891aae736..a30adb48ade 100644 --- a/Triangulation_3/doc_tex/TriangulationDS_3/PkgDescription.tex +++ b/Triangulation_3/doc_tex/TriangulationDS_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Triangulation Data Structure \label{Pkg:TDS3}} -\ccPkgHowToCiteCgal{cgal:pt-tds3-11b} +\ccPkgHowToCiteCgal{cgal:pt-tds3-12} \ccPkgSummary{ This package provides a data structure to store a three-dimensional triangulation that has the topology of a three-dimensional sphere. diff --git a/Triangulation_3/doc_tex/Triangulation_3/PkgDescription.tex b/Triangulation_3/doc_tex/Triangulation_3/PkgDescription.tex index d4d1920f385..5292f8e11bc 100644 --- a/Triangulation_3/doc_tex/Triangulation_3/PkgDescription.tex +++ b/Triangulation_3/doc_tex/Triangulation_3/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{3D Triangulations\label{Pkg:Triangulation3}} -\ccPkgHowToCiteCgal{cgal:pt-t3-11b} +\ccPkgHowToCiteCgal{cgal:pt-t3-12} \ccPkgSummary{ This package allows to build and handle triangulations for point sets in three dimensions. diff --git a/Voronoi_diagram_2/doc_tex/Voronoi_diagram_2/PkgDescription.tex b/Voronoi_diagram_2/doc_tex/Voronoi_diagram_2/PkgDescription.tex index 9067dace5ea..56c6c55e016 100644 --- a/Voronoi_diagram_2/doc_tex/Voronoi_diagram_2/PkgDescription.tex +++ b/Voronoi_diagram_2/doc_tex/Voronoi_diagram_2/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{2D Voronoi Diagram Adaptor \label{Pkg:VoronoiDiagramAdaptor2}} -\ccPkgHowToCiteCgal{cgal:k-vda2-11b} +\ccPkgHowToCiteCgal{cgal:k-vda2-12} \ccPkgSummary{ The 2D Voronoi diagram adaptor package provides an adaptor that adapts a 2-dimensional triangulated Delaunay graph to the corresponding diff --git a/iostream/doc_tex/IOstream/PkgDescription.tex b/iostream/doc_tex/IOstream/PkgDescription.tex index 0efb388aa65..d4c74fda858 100644 --- a/iostream/doc_tex/IOstream/PkgDescription.tex +++ b/iostream/doc_tex/IOstream/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{IO Streams\label{Pkg:IOstreams}} -\ccPkgHowToCiteCgal{cgal:fgk-ios-11b} +\ccPkgHowToCiteCgal{cgal:fgk-ios-12} \ccPkgSummary{All classes in the \cgal\ kernel provide input and output operators for IO streams.