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

Fix typo

This commit is contained in:
Mael Rouxel-Labbé 2022-02-24 21:58:28 +01:00
parent 3452fb7596
commit 2dd39271e6
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Distance_3/include/CGAL/Distance_3/Point_3_Triangle_3.h
View File

@ -68,8 +68,8 @@ squared_distance_to_triangle_RT(const typename K::Point_3& pt,
if(normal == NULL_VECTOR) if(normal == NULL_VECTOR)
{ {
// The case normal==NULL_VECTOR covers the case when the triangle // The case normal == NULL_VECTOR covers the case when the triangle
// is colinear, or even more degenerate. In that case, we can // is collinear, or even more degenerate. In that case, we can
// simply take also the distance to the three segments. // simply take also the distance to the three segments.
squared_distance_RT(pt, segment(t2, t0), num, den, k); squared_distance_RT(pt, segment(t2, t0), num, den, k);
@ -161,7 +161,7 @@ squared_distance_to_triangle(const typename K::Point_3& pt,
if(normal == NULL_VECTOR) if(normal == NULL_VECTOR)
{ {
// The case normal == NULL_VECTOR covers the case when the triangle // The case normal == NULL_VECTOR covers the case when the triangle
// is colinear, or even more degenerate. In that case, we can // is collinear, or even more degenerate. In that case, we can
// simply take also the distance to the three segments. // simply take also the distance to the three segments.
// //
// Note that in the degenerate case, at most 2 edges cover the full triangle, // Note that in the degenerate case, at most 2 edges cover the full triangle,

4
Triangulation_on_sphere_2/test/Triangulation_on_sphere_2/test_dtos_traits.cpp
View File

@ -74,7 +74,7 @@ int main(int, char**)
// result = traits.power_test_2_object()(P2, P1, P10); // result = traits.power_test_2_object()(P2, P1, P10);
// assert(result == CGAL::ON_NEGATIVE_SIDE); // assert(result == CGAL::ON_NEGATIVE_SIDE);
// power_test_2(p,q) where p, q, and the center of the sphere are colinear // power_test_2(p,q) where p, q, and the center of the sphere are collinear
// result = traits.power_test_2_object()(P1, P7); // result = traits.power_test_2_object()(P1, P7);
// assert(result == CGAL::ON_POSITIVE_SIDE); // assert(result == CGAL::ON_POSITIVE_SIDE);
// result = traits.power_test_2_object()(P1, P1); // result = traits.power_test_2_object()(P1, P1);
@ -101,7 +101,7 @@ int main(int, char**)
// result = traits_6.power_test_2_object()(P14, P1, P11); // result = traits_6.power_test_2_object()(P14, P1, P11);
// assert(result == CGAL::ON_NEGATIVE_SIDE); // assert(result == CGAL::ON_NEGATIVE_SIDE);
// power_test_2(p,q) where p, q and sphere are colinear // power_test_2(p,q) where p, q and sphere are collinear
// result = traits_6.power_test_2_object()(P13, P0); // result = traits_6.power_test_2_object()(P13, P0);
// assert(result == CGAL::ON_POSITIVE_SIDE); // assert(result == CGAL::ON_POSITIVE_SIDE);
// result = traits_6.power_test_2_object()(P13, P13); // result = traits_6.power_test_2_object()(P13, P13);