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é 2023-02-09 23:27:01 +01:00
parent cb40b63bb3
commit 9d9a51731a
7 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/refine_zero_against.h
View File

@ -66,7 +66,7 @@ int descartes(Polynomial& p, const Field& low,const Field& high){
}
/*! \ingroup \NiX_univariate_polynomial_utils
* \brief refine isolating interval for \c p w.r.t \c q
* \brief refine isolating interval for \c p w.r.t. \c q
*
* This function refines the interval ]<TT>low</TT>, <TT>high</TT>[
* such that it does not contain any zero of \c q different from the

2
Mesh_2/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h
View File

@ -273,7 +273,7 @@ private:
FT local_move_sq_ratio = (move * move) / local_sq_size;
// Move point only if displacement is big enough w.r.t local size
// Move point only if displacement is big enough w.r.t. local size
if ( local_move_sq_ratio < sq_freeze_ratio_ )
return CGAL::NULL_VECTOR;

2
Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
View File

@ -563,7 +563,7 @@ private:
/**
* Initialize cells_queue w.r.t sliver_bound_
* Initialize cells_queue w.r.t. sliver_bound_
*/
void initialize_cells_priority_queue()
{

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

@ -3859,7 +3859,7 @@ Periodic_3_triangulation_3<GT,TDS>::get_cell(const Vertex_handle* vh) const
}
/*! \brief gets the offset of tester.point() such that
* this point is in conflict with c w.r.t tester.get_offset().
* this point is in conflict with c w.r.t. tester.get_offset().
*
* Implementation: Just try all eight possibilities.
*/

2
Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
View File

@ -51,7 +51,7 @@ From the perspective of a dynamic system of moving edges, such a distance can be
<I>instant</I> (in time). Therefore, every distinct position along a bisector corresponds
to a distinct instant in the offsetting process.
As they move inward, edges can expand or contract w.r.t to the endpoints sharing a vertex.
As they move inward, edges can expand or contract w.r.t. to the endpoints sharing a vertex.
If a vertex has an internal angle \f$ <\pi\f$, its incident edges will contract
but if its internal angle \f$ >\pi\f$, they will expand. The movement of the edges,
along with their extent change, result in collisions between non-adjacent edges.

2
Straight_skeleton_2/include/CGAL/predicates/Polygon_offset_pred_ftC2.h
View File

@ -26,7 +26,7 @@ namespace CGAL_SS_i {
// Given a triple of oriented straight line segments: (e0,e1,e2) such that
// there exists a distance 'et' for which the offsets lines at 'et' (e0',e1',e2') intersect in a single point;
// returns the relative order of 't' w.r.t 'et'.
// returns the relative order of 't' w.r.t. 'et'.
// PRECONDITION: There exists a positive distance et for which the offset triple intersect at a single point.
template<class K>
Uncertain<Comparison_result>

8
Straight_skeleton_2/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h
View File

@ -237,7 +237,7 @@ Uncertain<bool> exist_offset_lines_isec2 ( boost::intrusive_ptr< Trisegment_2<K,
// Given 2 triples of oriented straight line segments: (m0,m1,m2) and (n0,n1,n2), such that
// for each triple there exists distances 'mt' and 'nt' for which the offsets lines (at mt and nt resp.),
// (m0',m1',m2') and (n0',n1',n2') intersect each in a single point; returns the relative order of mt w.r.t nt.
// (m0',m1',m2') and (n0',n1',n2') intersect each in a single point; returns the relative order of mt w.r.t. nt.
// That is, indicates which offset triple intersects first (closer to the source lines)
// PRECONDITION: There exists distances mt and nt for which each offset triple intersect at a single point.
template<class K, class TimeCache, class CoeffCache>
@ -333,7 +333,7 @@ is_edge_facing_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K, Segme
}
// Given an event trisegment and two oriented straight line segments e0 and e1, returns the oriented side of the event point
// w.r.t the (positive) bisector [e0,e1].
// w.r.t. the (positive) bisector [e0,e1].
//
// The (positive) bisector [e0,e1] is a ray starting at the vertex (e0,e1) (called "v01")
//
@ -419,7 +419,7 @@ oriented_side_of_event_point_wrt_bisectorC2 ( boost::intrusive_ptr< Trisegment_2
Line_2 l1 = validate(compute_weighted_line_coeffC2(e1, w1, aCoeff_cache)) ;
CGAL_STSKEL_TRAITS_TRACE("Getting oriented side of point " << p2str(p)
<< " w.r.t bisector ["
<< " w.r.t. bisector ["
<< s2str(e0) << ( primary_is_0 ? "*" : "" )
<< ","
<< s2str(e1) << ( primary_is_0 ? "" : "*" )
@ -443,7 +443,7 @@ oriented_side_of_event_point_wrt_bisectorC2 ( boost::intrusive_ptr< Trisegment_2
// If e0 and e1 are collinear this line is the actual perpendicular bisector.
//
// If e0 and e1 are parallel but not collinear (then neccesarrily facing each other) this line
// is NOT the bisector, but the serves to determine the side of the point (projected along the primary edge) w.r.t vertex v01.
// is NOT the bisector, but the serves to determine the side of the point (projected along the primary edge) w.r.t. vertex v01.
FT a, b, c ;
perpendicular_through_pointC2( primary_is_0 ? l0.a() : l1.a()