diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Algebraic_kernel_d.txt b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Algebraic_kernel_d.txt index d62c9ba9462..52cdc3b4292 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Algebraic_kernel_d.txt +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Algebraic_kernel_d.txt @@ -368,7 +368,7 @@ ideas that was brought to them throughout the last years. In particular, they want to thank Menelaos Karavelas and Elias Tsigaridas for their initial contributions. -The two generic models where initially developed as part of the Exacus \cgalCite{beh}+-eeeafcs-05 project. +The two generic models where initially developed as part of the Exacus \cgalCite{beh-eeeafcs-05} project. However, the models are now fully integrated into the \cgal library, since also the relevant layers of Exacus are now part of \cgal. The main authors for `Algebraic_kernel_d_1` and `Algebraic_kernel_d_2` are diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt index 7eb8f0e17da..1909bc41cc9 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt @@ -961,7 +961,7 @@ The trapezoidal map RIC algorithm has expected logarithmic query time, while the query time for the landmark strategy may be as large as linear. In practice however, the query times of both strategies are competitive. For a detailed experimental comparison -see \cgalCite{hh-eplca-05} +see \cgalCite{cgal:hh-eplca-05}. Updating the auxiliary data structures of the trapezoidal map RIC algorithm is done very efficiently. On the other hand, updating the diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt index 189eeac675c..da2ccad563a 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt +++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt @@ -809,7 +809,7 @@ range of all the darts of the orbit \f$ i_k\f$, each \f$ i_j\f$\f$ \in\f${0, ..., d}. These integers must satisfy: \f$ i_1\f$\f$ <\f$\f$ i_2\f$\f$ <\f$...\f$ <\f$\f$ i_k\f$, and (\f$ i_1\f$\f$ -\neq\f$ 0 or \f$ i_2\f$\f$ \neq\f$1) (for example +\neq\f$ 0 or \f$ i_2\f$\f$ \neq\f$ 1) (for example \link CombinatorialMap::Dart_of_orbit_range `Dart_of_orbit_range<1,2>`\endlink for the orbit \f$ \langle{}\f$\f$ \beta_1\f$,\f$ \beta_2\f$\f$ \rangle{}\f$(d0)); diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/Dart.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/Dart.h index 0adbfdd3d82..9f0a17e98f6 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/Dart.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/Dart.h @@ -101,14 +101,12 @@ Returns true iff the dart is i-free. bool is_free(unsigned int i) const; -/* \deprecated This function is removed since \cgal 4.4. Use \ref CombinatorialMap::highest_nonfree_dimension "cmap.highest_nonfree_dimension(dh)" instead. Returns the highest dimension i such that the dart is not i-free. -1 if `d0` is free for any dimension. int highest_nonfree_dimension() const; -/* \deprecated This function is removed since \cgal 4.4. Use \ref CombinatorialMap::opposite "cmap.opposite(dh)" instead. Returns a handle to a dart belonging to the same edge than this dart, and not to the same vertex. @@ -116,7 +114,6 @@ than this dart, and not to the same vertex. Dart_handle opposite(); -/* \deprecated This function is removed since \cgal 4.4. Use \ref CombinatorialMap::opposite "cmap.opposite(dh)" instead. Returns a const handle to a dart belonging to the same edge than this dart, and not to the same vertex, when the dart is const. @@ -124,7 +121,6 @@ than this dart, and not to the same vertex, when the dart is const. Dart_const_handle opposite() const; -/* \deprecated This function is removed since \cgal 4.4. Use \ref CombinatorialMap::other_extremity "cmap.other_extremity(dh)" instead. Returns a handle to a dart belonging to the other vertex of the edge containing this dart (but contrary to `opposite()` not @@ -132,7 +128,6 @@ necessarily to the same edge). `NULL` if such a dart does not exist. Dart_handle other_extremity(); -/* \deprecated This function is removed since \cgal 4.4. Use \ref CombinatorialMap::other_extremity "cmap.other_extremity(dh)" instead. Returns a const handle to a dart belonging to the other vertex of the edge containing this dart, when the dart is const (but contrary to diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt index 5e36c0fc86e..336a1852224 100644 --- a/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt +++ b/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt @@ -27,7 +27,7 @@ projects 21957 (CGAL) and 28155 (GALIA). \section secdesign_goals Primary design goals -The primary design goals of \cgal are described in \cgalCite{fgkss-dccga-00:} +The primary design goals of \cgal are described in \cgalCite{fgkss-dccga-00} \subsection Developer_manualCorrectness Correctness diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib index b17a841fdfd..5e2b4ddf641 100644 --- a/Documentation/doc/biblio/cgal_manual.bib +++ b/Documentation/doc/biblio/cgal_manual.bib @@ -2350,6 +2350,7 @@ ADDRESS = "Saarbr{\"u}cken, Germany" author = "J. Abbott", title = "Quadratic Interval Refinement for Real Roots", URL = "http://www.dima.unige.it/~abbott/", + year= "2006", note = "Poster presented at the 2006 Int.\ Symp.\ on Symb.\ and Alg.\ Comp.\ (ISSAC 2006)"} diff --git a/Envelope_2/doc/Envelope_2/Envelope_2.txt b/Envelope_2/doc/Envelope_2/Envelope_2.txt index 0863bb354a2..f0c9b322365 100644 --- a/Envelope_2/doc/Envelope_2/Envelope_2.txt +++ b/Envelope_2/doc/Envelope_2/Envelope_2.txt @@ -174,7 +174,7 @@ the lines that form the lower envelope of \f$ {\cal P}^{*}\f$ are dual to the points along the upper part of \f$ {\cal P}\f$'s convex hull, and the lines that form the upper envelope of \f$ {\cal P}^{*}\f$ are dual to the points along the lower part of the convex hull; see, -e.g., [\cgalCite{Section} 11.4 for more details. +e.g., \cgalCite{bkos-cgaa-97}, Section 11.4 for more details. Note that the leftmost edge of the minimization diagram is associated with the same line as the rightmost edge of the maximization diagram, and vice-verse. We can therefore skip the rightmost edges of both diff --git a/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_2.h b/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_2.h index bea5f6b5407..749cdbdeb4b 100644 --- a/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_2.h +++ b/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_2.h @@ -34,7 +34,7 @@ typedef unspecified_type NT; /// @{ /*! -This constructs a bounding box with the dimensions specified by the last 4 arguments. They are optional and will take the values \f$ \pm\f$10 if omitted. +This constructs a bounding box with the dimensions specified by the last 4 arguments. They are optional and will take the values \f$ \pm\f$ 10 if omitted. */ Enclosing_box_2(Traits, NT xmin, NT xmax, NT ymin, NT ymax); diff --git a/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_3.h b/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_3.h index 6876090ccd6..6c0fae28383 100644 --- a/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_3.h +++ b/Kinetic_data_structures/doc/Kinetic_data_structures/CGAL/Kinetic/Enclosing_box_3.h @@ -35,7 +35,7 @@ typedef unspecified_type NT; /// @{ /*! -This constructs a bounding box with the dimensions specified by the last 6 arguments. They are optional and will take the values \f$ \pm\f$10 if omitted. +This constructs a bounding box with the dimensions specified by the last 6 arguments. They are optional and will take the values \f$ \pm\f$ 10 if omitted. */ Enclosing_box_3(Traits, NT xmin, NT xmax, NT ymin, NT ymax, NT zmin, NT zmax); diff --git a/Kinetic_framework/doc/Kinetic_framework/Concepts/Simulator.h b/Kinetic_framework/doc/Kinetic_framework/Concepts/Simulator.h index a05f46b2941..fb7768675c8 100644 --- a/Kinetic_framework/doc/Kinetic_framework/Concepts/Simulator.h +++ b/Kinetic_framework/doc/Kinetic_framework/Concepts/Simulator.h @@ -385,5 +385,5 @@ double to_double(Simulator::Time); */ std::pair to_interval(Simulator::Time); -} /*end namespace Kinetic +} /* end namespace Kinetic */ diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex.h index 93d249ece0b..be5dfb96081 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex.h @@ -287,7 +287,7 @@ template Point barycenter(Dart_const_handle dh) const; /*! Inserts a point, copy of `p`, in the i-cell containing `dh`. Returns a handle on one dart of this cell. -\pre i\f$ \leq\f$\ref CombinatorialMap::dimension "dimension"\f$ \leq\f$2 and `*dh`\f$ \in\f$\ref CombinatorialMap::darts "darts()". +\pre i\f$ \leq\f$\ref CombinatorialMap::dimension "dimension"\f$ \leq\f$ 2 and `*dh`\f$ \in\f$\ref CombinatorialMap::darts "darts()". If \link CombinatorialMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if i-attributes are non void, @@ -306,7 +306,7 @@ template Dart_handle insert_point_in_cell(Dart_handle dh, Point /*! Inserts a point in the barycenter of the i-cell containing `dh`. Returns a handle on one dart of this cell. -\pre i\f$ \leq\f$\ref CombinatorialMap::dimension "dimension"\f$ \leq\f$2 and `*dh`\f$ \in\f$\ref CombinatorialMap::darts "darts()". +\pre i\f$ \leq\f$\ref CombinatorialMap::dimension "dimension"\f$ \leq\f$ 2 and `*dh`\f$ \in\f$\ref CombinatorialMap::darts "darts()". If \link CombinatorialMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if i-attributes are non void, diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h index 44033e43f1d..c15ed5de14c 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h @@ -241,8 +241,6 @@ typedef unspecified_type Periodic_point_iterator; /// @{ /*! -\ingroup PkgPeriodic3Triangulation3Enums - The enum `Locate_type` is defined by `Periodic_3_triangulation_3` to specify which case occurs when locating a point in the triangulation. If the triangulation does not contain any points @@ -254,8 +252,6 @@ triangulation. If the triangulation does not contain any points enum Locate_type {VERTEX=0, EDGE, FACET, CELL, EMPTY}; /*! -\ingroup PkgPeriodic3Triangulation3Enums - The enum `Iterator_type` is defined by `Periodic_3_triangulation_3` to specify the behavior of geometric iterators. diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt index a8cc0b0288f..64b5965be3e 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/PackageDescription.txt @@ -9,8 +9,6 @@ /// \defgroup PkgPeriodic3Triangulation3TraitsClasses Traits Classes /// \ingroup PkgPeriodic3Triangulation3 -/// \defgroup PkgPeriodic3Triangulation3Enums Enums -/// \ingroup PkgPeriodic3Triangulation3 /*! \addtogroup PkgPeriodic3Triangulation3 \todo check generated documentation diff --git a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt index 53c33b33fbe..8a1cfce402d 100644 --- a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt +++ b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt @@ -1056,7 +1056,7 @@ she also wrote the traits classes for regular triangulations. In 2000, Sylvain Pion started working on these packages. He improved the efficiency of triangulations in \cgal 2.3 and 2.4 in several ways -\cgalCite{cgal:bdpty-tc-02:} he implemented the Delaunay hierarchy +\cgalCite{cgal:bdpty-tc-02} he implemented the Delaunay hierarchy \cgalCite{cgal:d-dh-02} in 2.3, he improved the memory footprint in 2.4 and 3.0, he also performed work on arithmetic filters \cgalCite{cgal:dp-eegpd-03} (see `Filtered_kernel`) to improve