diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 89d062ddddf..453f1968678 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -1331,6 +1331,29 @@ Teillaud"
address = {Girona, Spain}
}
+@article{cgal:lrtc-iccmps-20,
+ author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
+ journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
+ number = {5},
+ title = {Interpolated Corrected Curvature Measures for Polygonal Surfaces},
+ volume = {39},
+ month = aug,
+ year = {2020},
+ url = {https://doi.org/10.1111/cgf.14067},
+ doi = {10.1111/cgf.14067}
+}
+
+@article{cgal:lrt-ccm-22,
+ author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
+ journal = {Discrete & Computational Geometry},
+ title = {Corrected Curvature Measures},
+ volume = {68},
+ pages = {477-524},
+ month = jul,
+ year = {2022},
+ url = {https://doi.org/10.1007/s00454-022-00399-4}
+}
+
@article{cgal:lm-clscm-12,
author = {Lafarge, Florent and Mallet, Clement},
title = {{Creating large-scale city models from 3D-point clouds: a robust approach with hybrid representation}},
diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index f072116a2e2..5d6a1f80b0c 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -152043,7 +152043,6 @@ pages = {179--189}
Pages = {215--224},
Year = {2012},
Url = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
-}
@inproceedings{tang2009interactive,
title={Interactive Hausdorff distance computation for general polygonal models},
@@ -152054,26 +152053,4 @@ pages = {179--189}
pages={74},
year={2009},
organization={ACM}
-}
-
-@article{lachaud2020,
- author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
- journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
- number = {5},
- title = {Interpolated corrected curvature measures for polygonal surfaces},
- volume = {39},
- month = jul,
- year = {2020}
-}
-
-@article{lachaud2022
- author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
- journal = {Discrete & Computational Geometry},
- title = {Corrected Curvature Measures},
- volume = {68},
- pages = {477-524},
- month = jul,
- year = {2022},
- url = {https://doi.org/10.1007/s00454-022-00399-4}
-}
-
+}
\ No newline at end of file
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 9773216f3cb..d81a1f6029e 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -940,7 +940,7 @@ not provide storage for the normals.
\section PMPICC Computing Curvatures
This package provides methods to compute curvatures on polygonal meshes based on Interpolated
-Corrected Curvatures on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature,
+Corrected Curvatures on Polyhedral Surfaces \cgalCite{cgal:lrtc-iccmps-20}. This includes mean curvature,
Gaussian curvature, principal curvatures and directions. These can be computed on triangle meshes,
quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
@@ -955,10 +955,10 @@ in each direction is called the principal curvature: \f$ k_1 \f$ and \f$ k_2 \f$
curvatures). Curvature is usually expressed as scalar quantities like the mean curvature \f$ H \f$ and
the Gaussian curvature \f$ K \f$ which are defined in terms of the principal curvatures.
-The algorithms are based on the two papers \cgalCite{lachaud2022} and \cgalCite{lachaud2020}. They
-introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{lachaud2022} is
+The algorithms are based on the two papers \cgalCite{cgal:lrt-ccm-22} and \cgalCite{cgal:lrtc-iccmps-20}. They
+introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{cgal:lrt-ccm-22} is
based on decoupling the normal information from the position information, which is useful for dealing with
-digital surfaces, or meshes with noise on vertex positions. \cgalCite{lachaud2020} introduces some
+digital surfaces, or meshes with noise on vertex positions. \cgalCite{cgal:lrtc-iccmps-20} introduces some
extensions to this framework. As it uses linear interpolation on the corrected normal vector field
to derive new closed form equations for the corrected curvature measures. These interpolated
curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
@@ -1285,7 +1285,7 @@ is covered by a set of prisms, where each prism is an offset for an input triang
That is, the implementation in \cgal does not use indirect predicates.
The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
-supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{lachaud2020}.
+supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{cgal:lrtc-iccmps-20}.
DGtal's implementation was also
used as a reference during the project.