-// Copyright (C) 2007-2013 CEA/DEN, EDF R&D
+// Copyright (C) 2007-2016 CEA/DEN, EDF R&D
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
-// version 2.1 of the License.
+// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
/*************************************************************/
/* Computes the 3D intersection between two COPLANAR */
/* Segments [A,B] and [C,D], stores the result in V. */
- /* If A belongs to [CD] then the vertex E (preceeding A) */
+ /* If A belongs to [CD] then the vertex E (preceding A) */
/* is used to decide if the crossing is real. If A coincides */
/* with C or D, a special treatment is performed */
/*************************************************************/
{
if(distance2<DIM>(A,D)<_epsilon)
crossprod<DIM>(A,C,E,_vdouble);//store the crossprod between vectors AC and AE (E=vertex preceding A)
- return false;//case of paralell segments
+ return false;//case of parallel segments
}
case 3://beware AB and CD may belong to a vertical plane
det = determinant(&AB[1],&DC[1]);//determinant of the last two coefficients
{
if(distance2<DIM>(A,D)<_epsilon)
crossprod<DIM>(A,C,E,_vdouble);//store the crossprod between vectors AC and AE (E=vertex preceding A)
- return false;//case of paralell segments
+ return false;//case of parallel segments
}
}
}
/*******************************************************/
/* adds the possible crossings between segments [A,B] (with end-point global indices i and i_next) */
/*and segments [C,D] and [E,F] to the list inter and updates _End_segments */
- /* In cases of ambiguity, the vertex G is used to decide wether the crossing should be accepted */
+ /* In cases of ambiguity, the vertex G is used to decide whether the crossing should be accepted */
/*******************************************************/
template<int DIM>
inline void PolygonAlgorithms<DIM>::addCrossings( const double * A, const double * B, int i , int i_next,