From e9fde2bb3f59367c00a665da087204444acf021e Mon Sep 17 00:00:00 2001 From: aminkhalsi Date: Tue, 13 Jan 2026 20:45:07 +0100 Subject: [PATCH] changed 'well known' to 'well-known' --- .../doc/Algebraic_foundations/Algebraic_foundations.txt | 4 ++-- .../doc/Apollonius_graph_2/Apollonius_graph_2.txt | 2 +- Documentation/doc/biblio/geom.bib | 2 +- HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h | 2 +- HalfedgeDS/include/CGAL/HalfedgeDS_decorator.h | 2 +- Installation/CHANGES.md | 2 +- Interpolation/doc/Interpolation/Interpolation.txt | 2 +- Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_2.h | 2 +- Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt | 2 +- Snap_rounding_2/doc/Snap_rounding_2/Snap_rounding_2.txt | 2 +- .../package_info/Snap_rounding_2/long_description.txt | 2 +- 11 files changed, 12 insertions(+), 12 deletions(-) diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt b/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt index e694f5d47a9..d982c463b42 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt +++ b/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt @@ -24,7 +24,7 @@ allows an explicit handling of mixed operations. \section Algebraic_foundationsAlgebraic Algebraic Structures The algebraic structure concepts introduced within this section are -motivated by their well known counterparts in traditional algebra, +motivated by their well-known counterparts in traditional algebra, but we also had to pay tribute to existing types and their restrictions. To keep the interface minimal, it was not desirable to cover all known algebraic structures, @@ -69,7 +69,7 @@ their existence, the usual arithmetic and comparison operators are required to be realized via \cpp operator overloading. The division operator is reserved for division in fields. All other unary (e.g., sqrt) and binary functions -(e.g., gcd, div) must be models of the well known \stl-concepts +(e.g., gcd, div) must be models of the well-known \stl-concepts `AdaptableUnaryFunction` or `AdaptableBinaryFunction` concept and local to the traits class (e.g., \link AlgebraicStructureTraits::Sqrt `Algebraic_structure_traits::Sqrt()(x)` \endlink). diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Apollonius_graph_2.txt b/Apollonius_graph_2/doc/Apollonius_graph_2/Apollonius_graph_2.txt index a1b3034e3d5..0a1b282a33e 100644 --- a/Apollonius_graph_2/doc/Apollonius_graph_2/Apollonius_graph_2.txt +++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Apollonius_graph_2.txt @@ -285,7 +285,7 @@ The `Vertex_conflict_2` predicate. The left-most, bottom-most and top-most circl What we essentially want to compute when we construct incrementally a Voronoi diagram, is whether the object to be inserted destroys an edge of the Voronoi diagram or not. In the case of points this is really -easy and it amounts to the well known incircle test. +easy and it amounts to the well-known incircle test. In the case of circles the situation is more complicated. We can have six possible outcomes as to what portion of an edge of the Apollonius diagram the diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib index 839dcea1fbb..4c7b75d8fe8 100644 --- a/Documentation/doc/biblio/geom.bib +++ b/Documentation/doc/biblio/geom.bib @@ -146051,7 +146051,7 @@ of geometric optics." , year = 1993 , pages = "37--42" , keywords = "travelling salesman problem, heuristic, approximation algorithms, convex hulls" -, comments = "It is well known that the nearest insertion and cheapest +, comments = "It is well-known that the nearest insertion and cheapest insertion are a factor 2 apx for TSP, and this is tight. Interestingly, for pts in the plane, if you start with a tour consisting of the convex hull vertices, and continue with nearest or diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h index 87579893ac6..7dd8cfc3f0a 100644 --- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h +++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h @@ -257,7 +257,7 @@ const Face& f); /*! \name Modifying Functions (Euler Operators) The following Euler operations modify consistently the combinatorial structure of the halfedge data structure. The geometry remains unchanged. -Note that well known graph operations are also captured with these +Note that well-known graph operations are also captured with these Euler operators, for example an edge contraction is equal to a `join_vertex()` operation, or an edge removal to `join_face()`. diff --git a/HalfedgeDS/include/CGAL/HalfedgeDS_decorator.h b/HalfedgeDS/include/CGAL/HalfedgeDS_decorator.h index eed5237568c..25779ea575f 100644 --- a/HalfedgeDS/include/CGAL/HalfedgeDS_decorator.h +++ b/HalfedgeDS/include/CGAL/HalfedgeDS_decorator.h @@ -235,7 +235,7 @@ public: // The following Euler operations modify consistently the combinatorial // structure of the halfedge data structure. The geometry remains -// unchanged. Note that well known graph operations are also captured with +// unchanged. Note that well-known graph operations are also captured with // these Euler operators, for example an edge contraction is equal to a // `join_vertex()' operation, or an edge removal to `join_face()'. // diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md index 68ae367dbe3..c0a006e2f0d 100644 --- a/Installation/CHANGES.md +++ b/Installation/CHANGES.md @@ -5469,7 +5469,7 @@ The following functionality has been added or changed: bounding boxes of more complicated geometries. Useful for (self-) intersection tests of surfaces etc. - 2D Snap Rounding (new package) - Snap Rounding is a well known method for converting + Snap Rounding is a well-known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation. In the study of robust geometric computing, it can be classified as a finite precision approximation technique. diff --git a/Interpolation/doc/Interpolation/Interpolation.txt b/Interpolation/doc/Interpolation/Interpolation.txt index b4b95c2f979..3b61192dfaa 100644 --- a/Interpolation/doc/Interpolation/Interpolation.txt +++ b/Interpolation/doc/Interpolation/Interpolation.txt @@ -219,7 +219,7 @@ diagram. The points defining the power diagram are the projections of the points in \f$ \mathcal{P}\f$ onto \f$ \mathcal{H}\f$, each point weighted with its negative square distance to \f$ \mathcal{H}\f$. Algorithms for the computation of power diagrams via the dual regular triangulation are -well known and for example provided by \cgal in the class +well-known and for example provided by \cgal in the class `Regular_triangulation_2`. \subsection InterpolationImplementation_1 Implementation diff --git a/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_2.h b/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_2.h index 4c4e52f5e05..bd74ed2744c 100644 --- a/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_2.h +++ b/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_2.h @@ -37,7 +37,7 @@ will be `(w,0)`. \param number_of_kd_trees The seventh parameter is briefly described later on this page; for a detailed description see \cgalCite{cgal:hp-isr-02}. -Snap Rounding (SR, for short) is a well known method for converting +Snap Rounding (SR, for short) is a well-known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation \cgalCite{gght-srlse-97}, \cgalCite{gm-rad-98}, \cgalCite{h-psifp-99}. In the study of robust geometric computing, it can be classified as a diff --git a/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt b/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt index 9426f5b4808..02b445a7c75 100644 --- a/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt +++ b/Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt @@ -7,7 +7,7 @@ \cgalPkgPicture{snap-detail.png} \cgalPkgSummaryBegin \cgalPkgAuthor{Eli Packer} -\cgalPkgDesc{Snap Rounding is a well known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation. In the study of robust geometric computing, it can be classified as a finite precision approximation technique. Iterated Snap Rounding is a modification of Snap Rounding in which each vertex is at least half-the-width-of-a-pixel away from any non-incident edge. This package supports both methods.} +\cgalPkgDesc{Snap Rounding is a well-known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation. In the study of robust geometric computing, it can be classified as a finite precision approximation technique. Iterated Snap Rounding is a modification of Snap Rounding in which each vertex is at least half-the-width-of-a-pixel away from any non-incident edge. This package supports both methods.} \cgalPkgManuals{Chapter_2D_Snap_Rounding,PkgSnapRounding2Ref} \cgalPkgSummaryEnd \cgalPkgShortInfoBegin diff --git a/Snap_rounding_2/doc/Snap_rounding_2/Snap_rounding_2.txt b/Snap_rounding_2/doc/Snap_rounding_2/Snap_rounding_2.txt index 41d9f6872e4..bb5a1b0ced2 100644 --- a/Snap_rounding_2/doc/Snap_rounding_2/Snap_rounding_2.txt +++ b/Snap_rounding_2/doc/Snap_rounding_2/Snap_rounding_2.txt @@ -10,7 +10,7 @@ namespace CGAL { \section Snap_rounding_2Introduction Introduction -Snap Rounding (SR, for short) is a well known method for converting +Snap Rounding (SR, for short) is a well-known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation \cgalCite{gght-srlse-97}, \cgalCite{gm-rad-98}, \cgalCite{h-psifp-99}. In the study of robust geometric computing, it can be classified diff --git a/Snap_rounding_2/package_info/Snap_rounding_2/long_description.txt b/Snap_rounding_2/package_info/Snap_rounding_2/long_description.txt index bb9a408de21..c74ecbc3cf6 100644 --- a/Snap_rounding_2/package_info/Snap_rounding_2/long_description.txt +++ b/Snap_rounding_2/package_info/Snap_rounding_2/long_description.txt @@ -1,4 +1,4 @@ -Snap Rounding (SR, for short) is a well known method for converting +Snap Rounding (SR, for short) is a well-known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation [Good,Guib,Hobb]. In the study of robust geometric computing, it can be classified as a finite precision approximation