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

Spelling corrections (#8451) 

Spelling corrections
This commit is contained in:
Sebastien Loriot 2024-09-02 13:01:09 +02:00 committed by GitHub
parent 38871d9b12 37218301bb
commit aaede41f81
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
View File

@ -426,7 +426,7 @@ void test_algebraic_structure_intern(
//commutative //commutative
assert(a+b+c==c+b+a); assert(a+b+c==c+b+a);
assert(a*b*c==c*b*a); assert(a*b*c==c*b*a);
//distributiv //distributive
assert((a-b)*c==a*c-b*c); assert((a-b)*c==a*c-b*c);
assert((a+b)*c==a*c+b*c); assert((a+b)*c==a*c+b*c);
//binom //binom

2
Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/circle_segments/intersect
View File

@ -1,6 +1,6 @@
# Input is based on the curves and points indexes from intersect.pt # Input is based on the curves and points indexes from intersect.pt
# intersect.xcv. The first two numbers are the numbers of the input curves # intersect.xcv. The first two numbers are the numbers of the input curves
# to be intersected. After that there is the number of intesections and # to be intersected. After that there is the number of intersections and
# 2-3 numbers representing each intersection. Meaning, the input is of the form: # 2-3 numbers representing each intersection. Meaning, the input is of the form:
# intersect <id of 1st x-curve> <id of 2nd x-curve> \ # intersect <id of 1st x-curve> <id of 2nd x-curve> \
# <expected number of intersections> [<type of intersection> \ # <expected number of intersections> [<type of intersection> \

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

@ -92400,7 +92400,7 @@ some 2 curves cross exponentially many times."
@inproceedings{kn-afrmt-97 @inproceedings{kn-afrmt-97
, author = "Yoshiyuki Kusakari and Takao Nishizeki" , author = "Yoshiyuki Kusakari and Takao Nishizeki"
, title = "An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescibed Terminals" , title = "An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescribed Terminals"
, booktitle = "Proc. 8th Annu. Internat. Sympos. Algorithms Comput." , booktitle = "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
, nickname = "ISAAC '97" , nickname = "ISAAC '97"
, site = "Singapore" , site = "Singapore"

2
Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h
View File

@ -234,7 +234,7 @@ private:
// If the target is a corner vertex, we have the complete length of a side in 'len' // If the target is a corner vertex, we have the complete length of a side in 'len'
// and we must "normalize" the previous entries // and we must "normalize" the previous entries
if(get(vpmap, vt)) { if(get(vpmap, vt)) {
// If both extremeties of a segment are corners, offsets are already correct // If both extremities of a segment are corners, offsets are already correct
if(!get(vpmap, vs)) { if(!get(vpmap, vs)) {
CGAL_assertion(len != 0.0); CGAL_assertion(len != 0.0);
double ld = 1.0 / len; double ld = 1.0 / len;