rephrase and update reference

Author: sloriot

Documentation/doc/biblio/geom.bib

@@ -152087,17 +152087,19 @@ @article{ledoux2014triangulation
   publisher={Elsevier}
 }
 
-@unpublished{lazard:hal-04907149,
-  TITLE = {{Removing self-intersections in 3D meshes while preserving floating-point coordinates}},
-  AUTHOR = {Lazard, Sylvain and Valque, Leo},
-  URL = {https://inria.hal.science/hal-04907149},
-  NOTE = {working paper or preprint},
-  YEAR = {2025},
-  MONTH = Jan,
-  KEYWORDS = {Snap rounding ; mesh intersection ; robustness},
-  PDF = {https://inria.hal.science/hal-04907149v1/file/Snap-HAL.pdf},
-  HAL_ID = {hal-04907149},
-  HAL_VERSION = {v1},
+@article{valquelazard2025,
+author = {Valque, Léo and Lazard, Sylvain},
+title = {Resolving self-intersections in 3D meshes while preserving floating-point coordinates},
+journal = {Computer Graphics Forum},
+volume = {44},
+number = {5},
+pages = {e70197},
+keywords = {CCS Concepts, • Computing methodologies → Model development and analysis, Mesh models, • Theory of computation → Computational geometry},
+doi = {https://doi.org/10.1111/cgf.70197},
+url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/cgf.70197},
+eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.70197},
+abstract = {Abstract We present a straightforward and robust method for resolving the mesh intersection problem. We focus specifically on the challenge caused by the intersections resulting from the conversion of the vertices coordinates from their exact mathematical values to a fixed-precision floating-point format. Our method takes as input a soup of triangles and outputs intersection-free models whose vertices coordinates are all represented with double-precision floating-point format. We evaluated our approach thoroughly, considering a large collection of meshes. In particular, we can process all the 4524 models in Thingi10K [ZJ16] that contain self-intersections. This outperforms previous state-of-the-art approaches: On the 527 models of Thingi10K for which naive rounding fails, Zhou et al.'s approach [ZGZJ16] is capable of handling 91\% of them, and Valque's 94\% [Val24]. In terms of time efficiency, our approach handles about 50k vertices per second on average, which is faster to that of Zhou et al. by a factor 1.4 on these non-trivial models and is faster than that of Valque by several order of magnitude.},
+year = {2025}
 }
 
 @inproceedings{si2005meshing,

Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt

@@ -1479,7 +1479,7 @@ supervision of Sébastien Valette and Sébastien Loriot, who later finalized the
 The implementation is based on \cgalCite{cgal:vcp-grtmmdvd-08}. and
 preceding work. <a href="https://www.creatis.insa-lyon.fr/~valette/public/project/acvd/">ACVD's implementation</a> was also
 used as a reference during the project.
-The `apply_iterative_snap_rounding` option for autorefinement was implemented in 2025, by Léo Valque, based on his work with Sylvain Lazard \cgalCite{lazard:hal-04907149}.
+The `apply_iterative_snap_rounding` option for autorefinement was developed by Sylvain Lazard and Léo Vaque \cgalCite{valquelazard2025}, and implemented by Léo Valque in 2025.
 
 */
 } /* namespace CGAL */