From 0e3d6b814392fec7bc9821314c946d82129b2000 Mon Sep 17 00:00:00 2001 From: Andreas Meyer Date: Thu, 4 May 2006 12:28:44 +0000 Subject: [PATCH] manual bugfix (ccHowToCiteCgal) --- 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 +- Arrangement_2/doc_tex/Arrangement_2/PkgDescription.tex | 2 +- Arrangement_2/doc_tex/Sweep_line_2/PkgDescription.tex | 2 +- .../doc_tex/Boolean_set_operations_2/PkgDescription.tex | 2 +- .../doc_tex/Box_intersection_d/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 +- Curved_kernel/doc_tex/Curved_kernel/PkgDescription.tex | 2 +- HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex | 2 +- Interpolation/doc_tex/Interpolation/PkgDescription.tex | 2 +- .../doc_tex/Interval_skip_list/PkgDescription.tex | 2 +- Kernel_23/doc_tex/Kernel_23/PkgDescription.tex | 2 +- Kernel_d/doc_tex/Convex_hull_d/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 +- Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex | 2 +- Point_set_2/doc_tex/Point_set_2/PkgDescription.tex | 2 +- Polygon/doc_tex/Polygon/PkgDescription.tex | 2 +- Polyhedron/doc_tex/Polyhedron/PkgDescription.tex | 2 +- .../doc_tex/Principal_component_analysis/PkgDescription.tex | 2 +- SearchStructures/doc_tex/SearchStructures/PkgDescription.tex | 2 +- .../doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex | 2 +- Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex | 2 +- Spatial_searching/doc_tex/Spatial_searching/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 +- Surface_mesher/doc_tex/Surface_mesher/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 +- 37 files changed, 37 insertions(+), 37 deletions(-) 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 f8d4604c5e2..9d9d2297124 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}} -\ccHowToCiteCgal{cgal:d-as2-06} +\ccPkgHowToCiteCgal{cgal:d-as2-06} \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 c33303379f8..0b59be8886a 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}} -\ccHowToCiteCgal{cgal:d-as3-06} +\ccPkgHowToCiteCgal{cgal:d-as3-06} \ccPkgSummary{This package offers a data structure encoding the whole family of alpha-complexes related to a given 3D Delaunay or regular triangulation. In particular, the data structure allows to retrieve the alpha-complex for any alpha value, the whole spectrum of critical 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 210d307111c..a813a57c0d6 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}} -\ccHowToCiteCgal{cgal:k-ag2-06} +\ccPkgHowToCiteCgal{cgal:k-ag2-06} \ccPkgSummary{ Algorithms for computing the Apollonius graph in two dimensions. The Apollonius graph is the dual of the diff --git a/Arrangement_2/doc_tex/Arrangement_2/PkgDescription.tex b/Arrangement_2/doc_tex/Arrangement_2/PkgDescription.tex index 04dbf2aa7c8..cd8b08df964 100644 --- a/Arrangement_2/doc_tex/Arrangement_2/PkgDescription.tex +++ b/Arrangement_2/doc_tex/Arrangement_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Arrangement\label{Pkg:Arrangement2}} -\ccHowToCiteCgal{cgal:wfzh-a2-06} +\ccPkgHowToCiteCgal{cgal:wfzh-a2-06} \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_2/doc_tex/Sweep_line_2/PkgDescription.tex b/Arrangement_2/doc_tex/Sweep_line_2/PkgDescription.tex index 77f538ff8dd..8917108f60d 100644 --- a/Arrangement_2/doc_tex/Sweep_line_2/PkgDescription.tex +++ b/Arrangement_2/doc_tex/Sweep_line_2/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Intersection of Curves\label{Pkg:IntersectionOfCurves2}} -\ccHowToCiteCgal{cgal:wfz-ic2-06} +\ccPkgHowToCiteCgal{cgal:wfz-ic2-06} \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/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 97e8cde272c..97090607d5e 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}} -\ccHowToCiteCgal{cgal:fwzh-rbso2-06} +\ccPkgHowToCiteCgal{cgal:fwzh-rbso2-06} \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 b7a019e4f3a..a765b4a1a0c 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}} -\ccHowToCiteCgal{cgal:kmz-isiobd-06} +\ccPkgHowToCiteCgal{cgal:kmz-isiobd-06} \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/Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex b/Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex index 76faa7290df..b2939d8eeaa 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}} -\ccHowToCiteCgal{cgal:hs-chep2-06} +\ccPkgHowToCiteCgal{cgal:hs-chep2-06} \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 c3e23aa6127..b9d4b7d33be 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}} -\ccHowToCiteCgal{cgal:hs-ch3-06} +\ccPkgHowToCiteCgal{cgal:hs-ch3-06} \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 are not. One can diff --git a/Curved_kernel/doc_tex/Curved_kernel/PkgDescription.tex b/Curved_kernel/doc_tex/Curved_kernel/PkgDescription.tex index 15ce030f211..31eb7bb735b 100644 --- a/Curved_kernel/doc_tex/Curved_kernel/PkgDescription.tex +++ b/Curved_kernel/doc_tex/Curved_kernel/PkgDescription.tex @@ -1,5 +1,5 @@ \begin{ccPkgDescription}{2D Circular Kernel \label{Pkg:CircularKernel2}} -\ccHowToCiteCgal{cgal:pt-cc2-06} +\ccPkgHowToCiteCgal{cgal:pt-cc2-06} \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/HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex b/HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex index 07530fac725..9f2ed89d138 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}} -\ccHowToCiteCgal{cgal:k-hds-06} +\ccPkgHowToCiteCgal{cgal:k-hds-06} \ccPkgSummary{A halfedge data structure is an edge-centered data structure capable of maintaining incidence informations of vertices, edges and faces, for example for planar maps, polyhedra, or other orientable, diff --git a/Interpolation/doc_tex/Interpolation/PkgDescription.tex b/Interpolation/doc_tex/Interpolation/PkgDescription.tex index a40a5695d23..debcb5c55a0 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}} -\ccHowToCiteCgal{cgal:f-i-06} +\ccPkgHowToCiteCgal{cgal:f-i-06} \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 7800db76824..46dbf686ac2 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}} -\ccHowToCiteCgal{cgal:f-isl-06} +\ccPkgHowToCiteCgal{cgal:f-isl-06} \ccPkgSummary{An interval skip list is a data strucure 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/Kernel_23/doc_tex/Kernel_23/PkgDescription.tex b/Kernel_23/doc_tex/Kernel_23/PkgDescription.tex index caaf970dffc..99e61c1407d 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 Kernel\label{Pkg:Kernel23}} -\ccHowToCiteCgal{cgal:bfghhkps-k23-06} +\ccPkgHowToCiteCgal{cgal:bfghhkps-k23-06} \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/Convex_hull_d/PkgDescription.tex b/Kernel_d/doc_tex/Convex_hull_d/PkgDescription.tex index 135f725d9af..87f88ca7a20 100644 --- a/Kernel_d/doc_tex/Convex_hull_d/PkgDescription.tex +++ b/Kernel_d/doc_tex/Convex_hull_d/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{dD Convex Hulls and Delaunay Triangulations\label{Pkg:ConvexHullD}} -\ccHowToCiteCgal{cgal:hs-chdt3-06} +\ccPkgHowToCiteCgal{cgal:hs-chdt3-06} \ccPkgSummary{This package provides functions for computing convex hulls and Delaunay triagulations in $d$-dimensional Euclidean space.} diff --git a/Nef_2/doc_tex/Nef_2/PkgDescription.tex b/Nef_2/doc_tex/Nef_2/PkgDescription.tex index 3eaddeb9f8b..b4e43689a97 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}} -\ccHowToCiteCgal{cgal:s-bonp2-06} +\ccPkgHowToCiteCgal{cgal:s-bonp2-06} \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 61ec75d3f39..f7f98343758 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} -\ccHowToCiteCgal{cgal:s-bonp3-06} +\ccPkgHowToCiteCgal{cgal:s-bonp3-06} \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 4c3c27f17e9..495e62766cb 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}} -\ccHowToCiteCgal{cgal:s-bonpes2-06} +\ccPkgHowToCiteCgal{cgal:s-bonpes2-06} \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/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex b/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex index 32589939855..14dd1a2b415 100644 --- a/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex +++ b/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Geometric Optimisation \label{Pkg:Optimisation}} -\ccHowToCiteCgal{cgal:fghhps-go-06} +\ccPkgHowToCiteCgal{cgal:fghhps-go-06} \ccPkgSummary{ This package provides algorithms for computing bounding volumes, inscribed areas and polytope distances. 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 0e585680a01..3f85c52db39 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 Search Structures\label{Pkg:PointSet2}} -\ccHowToCiteCgal{cgal:b-ss2-06} +\ccPkgHowToCiteCgal{cgal:b-ss2-06} \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/Polygon/doc_tex/Polygon/PkgDescription.tex b/Polygon/doc_tex/Polygon/PkgDescription.tex index 4203af13433..6d01d25325d 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}} -\ccHowToCiteCgal{cgal:gw-p2-06} +\ccPkgHowToCiteCgal{cgal:gw-p2-06} \ccPkgSummary{ This package provides a polygon class and operations on sequences of points, like the simplicity test.} diff --git a/Polyhedron/doc_tex/Polyhedron/PkgDescription.tex b/Polyhedron/doc_tex/Polyhedron/PkgDescription.tex index 244893e5c7c..e7c4ab310f6 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}} -\ccHowToCiteCgal{cgal:k-ps-06} +\ccPkgHowToCiteCgal{cgal:k-ps-06} \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/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex b/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex index fa7c01723b0..75310b94e02 100644 --- a/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex +++ b/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex @@ -1,6 +1,6 @@ \begin{ccPkgDescription}{Principal Component Analysis\label{Pkg:PrincipalComponentAnalysisD}} -\ccHowToCiteCgal{cgal:ap-pcad-06} +\ccPkgHowToCiteCgal{cgal:ap-pcad-06} \ccPkgSummary{ This package provides functions to compute global informations on the shape of a set of 2D or 3D objects such as points. It provides the diff --git a/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex b/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex index ce4b348a317..55a2122200c 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}} -\ccHowToCiteCgal{cgal:n-rstd-06} +\ccPkgHowToCiteCgal{cgal:n-rstd-06} \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 52fa8d144ed..18617829d31 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 Graph \label{Pkg::SegmentDelaunayGraph2}} -\ccHowToCiteCgal{cgal:k-sdg2-06} +\ccPkgHowToCiteCgal{cgal:k-sdg2-06} \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/Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex b/Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex index 8183b00b034..99ad4878cc4 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}} -\ccHowToCiteCgal{cgal:p-sr2-06} +\ccPkgHowToCiteCgal{cgal:p-sr2-06} \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 3eb1d1b39e6..9e283468588 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}} -\ccHowToCiteCgal{cgal:tf-ssd-06} +\ccPkgHowToCiteCgal{cgal:tf-ssd-06} \ccPkgSummary{ This package implements exact and approximate distance browsing by 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 fb0cf9ebcec..11874c7c427 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}} -\ccHowToCiteCgal{cgal:c-sspo2-06} +\ccPkgHowToCiteCgal{cgal:c-sspo2-06} \ccPkgSummary{This package implements an algorithm to construct a halfedge data structure representing the straight skeleton in the interior of 2D polygon 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 6595c6eac21..3bb5f1aa01e 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}} -\ccHowToCiteCgal{cgal:m-ps-06} +\ccPkgHowToCiteCgal{cgal:m-ps-06} \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 e29e9fdc44c..095036f9723 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}} -\ccHowToCiteCgal{cgal:s-ssm2-06} +\ccPkgHowToCiteCgal{cgal:s-ssm2-06} \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 926dcf6566f..2297921db6c 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}} -\ccHowToCiteCgal{cgal:sal-pptsm2-06} +\ccPkgHowToCiteCgal{cgal:sal-pptsm2-06} \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_mesher/doc_tex/Surface_mesher/PkgDescription.tex b/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex index e7a99f7227d..4f1bd5bf7e2 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 Mesher\label{Pkg:SurfaceMesher3}} -\ccHowToCiteCgal{cgal:ry-sm2-06} +\ccPkgHowToCiteCgal{cgal:ry-sm2-06} \ccPkgSummary{ This package provides functions to generate surface meshes that interpolate diff --git a/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex b/Triangulation_2/doc_tex/TDS_2/PkgDescription.tex index 64e93945742..8cb8d22de2f 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}} -\ccHowToCiteCgal{cgal:py-tds2-06} +\ccPkgHowToCiteCgal{cgal:py-tds2-06} \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 b8107668c69..94079184deb 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}} -\ccHowToCiteCgal{cgal:y-t2-06} +\ccPkgHowToCiteCgal{cgal:y-t2-06} \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 456814ceff7..5761ab90b6c 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}} -\ccHowToCiteCgal{cgal:pt-tds3-06} +\ccPkgHowToCiteCgal{cgal:pt-tds3-06} \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 cb5aae00900..c3b94f89202 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}} -\ccHowToCiteCgal{cgal:pt-t3-06} +\ccPkgHowToCiteCgal{cgal:pt-t3-06} \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 3440cea5d92..8d4139d53ef 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 \label{Pkg::VoronoiDiagram2}} -\ccHowToCiteCgal{cgal:r-ctm2-06} +\ccPkgHowToCiteCgal{cgal:r-ctm2-06} \ccPkgSummary{ The 2D Voronoi diagram package provides an adaptor that adapts a 2-dimensional triangulated Delaunay graph to the corresponding a