songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix typo "and and"

This commit is contained in:
Laurent Rineau 2025-09-30 17:11:15 +02:00
parent f4aa383177
commit d309bc89ce
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConformingConstrainedDelaunayTriangulationCellBase_3.h
View File

@ -3,7 +3,7 @@
\cgalConcept
The concept `ConformingConstrainedDelaunayTriangulationCellBase_3` refines the concept
`TriangulationCellBase_3` and and describes the requirements for a base cell class of
`TriangulationCellBase_3` and describes the requirements for a base cell class of
the `CGAL::Conforming_constrained_Delaunay_triangulation_3` class.
\cgalRefines{TriangulationCellBase_3, BaseWithTimeStamp}

2
Documentation/doc/biblio/geom.bib
View File

@ -118600,7 +118600,7 @@ both for rendering and for modeling. Contains C code."
@article{ph-ddocs-92
, author = "J. P. Pratt and V. P. Heuring"
, title = "Designing digital optical computing systems: power and and crosstalk"
, title = "Designing digital optical computing systems: power and crosstalk"
, journal = "Appl. Optics"
, volume = 31
, number = 23

2
Interval_skip_list/include/CGAL/Interval_skip_list.h
View File

@ -177,7 +177,7 @@ class Interval_for_container : public Interval_
// remove markers for Interval I starting at left, the left endpoint
// of I, and and stopping at the right endpoint of I.
// of I, and stopping at the right endpoint of I.
Interval_handle removeMarkers(IntervalSLnode<Interval>* left,
const Interval& I);

2
Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
View File

@ -1363,7 +1363,7 @@ preprocess_bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm
if(is_one_sided_distance) // one-sided distance
{
if(tm1_only.size() > 0) // create TM1 and and full TM2
if(tm1_only.size() > 0) // create TM1 and full TM2
{
tm1_tree.insert(tm1_only.begin(), tm1_only.end(), tm1, vpm1);
tm2_tree.insert(faces2.begin(), faces2.end(), tm2, vpm2);