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

Spelling corrections 

Spelling corrections
This commit is contained in:
albert-github 2024-06-25 15:52:27 +02:00
parent 29ed736571
commit a0e7a6e4e4
6 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
View File

@ -118,7 +118,7 @@ public:
void cleanup_cache() const; void cleanup_cache() const;
/*! /*!
Returns a pointer to the used algerbaic kernel object. Returns a pointer to the used algebraic kernel object.
*/ */
const Algebraic_kernel_d_1* algebraic_kernel_d_1() const; const Algebraic_kernel_d_1* algebraic_kernel_d_1() const;

4
Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
View File

@ -1237,7 +1237,7 @@ public:
//! \brief checks whether curve has only finitely many self-intersection //! \brief checks whether curve has only finitely many self-intersection
//! points, i.e., it has no self-overlapped continuous parts //! points, i.e., it has no self-overlapped continuous parts
//! //!
//! for algerbaic curves this means that supporting polynomial is //! for algebraic curves this means that supporting polynomial is
//! square-free //! square-free
struct Has_finite_number_of_self_intersections_2 : struct Has_finite_number_of_self_intersections_2 :
public CGAL::cpp98::unary_function< Polynomial_2, bool > { public CGAL::cpp98::unary_function< Polynomial_2, bool > {
@ -1252,7 +1252,7 @@ public:
//! \brief checks whether a curve pair has finitely many intersections, //! \brief checks whether a curve pair has finitely many intersections,
//! in other words, whether two curves have no continuous common part //! in other words, whether two curves have no continuous common part
//! //!
//! in case of algerbaic curves: checks whether supporting polynomials are //! in case of algebraic curves: checks whether supporting polynomials are
//! coprime //! coprime
struct Has_finite_number_of_intersections_2 : struct Has_finite_number_of_intersections_2 :
public CGAL::cpp98::binary_function< Curve_analysis_2, Curve_analysis_2, bool > { public CGAL::cpp98::binary_function< Curve_analysis_2, Curve_analysis_2, bool > {

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

@ -16862,7 +16862,7 @@ Contains C code."
, title = "A polyhedron representation for computer vision" , title = "A polyhedron representation for computer vision"
, booktitle = "Proc. AFIPS Natl. Comput. Conf." , booktitle = "Proc. AFIPS Natl. Comput. Conf."
, volume = 44 , volume = 44
, publisher = "AFIPS Press, Alrington, Va." , publisher = "AFIPS Press, Arlington, Va."
, year = 1975 , year = 1975
, pages = "589--596" , pages = "589--596"
, update = "98.07 bibrelex" , update = "98.07 bibrelex"
@ -116674,7 +116674,7 @@ dither and stipple patterns."
@article{p-axrac-44 @article{p-axrac-44
, author = "A. L. Patterson" , author = "A. L. Patterson"
, title = "Amibguities in the {X}-ray analysis of crystal structures" , title = "Ambiguities in the {X}-ray analysis of crystal structures"
, journal = "Physical Review" , journal = "Physical Review"
, volume = 65 , volume = 65
, year = 1944 , year = 1944

2
Envelope_3/include/CGAL/Env_triangle_traits_3.h
View File

@ -367,7 +367,7 @@ public:
// case, to find whether a 2d point lies below/above/on a line // case, to find whether a 2d point lies below/above/on a line
// this test is simply computing the sign of: // this test is simply computing the sign of:
// (1) [(y3 - y1)(z2 - z1) - (z3 - z1)(y2 - y1)] * sign(y3 - y1) // (1) [(y3 - y1)(z2 - z1) - (z3 - z1)(y2 - y1)] * sign(y3 - y1)
// abd comparing to 0, where pi = (xi, yi, zi), and p2 is compared to the // and comparing it with 0, where pi = (xi, yi, zi), and p2 is compared to the
// line formed by p1 and p3 (in the direction p1 -> p3) // line formed by p1 and p3 (in the direction p1 -> p3)
// //
// for general vertical plane, we change (x, y) coordinates to (v, w), // for general vertical plane, we change (x, y) coordinates to (v, w),

2
Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
View File

@ -236,7 +236,7 @@ public:
void remove(Vertex_handle v); void remove(Vertex_handle v);
/*! /*!
Removes the vertices in the iterator range `[firs, last)` from the triangulation. Removes the vertices in the iterator range `[first, last)` from the triangulation.
\pre all vertices in `[first, last)` are vertices of the triangulation. \pre all vertices in `[first, last)` are vertices of the triangulation.
*/ */
template <class VertexRemoveIterator> template <class VertexRemoveIterator>

2
Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_2.h
View File

@ -145,7 +145,7 @@ The class expects two template parameters.
bool remove(Vertex_handle v); bool remove(Vertex_handle v);
/*! /*!
Removes the vertices in the iterator range `[firs, last)` from the triangulation. Removes the vertices in the iterator range `[first, last)` from the triangulation.
\pre all vertices in `[first, last)` are vertices of the triangulation. \pre all vertices in `[first, last)` are vertices of the triangulation.
*/ */
template <class VertexRemoveIterator> template <class VertexRemoveIterator>