*/
void SegSegIntersector::areOverlappedOrOnlyColinears(const Bounds *whereToFind, bool& colinearity, bool& areOverlapped)
{
+ static int oooo=0;
double determinant=_matrix[0]*_matrix[3]-_matrix[1]*_matrix[2];
if(fabs(determinant)>2.*QUADRATIC_PLANAR::_precision)//2*_precision due to max of offset on _start and _end
{
}
else
{
+ std::cerr << oooo++ << "****" << std::endl;
colinearity=true;
//retrieving initial matrix
double tmp=_matrix[0]; _matrix[0]=_matrix[3]; _matrix[3]=tmp;
std::vector< std::vector<int> >& edgesInOtherColinearWithThis, std::vector< std::vector<int> >& subDivOther,
std::vector<double>& addCoo, std::map<int,int>& mergedNodes)
{
- double xBaryBB, yBaryBB;
- double fact=normalizeExt(&other, xBaryBB, yBaryBB);
+ double xBaryBB=0., yBaryBB=0.;
+ double fact=1.;//normalizeExt(&other, xBaryBB, yBaryBB);
//
IteratorOnComposedEdge it1(this),it3(&other);
MergePoints merge;
{ (*itt)->incrRef(); nodesSafe[iii]=*itt; }
// end of protection
// Performs egde cutting:
+ INTERP_KERNEL::QUADRATIC_PLANAR::_arc_detection_precision=eps;
+ INTERP_KERNEL::QUADRATIC_PLANAR::_precision=eps;
pol1->splitAbs(*pol2,map1,map2,offset1,offset2,candidates2,intersectEdge1[i],i,colinear2,subDiv2,addCoo,mergedNodes);
delete pol2;
delete pol1;
{
try
{
+ INTERP_KERNEL::QUADRATIC_PLANAR::_arc_detection_precision=eps;
+ INTERP_KERNEL::QUADRATIC_PLANAR::_precision=eps;
+
INTERP_KERNEL::QuadraticPolygon::ComputeResidual(pol1,edges1,edgesBoundary2,mapp,offset3,i,addCoordsQuadratic,cr,crI,cNb1,cNb2);
}
catch(INTERP_KERNEL::Exception& e)