Salome HOME
3a1f8a46a8df2d3538319a5f5e6a9265578a4b44
[tools/medcoupling.git] / src / INTERP_KERNELTest / QuadraticPlanarInterpTest.cxx
1 // Copyright (C) 2007-2015  CEA/DEN, EDF R&D
2 //
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
7 //
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
11 // Lesser General Public License for more details.
12 //
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
16 //
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
18 //
19 // Author : Anthony Geay (CEA/DEN)
20
21 #include "QuadraticPlanarInterpTest.hxx"
22 #include "InterpKernelGeo2DQuadraticPolygon.hxx"
23 #include "InterpKernelGeo2DEdgeArcCircle.hxx"
24 #include "InterpKernelGeo2DElementaryEdge.hxx"
25 #include "InterpKernelGeo2DComposedEdge.hxx"
26 #include "InterpKernelGeo2DEdgeLin.hxx"
27 #include "TestInterpKernelUtils.hxx"
28
29 #include <sstream>
30 #include <iostream>
31
32 using namespace INTERP_KERNEL;
33
34 namespace INTERP_TEST
35 {
36
37 static const double ADMISSIBLE_ERROR = 1.e-14;
38
39 void QuadraticPlanarInterpTest::setUp()
40 {
41 }
42
43 void QuadraticPlanarInterpTest::tearDown()
44 {
45 }
46
47 void QuadraticPlanarInterpTest::cleanUp()
48 {
49 }
50
51 void QuadraticPlanarInterpTest::ReadWriteInXfigElementary()
52 {
53   //Testing bounds calculation. For Seg2
54   std::istringstream stream("2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 2\n3200 3400 4500 4700");
55   EdgeLin *e1=new EdgeLin(stream);
56   Bounds bound=e1->getBounds();
57   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.32,bound[0],ADMISSIBLE_ERROR);
58   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.45,bound[1],ADMISSIBLE_ERROR);
59   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.34,bound[2],ADMISSIBLE_ERROR);
60   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.47,bound[3],ADMISSIBLE_ERROR);
61   e1->decrRef();
62   std::istringstream stream2("2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 2\n4500 4700 3200 3400");
63   e1=new EdgeLin(stream2);
64   bound=e1->getBounds();
65   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.32,bound[0],ADMISSIBLE_ERROR);
66   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.45,bound[1],ADMISSIBLE_ERROR);
67   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.34,bound[2],ADMISSIBLE_ERROR);
68   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.47,bound[3],ADMISSIBLE_ERROR);
69   e1->decrRef();
70   //Testing bounds calculation For Arc of circle.
71   
72 }
73
74 void QuadraticPlanarInterpTest::ReadWriteInXfigGlobal()
75 {
76   QuadraticPolygon pol1(INTERP_TEST::getResourceFile("Pol1.fig").c_str());
77   pol1.dumpInXfigFile("Pol1_gen.fig");
78   QuadraticPolygon pol2(INTERP_TEST::getResourceFile("Pol2.fig").c_str());
79   pol2.dumpInXfigFile("Pol2_gen.fig");
80   QuadraticPolygon pol3(INTERP_TEST::getResourceFile("Pol3.fig").c_str());
81   pol3.dumpInXfigFile("Pol3_gen.fig");
82   QuadraticPolygon pol4(INTERP_TEST::getResourceFile("Pol4.fig").c_str());
83   CPPUNIT_ASSERT_EQUAL(1,pol4.size());
84   ElementaryEdge *edge1=dynamic_cast<ElementaryEdge *>(pol4[0]);
85   CPPUNIT_ASSERT(edge1);
86   Edge *edge2=edge1->getPtr();
87   EdgeArcCircle *edge=dynamic_cast<EdgeArcCircle *>(edge2);
88   CPPUNIT_ASSERT(edge);
89   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.24375,edge->getRadius(),ADMISSIBLE_ERROR);
90   CPPUNIT_ASSERT_DOUBLES_EQUAL(5.7857653289925404,edge->getAngle(),ADMISSIBLE_ERROR);
91   double center[2];
92   edge->getCenter(center);
93   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.48,center[0],ADMISSIBLE_ERROR);
94   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.48375,center[1],ADMISSIBLE_ERROR);
95   const double *start=*edge->getStartNode();
96   Node *n1=new Node(start[0]+2*(center[0]-start[0]),start[1]+2*(center[1]-start[1]));
97   edge->changeMiddle(n1);
98   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.24375,edge->getRadius(),ADMISSIBLE_ERROR);
99   CPPUNIT_ASSERT_DOUBLES_EQUAL(5.7857653289925404,edge->getAngle(),ADMISSIBLE_ERROR);
100   n1->decrRef();
101   n1=new Node(center[0],center[1]+0.24375);
102   edge->changeMiddle(n1);
103   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.24375,edge->getRadius(),ADMISSIBLE_ERROR);
104   CPPUNIT_ASSERT_DOUBLES_EQUAL(-0.49741997818704586,edge->getAngle(),ADMISSIBLE_ERROR);//5.7857653289925404 + 2*PI
105   n1->decrRef();
106   //A half circle.
107   EdgeArcCircle *e=new EdgeArcCircle(0.84,0.54,0.78,0.6,0.84,0.66);
108   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.06,e->getRadius(),ADMISSIBLE_ERROR);
109   CPPUNIT_ASSERT_DOUBLES_EQUAL(-3.1415925921507317,e->getAngle(),1e-5);
110   e->decrRef();
111   e=new EdgeArcCircle(0.84,0.54,0.9,0.6,0.84,0.66);
112   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.06,e->getRadius(),ADMISSIBLE_ERROR);
113   CPPUNIT_ASSERT_DOUBLES_EQUAL(3.1415925921507317,e->getAngle(),1e-5);
114   e->decrRef();
115 }
116
117 void QuadraticPlanarInterpTest::BasicGeometricTools()
118 {
119   Node *n1=new Node(1.,1.);
120   Node *n2=new Node(4.,2.);
121   EdgeLin *e1=new EdgeLin(n1,n2);
122   double tmp[2];
123   e1->getNormalVector(tmp);
124   CPPUNIT_ASSERT_DOUBLES_EQUAL(-0.94868329805051377,tmp[1],ADMISSIBLE_ERROR);
125   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.31622776601683794,tmp[0],ADMISSIBLE_ERROR);
126   e1->decrRef();
127   n1->decrRef(); n2->decrRef();
128   n1=new Node(1.,1.);
129   n2=new Node(0.,4.);
130   e1=new EdgeLin(n1,n2);
131   double tmp2[2];
132   e1->getNormalVector(tmp2);
133   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.,Node::dot(tmp,tmp2),1e-10);
134   tmp[0]=0.5; tmp[1]=2.5;
135   CPPUNIT_ASSERT(e1->isNodeLyingOn(tmp));
136   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.,e1->getDistanceToPoint(tmp),1e-12);
137   tmp[1]=2.55; CPPUNIT_ASSERT(!e1->isNodeLyingOn(tmp));
138   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.0158113883008418,e1->getDistanceToPoint(tmp),1e-12);
139   tmp[0]=0.; tmp[1]=5.;
140   CPPUNIT_ASSERT_DOUBLES_EQUAL(1.,e1->getDistanceToPoint(tmp),1e-12);
141   EdgeArcCircle *e=new EdgeArcCircle(4.,3.,0.,5.,-5.,0.);
142   tmp[0]=-4.; tmp[1]=3.;
143   CPPUNIT_ASSERT(e->isNodeLyingOn(tmp));
144   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.,e->getDistanceToPoint(tmp),1e-12);
145   tmp[1]=3.1; CPPUNIT_ASSERT(!e->isNodeLyingOn(tmp));
146   CPPUNIT_ASSERT_DOUBLES_EQUAL(6.0632371551998077e-2,e->getDistanceToPoint(tmp),1e-12);
147   tmp[0]=-4.; tmp[1]=-3.;
148   CPPUNIT_ASSERT(!e->isNodeLyingOn(tmp));
149   CPPUNIT_ASSERT_DOUBLES_EQUAL(3.1622776601683795,e->getDistanceToPoint(tmp),1e-12);
150   e->decrRef();
151   e1->decrRef();
152   n1->decrRef(); n2->decrRef();
153 }
154
155 void QuadraticPlanarInterpTest::IntersectionBasics()
156 {
157   //Testing intersection of Bounds.
158   std::istringstream stream1("2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 2\n3200 3400 4500 4800");
159   EdgeLin *e1=new EdgeLin(stream1);
160   std::istringstream stream2("2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 2\n3200 3400 4500 4800");
161   EdgeLin *e2=new EdgeLin(stream2);
162   Bounds *bound=e1->getBounds().amIIntersectingWith(e2->getBounds()); CPPUNIT_ASSERT(bound);
163   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.32,(*bound)[0],ADMISSIBLE_ERROR);
164   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.45,(*bound)[1],ADMISSIBLE_ERROR);
165   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.34,(*bound)[2],ADMISSIBLE_ERROR);
166   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.48,(*bound)[3],ADMISSIBLE_ERROR);
167   delete bound;
168   e2->decrRef(); e1->decrRef();
169   //
170   std::istringstream stream3("2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 2\n3000 7200 6000 3700");
171   EdgeLin *e3=new EdgeLin(stream3);
172   std::istringstream stream4("2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 2\n4800 6600 7200 4200");
173   EdgeLin *e4=new EdgeLin(stream4);
174   bound=e3->getBounds().amIIntersectingWith(e4->getBounds()); CPPUNIT_ASSERT(bound);
175   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.48,(*bound)[0],ADMISSIBLE_ERROR);
176   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.6,(*bound)[1],ADMISSIBLE_ERROR);
177   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.42,(*bound)[2],ADMISSIBLE_ERROR);
178   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.66,(*bound)[3],ADMISSIBLE_ERROR);
179   delete bound;
180   e3->decrRef(); e4->decrRef();
181 }
182
183 void QuadraticPlanarInterpTest::EdgeLinUnitary()
184 {
185   EdgeLin *e1=new EdgeLin(0.5,0.5,3.7,4.1);
186   Node *n=new Node(2.1,2.3);
187   CPPUNIT_ASSERT_DOUBLES_EQUAL(e1->getCharactValue(*n),0.5,1e-8);
188   n->decrRef();
189   n=new Node(3.7,4.1);
190   CPPUNIT_ASSERT_DOUBLES_EQUAL(e1->getCharactValue(*n),1.,1e-8);
191   n->decrRef();
192   n=new Node(0.5,0.5);
193   CPPUNIT_ASSERT_DOUBLES_EQUAL(e1->getCharactValue(*n),0.,1e-8);
194   n->decrRef();
195   n=new Node(-1.1,-1.3);
196   CPPUNIT_ASSERT_DOUBLES_EQUAL(e1->getCharactValue(*n),-0.5,1e-8);
197   n->decrRef();
198   n=new Node(5.3,5.9);
199   CPPUNIT_ASSERT_DOUBLES_EQUAL(e1->getCharactValue(*n),1.5,1e-8);
200   n->decrRef(); e1->decrRef();
201 }
202
203 /*!
204  * Here two things are tested. 
205  * 1 ) One the overlapping calculation capability of edge/edge intersector.
206  * 2 ) Then the capability to handle the case where 2 segs (whatever their type) are overlapped.
207  * All the configuration of full or part overlapping have been tested.
208  */
209 void QuadraticPlanarInterpTest::IntersectionEdgeOverlapUnitarySegSeg()
210 {
211   ComposedEdge& v1=*(new ComposedEdge);
212   ComposedEdge& v2=*(new ComposedEdge);
213   MergePoints v3;
214   //Testing merge of geometric equals seg2.
215   Edge *e1=new EdgeLin(0.5,0.5,1.,1.); Edge *e2=new EdgeLin(0.5,0.5,1.,1.);
216   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
217   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
218   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size()); CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
219   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection());
220   v1.clear(); v2.clear(); v3.clear();
221   //  - testing by adding some noise
222   e1->decrRef(); e1=new EdgeLin(0.5+5.e-15,0.5-5.e-15,1.,1.+7.e-15);
223   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
224   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
225   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size()); CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
226   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection());
227   e2->decrRef(); e1->decrRef();
228   v1.clear(); v2.clear(); v3.clear();
229   //Testing merge of geometric equals seg2 but now with opposite direction
230   e1=new EdgeLin(0.5,0.5,0.7,0.7); e2=new EdgeLin(0.7+6.e-15,0.7-2.e-15,0.5+3.e-15,0.5-4.e-15);
231   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
232   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
233   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size()); CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
234   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && !v2[0]->getDirection());//compared 8 lines above !v2[0]->getDirection()
235   e2->decrRef(); e1->decrRef();
236   v1.clear(); v2.clear(); v3.clear();
237   //Test 0
238   //Test 1 - OUT_AFTER - OUT_AFTER | same dir. - 0°
239   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(1.5,0.,2.,0.);
240   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
241   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
242   CPPUNIT_ASSERT_EQUAL(0,(int)v1.size());
243   CPPUNIT_ASSERT_EQUAL(0,(int)v2.size());
244   e2->decrRef(); e1->decrRef();
245   v1.clear(); v2.clear(); v3.clear();
246   //Test 2 - INSIDE - OUT_AFTER | same dir. - 0°
247   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(0.5,0.,1.5,0.);
248   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
249   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
250   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
251   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
252   CPPUNIT_ASSERT(v1[1]->intresicEqualDirSensitive(v2[0]));
253   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
254   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode()); CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
255   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
256   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
257   e2->decrRef(); e1->decrRef();
258   v1.clear(); v2.clear(); v3.clear();
259   //Test 2 - INSIDE - OUT_AFTER | same dir. - 90°
260   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,0.5,0.,1.5);
261   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
262   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
263   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
264   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
265   CPPUNIT_ASSERT(v1[1]->intresicEqualDirSensitive(v2[0]));
266   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
267   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode()); CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
268   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
269   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
270   e2->decrRef(); e1->decrRef();
271   v1.clear(); v2.clear(); v3.clear();
272   //Test 2 - INSIDE - OUT_AFTER | same dir. - 45°
273   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.5,0.5,1.5,1.5);
274   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
275   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
276   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
277   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
278   CPPUNIT_ASSERT(v1[1]->intresicEqualDirSensitive(v2[0]));
279   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
280   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode()); CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
281   e2->decrRef(); e1->decrRef();
282   v1.clear(); v2.clear(); v3.clear();
283   //Test 2 - INSIDE - OUT_AFTER | opp. dir. - 45°
284   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(1.5,1.5,0.5,0.5);
285   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
286   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
287   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
288   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
289   CPPUNIT_ASSERT(!v1[1]->intresicEqualDirSensitive(v2[1]) && v1[1]->intresicEqual(v2[1]));
290   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
291   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode()); CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
292   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
293   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
294   e2->decrRef(); e1->decrRef();
295   v1.clear(); v2.clear(); v3.clear();
296   //Test 3 - INSIDE - INSIDE | same dir. - 0°
297   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(0.25,0.,0.75,0.);
298   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
299   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
300   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
301   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
302   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && v1[1]->getDirection());
303   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==v1[2]->getStartNode());
304   CPPUNIT_ASSERT(v1[0]->getStartNode()== e1->getStartNode()); CPPUNIT_ASSERT(v1[2]->getEndNode()== e1->getEndNode());
305   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getEndNode());
306   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
307   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
308   e2->decrRef(); e1->decrRef();
309   v1.clear(); v2.clear(); v3.clear();
310   //Test 3 - INSIDE - INSIDE | same dir. - 90°
311   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,0.25,0.,0.75);
312   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
313   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
314   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
315   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
316   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && v1[1]->getDirection());
317   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==v1[2]->getStartNode());
318   CPPUNIT_ASSERT(v1[0]->getStartNode()== e1->getStartNode()); CPPUNIT_ASSERT(v1[2]->getEndNode()== e1->getEndNode());
319   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getEndNode());
320   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
321   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
322   e2->decrRef(); e1->decrRef();
323   v1.clear(); v2.clear(); v3.clear();
324   //Test 3 - INSIDE - INSIDE | same dir. - 45°
325   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.25,0.25,0.75,0.75);
326   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
327   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
328   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
329   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
330   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && v1[1]->getDirection());
331   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==v1[2]->getStartNode());
332   CPPUNIT_ASSERT(v1[0]->getStartNode()== e1->getStartNode()); CPPUNIT_ASSERT(v1[2]->getEndNode()== e1->getEndNode());
333   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getEndNode());
334   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
335   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
336   e2->decrRef(); e1->decrRef();
337   v1.clear(); v2.clear(); v3.clear();
338   //Test 3 - INSIDE - INSIDE | opp dir. - 45°
339   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.75,0.75,0.25,0.25);
340   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
341   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
342   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
343   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
344   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && !v1[1]->getDirection());
345   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==v1[2]->getStartNode());
346   CPPUNIT_ASSERT(v1[0]->getStartNode()== e1->getStartNode()); CPPUNIT_ASSERT(v1[2]->getEndNode()== e1->getEndNode());
347   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getEndNode()); CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getStartNode());
348   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
349   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
350   e2->decrRef(); e1->decrRef();
351   v1.clear(); v2.clear(); v3.clear();
352   //Test 3bis - INSIDE - INSIDE - Bis | opp dir.
353   double center[2]={0.,0.};
354   double radius=1.;
355   e1=buildArcOfCircle(center,radius,-M_PI,0); e2=buildArcOfCircle(center,radius,-2*M_PI/3.+2*M_PI,-M_PI/3.);
356   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(5.*M_PI/3.,e2->getCurveLength(),1e-12);// To check that in the previous line +2.M_PI has done its job.
357   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
358   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
359   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
360   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
361   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(v2[0]->getPtr())); CPPUNIT_ASSERT(v1[0]->getDirection()); CPPUNIT_ASSERT(!v2[0]->getDirection());
362   CPPUNIT_ASSERT(v1[2]->intresincEqCoarse(v2[2]->getPtr())); CPPUNIT_ASSERT(v1[2]->getDirection()); CPPUNIT_ASSERT(!v2[2]->getDirection());
363   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[1]->getCurveLength(),1.e-12);
364   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v1[1]->getCurveLength(),1.e-12);
365   CPPUNIT_ASSERT(v2[1]->getStartNode()==e1->getStartNode());
366   CPPUNIT_ASSERT(v2[1]->getEndNode()==e1->getEndNode());
367   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
368   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getStartNode());
369   CPPUNIT_ASSERT(v1[1]->getStartNode()==e2->getStartNode());
370   CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getEndNode());
371   e2->decrRef(); e1->decrRef();
372   v1.clear(); v2.clear(); v3.clear();
373   //Test 3bis - INSIDE - INSIDE - Bis | same dir.
374   e1=buildArcOfCircle(center,radius,-M_PI,0); e2=buildArcOfCircle(center,radius,-M_PI/3.,-2*M_PI/3.+2*M_PI);
375   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(5.*M_PI/3.,e2->getCurveLength(),1e-12);// To check that in the previous line +2.M_PI has done its job.
376   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
377   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
378   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
379   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
380   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(v2[2]->getPtr())); CPPUNIT_ASSERT(v1[0]->getDirection()); CPPUNIT_ASSERT(v2[2]->getDirection());
381   CPPUNIT_ASSERT(v1[2]->intresincEqCoarse(v2[0]->getPtr())); CPPUNIT_ASSERT(v1[2]->getDirection()); CPPUNIT_ASSERT(v2[0]->getDirection());
382   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[1]->getCurveLength(),1.e-12);
383   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v1[1]->getCurveLength(),1.e-12);
384   CPPUNIT_ASSERT(v2[1]->getStartNode()==e1->getEndNode());
385   CPPUNIT_ASSERT(v2[1]->getEndNode()==e1->getStartNode());
386   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
387   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getEndNode());
388   CPPUNIT_ASSERT(v1[1]->getStartNode()==e2->getEndNode());
389   CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getStartNode());
390   e2->decrRef(); e1->decrRef();
391   v1.clear(); v2.clear(); v3.clear();
392   //Test 3bis - INSIDE - INSIDE - Bis | opp dir. | e1<->e2 to test symetry
393   e1=buildArcOfCircle(center,radius,-M_PI,0); e2=buildArcOfCircle(center,radius,-2*M_PI/3.+2*M_PI,-M_PI/3.);
394   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(5.*M_PI/3.,e2->getCurveLength(),1e-12);// To check that in the previous line +2.M_PI has done its job.
395   CPPUNIT_ASSERT(e2->intersectWith(e1,v3,v2,v1));
396   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
397   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
398   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
399   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(v2[0]->getPtr())); CPPUNIT_ASSERT(!v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->getDirection());
400   CPPUNIT_ASSERT(v1[2]->intresincEqCoarse(v2[2]->getPtr())); CPPUNIT_ASSERT(!v1[2]->getDirection()); CPPUNIT_ASSERT(v2[2]->getDirection());
401   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[1]->getCurveLength(),1.e-5); // << not maximal precision because node switching 
402   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v1[1]->getCurveLength(),1.e-12);
403   CPPUNIT_ASSERT(v2[1]->getStartNode()==e1->getStartNode());
404   CPPUNIT_ASSERT(v2[1]->getEndNode()==e1->getEndNode());
405   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
406   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getStartNode());
407   CPPUNIT_ASSERT(v1[1]->getStartNode()==e2->getStartNode());
408   CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getEndNode());
409   e2->decrRef(); e1->decrRef();
410   v1.clear(); v2.clear(); v3.clear();
411   //Test 3bis - INSIDE - INSIDE - Bis | same dir. | e1<->e2 to test symetry
412   e1=buildArcOfCircle(center,radius,-M_PI,0); e2=buildArcOfCircle(center,radius,-M_PI/3.,-2*M_PI/3.+2*M_PI);
413   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(5.*M_PI/3.,e2->getCurveLength(),1e-12);// To check that in the previous line +2.M_PI has done its job.
414   CPPUNIT_ASSERT(e2->intersectWith(e1,v3,v2,v1));
415   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
416   CPPUNIT_ASSERT_EQUAL(3,(int)v1.size());
417   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
418   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(v2[2]->getPtr())); CPPUNIT_ASSERT(v1[0]->getDirection()); CPPUNIT_ASSERT(v2[2]->getDirection());
419   CPPUNIT_ASSERT(v1[2]->intresincEqCoarse(v2[0]->getPtr())); CPPUNIT_ASSERT(v1[2]->getDirection()); CPPUNIT_ASSERT(v2[0]->getDirection());
420   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[1]->getCurveLength(),1.e-5); // << not maximal precision because node switching 
421   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v1[1]->getCurveLength(),1.e-12);
422   CPPUNIT_ASSERT(v2[1]->getStartNode()==e1->getEndNode());
423   CPPUNIT_ASSERT(v2[1]->getEndNode()==e1->getStartNode());
424   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
425   CPPUNIT_ASSERT(v1[0]->getEndNode()==e2->getEndNode());
426   CPPUNIT_ASSERT(v1[1]->getStartNode()==e2->getEndNode());
427   CPPUNIT_ASSERT(v1[1]->getEndNode()==e2->getStartNode());
428   e2->decrRef(); e1->decrRef();
429   v1.clear(); v2.clear(); v3.clear();
430   //Test 4 - OUT_BEFORE - OUT_BEFORE | same dir. - 0 °
431   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(-1.,0.,-0.5,0.);
432   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
433   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
434   CPPUNIT_ASSERT_EQUAL(0,(int)v1.size());
435   CPPUNIT_ASSERT_EQUAL(0,(int)v2.size());
436   e2->decrRef(); e1->decrRef();
437   v1.clear(); v2.clear(); v3.clear();
438   //Test 5 - OUT_BEFORE - INSIDE | same dir. - 0°
439   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(-0.5,0.,0.5,0.);
440   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
441   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
442   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
443   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
444   CPPUNIT_ASSERT(v1[0]->intresicEqualDirSensitive(v2[1]));
445   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
446   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
447   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
448   e2->decrRef(); e1->decrRef();
449   v1.clear(); v2.clear(); v3.clear();
450   //Test 5 - OUT_BEFORE - INSIDE | same dir. - 90°
451   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0,-0.5,0.,0.5);
452   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
453   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
454   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
455   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
456   CPPUNIT_ASSERT(v1[0]->intresicEqualDirSensitive(v2[1]));
457   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
458   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
459   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
460   e2->decrRef(); e1->decrRef();
461   v1.clear(); v2.clear(); v3.clear();
462   //Test 5 - OUT_BEFORE - INSIDE | same dir. - 45°
463   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(-0.5,-0.5,0.5,0.5);
464   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
465   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
466   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
467   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
468   CPPUNIT_ASSERT(v1[0]->intresicEqualDirSensitive(v2[1]));
469   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
470   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
471   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
472   e2->decrRef(); e1->decrRef();
473   v1.clear(); v2.clear(); v3.clear();
474   //Test 5 - OUT_BEFORE - INSIDE | opp dir. - 45°
475   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.5,0.5,-0.5,-0.5);
476   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
477   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
478   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
479   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
480   CPPUNIT_ASSERT(!v1[0]->intresicEqualDirSensitive(v2[0]) && v1[0]->intresicEqual(v2[0]) );
481   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
482   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
483   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
484   e2->decrRef(); e1->decrRef();
485   v1.clear(); v2.clear(); v3.clear();
486   //Test 6 - OUT_BEFORE - OUT_AFTER | same dir. - 0°
487   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(-0.5,0.,1.5,0.);
488   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
489   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
490   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
491   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
492   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection());
493   CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && v2[1]->getDirection());
494   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode() && v2[1]->getEndNode()==v2[2]->getStartNode());
495   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
496   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
497   e2->decrRef(); e1->decrRef();
498   v1.clear(); v2.clear(); v3.clear();
499   //Test 6 - OUT_BEFORE - OUT_AFTER | same dir. - 90°
500   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,-0.5,0.,1.5);
501   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
502   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
503   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
504   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
505   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection());
506   CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && v2[1]->getDirection());
507   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode() && v2[1]->getEndNode()==v2[2]->getStartNode());
508   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
509   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
510   e2->decrRef(); e1->decrRef();
511   v1.clear(); v2.clear(); v3.clear();
512   //Test 6 - OUT_BEFORE - OUT_AFTER | same dir. - 45°
513   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(-0.5,-0.5,1.5,1.5);
514   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
515   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
516   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
517   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
518   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection());
519   CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && v2[1]->getDirection());
520   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode() && v2[1]->getEndNode()==v2[2]->getStartNode());
521   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
522   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
523   e2->decrRef(); e1->decrRef();
524   v1.clear(); v2.clear(); v3.clear();
525   //Test 6 - OUT_BEFORE - OUT_AFTER | opp dir. - 45°
526   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(1.5,1.5,-0.5,-0.5);
527   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
528   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
529   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
530   CPPUNIT_ASSERT_EQUAL(3,(int)v2.size());
531   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection());
532   CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && !v2[1]->getDirection());
533   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode() && v2[1]->getEndNode()==v2[2]->getStartNode());
534   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
535   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
536   e2->decrRef(); e1->decrRef();
537   v1.clear(); v2.clear(); v3.clear();
538   //Test 7 - END - OUT_AFTER | same dir. - 0°
539   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(1.,0.,1.5,0.);
540   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
541   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
542   CPPUNIT_ASSERT_EQUAL(0,(int)v1.size());
543   CPPUNIT_ASSERT_EQUAL(0,(int)v2.size());
544   e2->decrRef(); e1->decrRef();
545   v1.clear(); v2.clear(); v3.clear();
546   //Test 7 - END - OUT_AFTER | opp dir. - 0°
547   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(1.5,0.,1.,0.);
548   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
549   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
550   CPPUNIT_ASSERT_EQUAL(0,(int)v1.size());
551   CPPUNIT_ASSERT_EQUAL(0,(int)v2.size());
552   CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
553   e2->decrRef(); e1->decrRef();
554   v1.clear(); v2.clear(); v3.clear();
555   //Test 8 - START - END | same dir. - 0°
556   e1=new EdgeLin(0.,0.,0.7,0.); e2=new EdgeLin(0.,0.,0.7,0.);
557   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
558   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
559   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
560   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
561   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection());
562   CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
563   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
564   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
565   e2->decrRef(); e1->decrRef();
566   v1.clear(); v2.clear(); v3.clear();
567   //Test 8 - START - END | same dir. - 90°
568   e1=new EdgeLin(0.,0.,0.,0.7); e2=new EdgeLin(0.,0.,0.,0.7);
569   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
570   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
571   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
572   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
573   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection());
574   CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
575   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
576   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
577   e2->decrRef(); e1->decrRef();
578   v1.clear(); v2.clear(); v3.clear();
579   //Test 8 - START - END | same dir. - 45°
580   e1=new EdgeLin(0.,0.,0.7,0.7); e2=new EdgeLin(0.,0.,0.7,0.7);
581   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
582   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
583   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
584   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
585   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection());
586   CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
587   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
588   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
589   e2->decrRef(); e1->decrRef();
590   v1.clear(); v2.clear(); v3.clear();
591   //Test 8 - START - END | opp. dir. - 45°
592   e1=new EdgeLin(0.,0.,0.7,0.7); e2=new EdgeLin(0.7,0.7,0.,0.);
593   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
594   CPPUNIT_ASSERT_EQUAL(2,(int)v3.getNumberOfAssociations());
595   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
596   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
597   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && !v2[0]->getDirection());
598   CPPUNIT_ASSERT(e1->getStartNode()==e2->getEndNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getStartNode());
599   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
600   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
601   e2->decrRef(); e1->decrRef();
602   v1.clear(); v2.clear(); v3.clear();
603   //Test 9 - OUT_BEFORE - START | same dir.
604   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(-0.5,0.,0.,0.);
605   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
606   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
607   CPPUNIT_ASSERT_EQUAL(0,(int)v1.size());
608   CPPUNIT_ASSERT_EQUAL(0,(int)v2.size());
609   CPPUNIT_ASSERT(e2->getEndNode()==e1->getStartNode());
610   e2->decrRef(); e1->decrRef();
611   v1.clear(); v2.clear(); v3.clear();
612   //Test 10 - START - OUT_AFTER | same dir. - 0°
613   e1=new EdgeLin(0.,0.,0.7,0.); e2=new EdgeLin(0.,0.,1.,0.);
614   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
615   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
616   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
617   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
618   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection()); 
619   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(v2[1]->getEndNode()==e2->getEndNode());
620   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
621   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
622   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
623   e2->decrRef(); e1->decrRef();
624   v1.clear(); v2.clear(); v3.clear();
625   //Test 10 - START - OUT_AFTER | same dir. - 90°
626   e1=new EdgeLin(0.,0.,0.,0.7); e2=new EdgeLin(0.,0.,0.,1.);
627   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
628   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
629   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
630   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
631   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection()); 
632   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(v2[1]->getEndNode()==e2->getEndNode());
633   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
634   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
635   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
636   e2->decrRef(); e1->decrRef();
637   v1.clear(); v2.clear(); v3.clear();
638   //Test 10 - START - OUT_AFTER | same dir. - 45°
639   e1=new EdgeLin(0.,0.,0.7,0.7); e2=new EdgeLin(0.,0.,1.,1.);
640   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
641   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
642   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
643   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
644   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && v2[0]->getDirection()); 
645   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(v2[1]->getEndNode()==e2->getEndNode());
646   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
647   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
648   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
649   e2->decrRef(); e1->decrRef();
650   v1.clear(); v2.clear(); v3.clear();
651   //Test 10 - START - OUT_AFTER | opp dir. - 45°
652   e1=new EdgeLin(0.,0.,0.7,0.7); e2=new EdgeLin(1.,1.,0.,0.);
653   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
654   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
655   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
656   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
657   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && !v2[1]->getDirection()); 
658   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getEndNode()); CPPUNIT_ASSERT(v2[1]->getEndNode()==e2->getEndNode());
659   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
660   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
661   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
662   e2->decrRef(); e1->decrRef();
663   v1.clear(); v2.clear(); v3.clear();
664   //Test 11 - INSIDE - END | same dir. - 0°
665   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(0.7,0.,1.,0.);
666   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
667   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
668   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
669   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
670   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && v1[1]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection()); 
671   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
672   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
673   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
674   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
675   e2->decrRef(); e1->decrRef();
676   v1.clear(); v2.clear(); v3.clear();
677   //Test 11 - INSIDE - END | same dir. - 90°
678   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,0.7,0.,1.);
679   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
680   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
681   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
682   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
683   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && v1[1]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection()); 
684   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
685   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
686   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
687   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
688   e2->decrRef(); e1->decrRef();
689   v1.clear(); v2.clear(); v3.clear();
690   //Test 11 - INSIDE - END | same dir. - 45°
691   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.7,0.7,1.,1.);
692   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
693   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
694   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
695   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
696   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && v1[1]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection()); 
697   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode());
698   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
699   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
700   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
701   e2->decrRef(); e1->decrRef();
702   v1.clear(); v2.clear(); v3.clear();
703   //Test 11 - INSIDE - END | opp dir. - 45°
704   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(1.,1.,0.7,0.7);
705   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
706   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
707   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
708   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
709   CPPUNIT_ASSERT(e1->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getStartNode());
710   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(e2) && !v1[1]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection()); 
711   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
712   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
713   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
714   e2->decrRef(); e1->decrRef();
715   v1.clear(); v2.clear(); v3.clear();
716   //Test 12 - OUT_BEFORE - END | same dir. - 0°
717   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(-0.5,0.,1.,0.);
718   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
719   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
720   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
721   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
722   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && v2[1]->getDirection());
723   CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
724   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
725   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
726   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
727   e2->decrRef(); e1->decrRef();
728   v1.clear(); v2.clear(); v3.clear();
729   //Test 12 - OUT_BEFORE - END | same dir. - 90°
730   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,-0.5,0.,1.);
731   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
732   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
733   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
734   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
735   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && v2[1]->getDirection());
736   CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
737   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
738   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
739   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
740   e2->decrRef(); e1->decrRef();
741   v1.clear(); v2.clear(); v3.clear();
742   //Test 12 - OUT_BEFORE - END | same dir. - 45°
743   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(-0.5,-0.5,1.,1.);
744   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
745   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
746   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
747   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
748   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[1]->intresincEqCoarse(e1) && v2[1]->getDirection());
749   CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getEndNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
750   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
751   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
752   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
753   e2->decrRef(); e1->decrRef();
754   v1.clear(); v2.clear(); v3.clear();
755   //Test 12 - OUT_BEFORE - END | opp dir. - 45°
756   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(1.,1.,-0.5,-0.5);
757   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
758   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
759   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
760   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
761   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e1) && !v2[0]->getDirection());
762   CPPUNIT_ASSERT(e2->getStartNode()==v2[0]->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==e2->getStartNode()); CPPUNIT_ASSERT(e2->getEndNode()==v2[1]->getEndNode());
763   CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
764   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
765   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
766   e2->decrRef(); e1->decrRef();
767   v1.clear(); v2.clear(); v3.clear();
768   //Test 13 - START - INSIDE | same dir. - 0°
769   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(0.,0.,0.5,0.);
770   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
771   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
772   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
773   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
774   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e2) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection());
775   CPPUNIT_ASSERT(e2->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
776   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
777   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
778   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
779   e2->decrRef(); e1->decrRef();
780   v1.clear(); v2.clear(); v3.clear();
781   //Test 13 - START - INSIDE | same dir. - 90°
782   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,0.,0.,0.5);
783   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
784   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
785   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
786   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
787   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e2) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection());
788   CPPUNIT_ASSERT(e2->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
789   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
790   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
791   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
792   e2->decrRef(); e1->decrRef();
793   v1.clear(); v2.clear(); v3.clear();
794   //Test 13 - START - INSIDE | same dir. - 45°
795   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.,0.,0.5,0.5);
796   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
797   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
798   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
799   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
800   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e2) && v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection());
801   CPPUNIT_ASSERT(e2->getStartNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getStartNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
802   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
803   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
804   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
805   e2->decrRef(); e1->decrRef();
806   v1.clear(); v2.clear(); v3.clear();
807   //Test 13 - START - INSIDE | opp dir. - 45°
808   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.5,0.5,0.,0.);
809   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
810   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
811   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
812   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
813   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e2) && !v1[0]->getDirection()); CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection());
814   CPPUNIT_ASSERT(e2->getEndNode()==v1[0]->getStartNode()); CPPUNIT_ASSERT(e1->getStartNode()==e2->getEndNode()); CPPUNIT_ASSERT(e1->getEndNode()==v1[1]->getEndNode());
815   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode());
816   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
817   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
818   e2->decrRef(); e1->decrRef();
819   v1.clear(); v2.clear(); v3.clear();
820   //Test 14 - INSIDE - START | same dir.
821   e1=buildArcOfCircle(center,radius,-M_PI,2.*M_PI); e2=buildArcOfCircle(center,radius,M_PI/3.,-M_PI);
822   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(4.*M_PI/3.,e2->getCurveLength(),1e-12);
823   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
824   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
825   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
826   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
827   CPPUNIT_ASSERT(v1[1]->intresicEqual(v2[0]));
828   CPPUNIT_ASSERT(v2[1]->getEndNode()==e1->getStartNode());
829   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
830   CPPUNIT_ASSERT(v1[1]->getEndNode()==e1->getEndNode());
831   CPPUNIT_ASSERT(v2[1]->getStartNode()==e1->getEndNode());
832   CPPUNIT_ASSERT_DOUBLES_EQUAL(2*M_PI/3.,v1[0]->getCurveLength(),1.e-12);
833   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v2[0]->getCurveLength(),1.e-12);
834   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[1]->getCurveLength(),1.e-12);
835   e2->decrRef(); e1->decrRef();
836   v1.clear(); v2.clear(); v3.clear();
837   //Test 14 - INSIDE - START | opp dir.
838   e1=buildArcOfCircle(center,radius,-M_PI,2.*M_PI); e2=buildArcOfCircle(center,radius,-M_PI,M_PI/3.);
839   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(4.*M_PI/3.,e2->getCurveLength(),1e-12);
840   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
841   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
842   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
843   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
844   CPPUNIT_ASSERT(v1[1]->intresincEqCoarse(v2[1]->getPtr()) && !v2[1]->getDirection() && v1[1]->getDirection());
845   CPPUNIT_ASSERT(v2[0]->getStartNode()==e1->getStartNode());
846   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
847   CPPUNIT_ASSERT(v1[1]->getEndNode()==e1->getEndNode());
848   CPPUNIT_ASSERT(v2[1]->getStartNode()==e1->getEndNode());
849   CPPUNIT_ASSERT(v2[0]->getEndNode()==e1->getEndNode());
850   CPPUNIT_ASSERT_DOUBLES_EQUAL(2*M_PI/3.,v1[0]->getCurveLength(),1.e-12);
851   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v2[1]->getCurveLength(),1.e-12);
852   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[0]->getCurveLength(),1.e-12);
853   e2->decrRef(); e1->decrRef();
854   v1.clear(); v2.clear(); v3.clear();
855   //Test 15 - END - INSIDE | same dir.
856   e1=buildArcOfCircle(center,radius,-M_PI,2.*M_PI); e2=buildArcOfCircle(center,radius,0.,-4.*M_PI/3);
857   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(4.*M_PI/3.,e2->getCurveLength(),1e-12);
858   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
859   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
860   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
861   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
862   CPPUNIT_ASSERT(v1[0]->intresicEqual(v2[1]));
863   CPPUNIT_ASSERT(v2[0]->getEndNode()==e1->getStartNode());
864   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
865   CPPUNIT_ASSERT(v1[1]->getEndNode()==e1->getEndNode());
866   CPPUNIT_ASSERT(v2[0]->getStartNode()==e1->getEndNode());
867   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v1[0]->getCurveLength(),1.e-12);
868   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[0]->getCurveLength(),1.e-12);
869   CPPUNIT_ASSERT_DOUBLES_EQUAL(2.*M_PI/3.,v1[1]->getCurveLength(),1.e-12);
870   e2->decrRef(); e1->decrRef();
871   v1.clear(); v2.clear(); v3.clear();
872   //Test 15 - END - INSIDE | opp dir.
873   e1=buildArcOfCircle(center,radius,-M_PI,2.*M_PI); e2=buildArcOfCircle(center,radius,-4.*M_PI/3,0.);
874   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,e1->getCurveLength(),1e-12); CPPUNIT_ASSERT_DOUBLES_EQUAL(4.*M_PI/3.,e2->getCurveLength(),1e-12);
875   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
876   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
877   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
878   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
879   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(v2[0]->getPtr()) && !v2[0]->getDirection() && v1[0]->getDirection());
880   CPPUNIT_ASSERT(v2[0]->getEndNode()==e1->getStartNode());
881   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode());
882   CPPUNIT_ASSERT(v1[1]->getEndNode()==e1->getEndNode());
883   CPPUNIT_ASSERT(v2[1]->getEndNode()==e1->getEndNode());
884   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI/3.,v1[0]->getCurveLength(),1.e-12);
885   CPPUNIT_ASSERT_DOUBLES_EQUAL(M_PI,v2[1]->getCurveLength(),1.e-12);
886   CPPUNIT_ASSERT_DOUBLES_EQUAL(2.*M_PI/3.,v1[1]->getCurveLength(),1.e-12);
887   e2->decrRef(); e1->decrRef();
888   v1.clear(); v2.clear(); v3.clear();
889   //
890   ComposedEdge::Delete(&v1);
891   ComposedEdge::Delete(&v2);
892 }
893
894 /*!
895  * Here there is test of cases where between 2 edges intersects only in points not on edge.
896  */
897 void QuadraticPlanarInterpTest::IntersectionPointOnlyUnitarySegSeg()
898 {
899   // 0° - classical
900   EdgeLin *e1=new EdgeLin(0.,0.,1.,0.);
901   EdgeLin *e2=new EdgeLin(0.3,0.3,0.5,-0.3);
902   ComposedEdge& v1=*(new ComposedEdge);
903   ComposedEdge& v2=*(new ComposedEdge); MergePoints v3;
904   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
905   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
906   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
907   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
908   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
909   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
910   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
911   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.4,(*v1[0]->getEndNode())[0],ADMISSIBLE_ERROR);
912   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.,(*v1[0]->getEndNode())[1],ADMISSIBLE_ERROR);
913   e2->decrRef(); e1->decrRef();
914   v1.clear(); v2.clear(); v3.clear();
915   // 90° - classical
916   e1=new EdgeLin(0.,0.,0.,1.);
917   e2=new EdgeLin(-0.3,0.3,0.3,0.5);
918   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
919   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
920   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
921   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
922   CPPUNIT_ASSERT(v1[0]->getEndNode()==v1[1]->getStartNode()); CPPUNIT_ASSERT(v2[0]->getEndNode()==v2[1]->getStartNode());
923   CPPUNIT_ASSERT(e1->getStartNode()==v1.front()->getStartNode() && e1->getEndNode()==v1.back()->getEndNode());
924   CPPUNIT_ASSERT(e2->getStartNode()==v2.front()->getStartNode() && e2->getEndNode()==v2.back()->getEndNode());
925   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.,(*v1[0]->getEndNode())[0],ADMISSIBLE_ERROR);
926   CPPUNIT_ASSERT_DOUBLES_EQUAL(0.4,(*v1[0]->getEndNode())[1],ADMISSIBLE_ERROR);
927   e2->decrRef(); e1->decrRef();
928   v1.clear(); v2.clear(); v3.clear();
929   //Test 1 - 0°
930   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(0.,0.,0.,1.);
931   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
932   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
933   CPPUNIT_ASSERT(v3.isStart1(0)); CPPUNIT_ASSERT(v3.isStart2(0));
934   e2->decrRef(); e1->decrRef();
935   v1.clear(); v2.clear(); v3.clear();
936   //Test 1 - 90°
937   e1=new EdgeLin(0.,0.,0.,1.); e2=new EdgeLin(0.,0.,1.,0.);
938   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
939   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
940   CPPUNIT_ASSERT(v3.isStart1(0)); CPPUNIT_ASSERT(v3.isStart2(0));
941   e2->decrRef(); e1->decrRef();
942   v1.clear(); v2.clear(); v3.clear();
943   //Test 1 - 45°
944   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(0.,0.,1.,-1.);
945   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
946   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
947   CPPUNIT_ASSERT(v3.isStart1(0)); CPPUNIT_ASSERT(v3.isStart2(0));
948   e2->decrRef(); e1->decrRef();
949   v1.clear(); v2.clear(); v3.clear();
950   //Test 2
951   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(1.,1.,1.,0.);
952   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
953   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
954   CPPUNIT_ASSERT(v3.isEnd1(0)); CPPUNIT_ASSERT(v3.isEnd2(0));
955   e2->decrRef(); e1->decrRef();
956   v1.clear(); v2.clear(); v3.clear();
957   //Test 3
958   e1=new EdgeLin(0.,0.,1.,0.); e2=new EdgeLin(1.,0.,1.,1.);
959   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
960   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
961   CPPUNIT_ASSERT(v3.isEnd1(0)); CPPUNIT_ASSERT(v3.isStart2(0));
962   e2->decrRef(); e1->decrRef();
963   v1.clear(); v2.clear(); v3.clear();
964   //Test 4
965   e1=new EdgeLin(0.,0.,1.,1.); e2=new EdgeLin(1.,-1.,0.,0.);
966   CPPUNIT_ASSERT(!e1->intersectWith(e2,v3,v1,v2));
967   CPPUNIT_ASSERT_EQUAL(1,(int)v3.getNumberOfAssociations());
968   CPPUNIT_ASSERT(v3.isStart1(0)); CPPUNIT_ASSERT(v3.isEnd2(0));
969   e2->decrRef(); e1->decrRef();
970   v1.clear(); v2.clear(); v3.clear();
971   //Intersection extremity of one edge and inside of other edge. 2 End.
972   e1=new EdgeLin(0.,0.,1.,0.);
973   e2=new EdgeLin(0.5,1.,0.5,0.);
974   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
975   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
976   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
977   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
978   CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection());
979   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode() && v1[0]->getEndNode()==e2->getEndNode() && v1[1]->getStartNode()==e2->getEndNode() && v1[1]->getEndNode()==e1->getEndNode());
980   CPPUNIT_ASSERT(v1[0]->getDirection() && v1[1]->getDirection());
981   e2->decrRef(); e1->decrRef();
982   v1.clear(); v2.clear(); v3.clear();
983   //Intersection extremity of one edge and inside of other edge. 2 Start.
984   e1=new EdgeLin(0.,0.,1.,0.);
985   e2=new EdgeLin(0.5,0.,0.5,1.);
986   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
987   CPPUNIT_ASSERT_EQUAL(2,(int)v1.size());
988   CPPUNIT_ASSERT_EQUAL(1,(int)v2.size());
989   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
990   CPPUNIT_ASSERT(v2[0]->intresincEqCoarse(e2) && v2[0]->getDirection());
991   CPPUNIT_ASSERT(v1[0]->getStartNode()==e1->getStartNode() && v1[0]->getEndNode()==e2->getStartNode() && v1[1]->getStartNode()==e2->getStartNode() && v1[1]->getEndNode()==e1->getEndNode());
992   CPPUNIT_ASSERT(v1[0]->getDirection() && v1[1]->getDirection());
993   e2->decrRef(); e1->decrRef();
994   v1.clear(); v2.clear(); v3.clear();
995   //Intersection extremity of one edge and inside of other edge. 1 Start.
996   e1=new EdgeLin(0.5,0.,0.5,1.);
997   e2=new EdgeLin(0.,0.,1.,0.);
998   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
999   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
1000   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
1001   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
1002   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection());
1003   CPPUNIT_ASSERT(v2[0]->getStartNode()==e2->getStartNode() && v2[0]->getEndNode()==e1->getStartNode() && v2[1]->getStartNode()==e1->getStartNode() && v2[1]->getEndNode()==e2->getEndNode());
1004   CPPUNIT_ASSERT(v2[0]->getDirection() && v2[1]->getDirection());
1005   e2->decrRef(); e1->decrRef();
1006   v1.clear(); v2.clear(); v3.clear();
1007   //Intersection extremity of one edge and inside of other edge. 1 End.
1008   e1=new EdgeLin(0.5,1.,0.5,0.);
1009   e2=new EdgeLin(0.,0.,1.,0.);
1010   CPPUNIT_ASSERT(e1->intersectWith(e2,v3,v1,v2));
1011   CPPUNIT_ASSERT_EQUAL(1,(int)v1.size());
1012   CPPUNIT_ASSERT_EQUAL(2,(int)v2.size());
1013   CPPUNIT_ASSERT_EQUAL(0,(int)v3.getNumberOfAssociations());
1014   CPPUNIT_ASSERT(v1[0]->intresincEqCoarse(e1) && v1[0]->getDirection());
1015   CPPUNIT_ASSERT(v2[0]->getStartNode()==e2->getStartNode() && v2[0]->getEndNode()==e1->getEndNode() && v2[1]->getStartNode()==e1->getEndNode() && v2[1]->getEndNode()==e2->getEndNode());
1016   CPPUNIT_ASSERT(v2[0]->getDirection() && v2[1]->getDirection());
1017   e2->decrRef(); e1->decrRef();
1018   v1.clear(); v2.clear(); v3.clear();
1019   ComposedEdge::Delete(&v2);
1020   ComposedEdge::Delete(&v1);
1021 }
1022
1023 }