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

it's > its

This commit is contained in:
Mael Rouxel-Labbé 2025-03-28 21:17:13 +01:00
parent 53f32aba4a
commit adf8e5ad6a
11 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Arrangement_on_surface_2/TODO
View File

@ -164,7 +164,7 @@
or at least issues warnings about returning a reference to temporary
variable. Can you prompt the INRIA people to fix this?
(I personally think that we should remove this example from our test-suite,
but if the INRIA people believe that it's place is there, they should at
but if the INRIA people believe that its place is there, they should at
least properly maintain it ...)
- There is a problem with the examples that use CORE on Darwin (platform #10).
Other Darwin platforms seem fine. Do we want to investigate? (perhaps it's

4
Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h
View File

@ -407,7 +407,7 @@ is_crossover_outer_boundary(const typename Traits_2::Polygon_with_holes_2& pgn,
Vertex_const_handle cver;
Point_2 second_point;
if (cmp_endpoints(*next) == SMALLER) {
// next curve's minimum is the joint vertex. Look if it's max exists in
// next curve's minimum is the joint vertex. Look if its max exists in
// the arrangement and insert lexicographically
second_point = max_functor(*next);
obj = pl.locate(second_point);
@ -757,7 +757,7 @@ bool are_holes_and_boundary_pairwise_disjoint
/* A valid polygon with holes is :
* 1 - Has empty or closed boundary and all the holes are closed
* 2 - The PWH is relatively simple polygon (holes are simple...)
* 3 - Has it's boundary oriented counterclockwise and the holes oriented
* 3 - Has its boundary oriented counterclockwise and the holes oriented
* clockwise
* 4 - All the segments (boundary and holes) do not cross or intersect in their
* relative interior

2
Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
View File

@ -30,7 +30,7 @@ specialization of the algorithm for the case when the center
coordinates and radii of the input spheres are floating-point numbers.
This specialized algorithm uses floating-point arithmetic only, is
very fast and especially tuned for stability and robustness. Still,
it's output may be incorrect in some (rare) cases; termination is
its output may be incorrect in some (rare) cases; termination is
guaranteed.
When default constructed, an instance of type

2
CGAL_Core/include/CGAL/CORE/poly/Sturm.h
View File

@ -69,7 +69,7 @@ public:
// the array seq is not used!
// Hence, one must test these special cases
Polynomial<NT> * seq; // array of polynomials of length "len+1"
Polynomial<NT> g;//GCD of input polynomial P and it's derivative P'
Polynomial<NT> g;//GCD of input polynomial P and its derivative P'
NT cont;//Content of the square-free part of input polynomial P
//Thus P = g * cont * seq[0]
static const int N_STOP_ITER = 10000; // Stop IterE after this many iterations.

4
Convex_hull_d/include/CGAL/Delaunay_d.h
View File

@ -203,7 +203,7 @@ public:
Simplex_iterator(Delaunay* x, Base_iterator y,
Delaunay_voronoi_kind z = NEAREST) : Base_iterator(y), DT(x)
/* if the facet is not nil we set the current marker to
the facet and insert all it's neighbors into the
the facet and insert all its neighbors into the
candidates stack */
{ CGAL_assertion(base() != Base_iterator());
tf = (z == NEAREST ? lower_hull : upper_hull);
@ -262,7 +262,7 @@ public:
Simplex_const_iterator(const Delaunay* x, Base_iterator y,
Delaunay_voronoi_kind z = NEAREST) : Base_iterator(y), DT(x)
/* if the facet is not nil we set the current marker to
the facet and insert all it's neighbors into the
the facet and insert all its neighbors into the
candidates stack */
{ CGAL_assertion(base() != Base_iterator());
tf = (z == NEAREST ? lower_hull : upper_hull);

4
Documentation/doc/resources/1.10.0/hacks.js
View File

@ -98,14 +98,14 @@ $(document).ready(function() {
if(window.location.href.includes("doc.cgal.org")){
var url='https://doc.cgal.org/latest/Manual/menu_version.js';
var script = document.createElement("script"); // Make a script DOM node
script.src = url; // Set it's src to the provided URL
script.src = url; // Set its src to the provided URL
document.head.appendChild(script);
}
else
{
var url='../Manual/menu_version.js';
var script = document.createElement("script"); // Make a script DOM node
script.src = url; // Set it's src to the provided URL
script.src = url; // Set its src to the provided URL
document.head.appendChild(script);
}
})();

4
Documentation/doc/resources/1.8.13/hacks.js
View File

@ -98,14 +98,14 @@ $(document).ready(function() {
if(window.location.href.includes("doc.cgal.org")){
var url='https://doc.cgal.org/latest/Manual/menu_version.js';
var script = document.createElement("script"); // Make a script DOM node
script.src = url; // Set it's src to the provided URL
script.src = url; // Set its src to the provided URL
document.head.appendChild(script);
}
else
{
var url='../Manual/menu_version.js';
var script = document.createElement("script"); // Make a script DOM node
script.src = url; // Set it's src to the provided URL
script.src = url; // Set its src to the provided URL
document.head.appendChild(script);
}
})();

4
Documentation/doc/resources/1.9.6/hacks.js
View File

@ -98,14 +98,14 @@ $(document).ready(function() {
if(window.location.href.includes("doc.cgal.org")){
var url='https://doc.cgal.org/latest/Manual/menu_version.js';
var script = document.createElement("script"); // Make a script DOM node
script.src = url; // Set it's src to the provided URL
script.src = url; // Set its src to the provided URL
document.head.appendChild(script);
}
else
{
var url='../Manual/menu_version.js';
var script = document.createElement("script"); // Make a script DOM node
script.src = url; // Set it's src to the provided URL
script.src = url; // Set its src to the provided URL
document.head.appendChild(script);
}
})();

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

@ -1111,7 +1111,7 @@ template <class Interval>
Interval_skip_list<Interval>::removeMarkers(IntervalSLnode<Interval>* left,
const Interval& I)
{
// Remove markers for interval I, which has left as it's left
// Remove markers for interval I, which has left as its left
// endpoint, following a staircase pattern.
// Interval_handle res=0, tmp=0; // af: assignment not possible with std::list

2
Lab/demo/Lab/Scene.cpp
View File

@ -1164,7 +1164,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
return true;
}
//todo : if a group is selected, don't treat it's children.
//todo : if a group is selected, don't treat its children.
bool Scene::sort_lists(QVector<QList<int> >&sorted_lists, bool up)
{
QVector<int> group_found;

2
Three/include/CGAL/Three/Viewer_interface.h
View File

@ -286,7 +286,7 @@ public:
virtual QVector4D* clipBox() const =0;
virtual bool isClipping() const = 0;
//! A vector indicating the scaling factors to apply to the scene when displaying it.
//! It can be useful when a scene is very large along one of it's coordinates, making it hard to visualize it.
//! It can be useful when a scene is very large along one of its coordinates, making it hard to visualize it.
virtual const QVector3D& scaler() const = 0;
virtual void showEntireScene() = 0;