Mael

> > You are probably using a CGAL::Surface_mesh and getting the number of elements through [`num_vertices()`](https://doc.cgal.org/latest/BGL/classVertexListGraph.html#a77e742c910da6a8230a45273186b130b) and similar functions. > > As [the doc](https://doc.cgal.org/latest/BGL/classVertexListGraph.html#a77e742c910da6a8230a45273186b130b) indicates: > > > [num_vertices()](https://doc.cgal.org/latest/BGL/classVertexListGraph.html#a77e742c910da6a8230a45273186b130b) may...

> [@MaelRL](https://github.com/MaelRL) Do you think a patch similar to [#9060](https://github.com/CGAL/cgal/pull/9060) could be used for PDt2? In P2DT2, we actually use the ranges for values > 7 so the same strategy...

I'm sure it could be implemented, but given that it was not requested and that it is P2T2 and not T2, which is not the same priority, I don't really...

Bump @Joraslav

Or with Polygon_mesh_processing's Boolean operations: https://doc.cgal.org/latest/Polygon_mesh_processing/group__PMP__corefinement__grp.html#ga3ff96d36cad8f37efcdada916c46fbbe The function [CGAL::make_tetrahedron()](https://doc.cgal.org/latest/BGL/group__PkgBGLGeneratorFct.html#ga92116dc89384a0b8d565e2411f1c173a) can be used to generate the mesh from the tetrahedron coordinates.

bump @efifogel

/build:v0

/build:v0

> What do you think of `apply_iterative_snap_rounding()` ? cc @MaelRL OK, but I also meant the function `snap_polygon_soup()`: even if it's internal, best to still avoid naming similarities.

> @MaelRL does "meaningless" [here](https://github.com/CGAL/cgal/blob/119bd102c9f8d77dc80d09f827381c504dba1490/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h#L1193) that this cannot happen for whatever input, or does it mean that the user called `locate()` with illegal input? illegal input, this is a violation...