Model2D.cpp 45 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261
  1. #include "Model2D.h"
  2. #include "Textur2D.h"
  3. #include "FrameworkMath.h"
  4. #include "Mat3.h"
  5. #include "MausEreignis.h"
  6. #include "Bild.h"
  7. using namespace Framework;
  8. // Inhalt der Model2DData Klasse aus Model2D.h
  9. // Konstruktor
  10. Model2DData::Model2DData()
  11. : polygons( 0 ),
  12. vListen( 0 ),
  13. minP( 0, 0 ),
  14. maxP( 0, 0 )
  15. {
  16. ref = 1;
  17. }
  18. // Destruktor
  19. Model2DData::~Model2DData()
  20. {
  21. if( polygons )
  22. {
  23. int anz = polygons->getEintragAnzahl();
  24. for( int i = 0; i < anz; i++ )
  25. {
  26. if( polygons->get( i ).name )
  27. polygons->get( i ).name->release();
  28. if( polygons->get( i ).tKordinaten )
  29. polygons->get( i ).tKordinaten->release();
  30. if( polygons->get( i ).vertex )
  31. polygons->get( i ).vertex->release();
  32. if( polygons->get( i ).schwerpunkt )
  33. delete polygons->get( i ).schwerpunkt;
  34. }
  35. polygons = polygons->release();
  36. }
  37. if( vListen )
  38. vListen->release();
  39. }
  40. // privat
  41. bool Model2DData::istPunktInnen( Vertex p, int polygonId ) const
  42. {
  43. if( p < minP || p > maxP || !polygons )
  44. return 0;
  45. int num = 0;
  46. for( auto *polygon = &polygons->getArray(); polygon && polygon->set; polygon = polygon->next, num++ )
  47. {
  48. if( polygonId >= 0 && num != polygonId )
  49. continue;
  50. int anz = polygon->var.vertex->getEintragAnzahl();
  51. int ola = outList.z( num )->getEintragAnzahl();
  52. bool c = 0;
  53. int j = anz - 1;
  54. for( int k = 0; k < ola; k++ )
  55. {
  56. Punkt out = outList.z( num )->get( k );
  57. if( out.x < out.y && j > out.x && j < out.y )
  58. j = out.x;
  59. if( out.x > out.y && ( j > out.x || j < out.y ) )
  60. j = out.x;
  61. }
  62. for( int i = 0; i < anz; i++ )
  63. {
  64. bool cont = 0;
  65. for( int k = 0; k < ola; k++ )
  66. {
  67. Punkt out = outList.z( num )->get( k );
  68. if( out.x < out.y && i > out.x && i < out.y )
  69. cont = 1;
  70. if( out.x > out.y && ( i > out.x || i < out.y ) )
  71. cont = 1;
  72. }
  73. if( cont )
  74. continue;
  75. Vertex a = polygon->var.vertex->get( i );
  76. Vertex b = polygon->var.vertex->get( j );
  77. if( ( ( a.y >= p.y ) != ( b.y >= p.y ) ) && ( p.x <= ( b.x - a.x ) * ( p.y - a.y ) / (float)( b.y - a.y ) + a.x ) )
  78. c = !c;
  79. j = i;
  80. }
  81. if( c )
  82. return 1;
  83. }
  84. return 0;
  85. }
  86. bool Model2DData::istLinieInnen( Vertex a, Vertex b, int polygonId ) const
  87. {
  88. if( !polygons )
  89. return 0;
  90. int pAnz = polygons->getEintragAnzahl();
  91. for( int p = 0; p < pAnz; p++ )
  92. {
  93. if( polygonId >= 0 && p != polygonId )
  94. continue;
  95. int ola = outList.z( p )->getEintragAnzahl();
  96. int anz = polygons->get( p ).vertex->getEintragAnzahl();
  97. int j = anz - 1;
  98. for( int k = 0; k < ola; k++ )
  99. {
  100. Punkt out = outList.z( p )->get( k );
  101. if( out.x < out.y && j > out.x && j < out.y )
  102. j = out.x;
  103. if( out.x > out.y && ( j > out.x || j < out.y ) )
  104. j = out.x;
  105. }
  106. for( int i = 0; i < anz; i++ )
  107. {
  108. bool cont = 0;
  109. for( int k = 0; k < ola; k++ )
  110. {
  111. Punkt out = outList.z( p )->get( k );
  112. if( out.x < out.y && i > out.x && i < out.y )
  113. cont = 1;
  114. if( out.x > out.y && ( i > out.x || i < out.y ) )
  115. cont = 1;
  116. }
  117. if( cont )
  118. continue;
  119. Punkt va = polygons->get( p ).vertex->get( i );
  120. Punkt vb = polygons->get( p ).vertex->get( j );
  121. if( (Punkt)a == va && (Punkt)b == vb )
  122. return 1;
  123. if( (Punkt)a == vb && (Punkt)b == va )
  124. return 1;
  125. j = i;
  126. }
  127. Vertex len = b - a;
  128. Vertex speed( len.x > 0 ? 1 : -1.f, len.y > 0 ? 1 : -1.f );
  129. int mLen = 0;
  130. if( fabs( len.x ) > fabs( len.y ) )
  131. {
  132. mLen = (int)fabs( len.x );
  133. speed.y = len.y / (float)fabs( len.x );
  134. }
  135. else
  136. {
  137. mLen = (int)fabs( len.y );
  138. speed.x = len.x / (float)fabs( len.y );
  139. }
  140. int i = 1;
  141. bool inside = 1;
  142. for( Vertex vp = speed + a; (Punkt)vp != (Punkt)( b - speed ) && inside && i < mLen - 1; vp += speed, i++ )
  143. inside &= istPunktInnen( vp, p );
  144. if( inside )
  145. return 1;
  146. }
  147. return 0;
  148. }
  149. // nicht constant
  150. bool Model2DData::erstelleModell( Array< Polygon2D > *polygons )
  151. {
  152. removeModell();
  153. if( !polygons || !polygons->getEintragAnzahl() )
  154. {
  155. this->polygons = polygons;
  156. vListen = new RCArray< RCArray< DreieckListe< Vertex > > >();
  157. return 1;
  158. }
  159. this->polygons = polygons;
  160. int pAnz = polygons->getEintragAnzahl();
  161. vListen = new RCArray< RCArray< DreieckListe< Vertex > > >();
  162. for( int p = 0; p < pAnz; p++ )
  163. {
  164. Polygon2D pg = polygons->get( p );
  165. if( !pg.vertex || pg.vertex->getEintragAnzahl() < 3 )
  166. continue;
  167. vListen->add( new RCArray< DreieckListe< Vertex > >() );
  168. outList.set( new Array< Punkt >, p );
  169. int vAnz = pg.vertex->getEintragAnzahl();
  170. bool textur = pg.tKordinaten != 0;
  171. for( int i = 0; i < vAnz && textur; i++ )
  172. textur &= pg.tKordinaten->hat( i );
  173. for( int i = 0; i < vAnz; i++ )
  174. {
  175. if( maxP.x < fabs( pg.vertex->get( i ).x ) )
  176. {
  177. maxP.x = abs( (int)pg.vertex->get( i ).x ) + 1;
  178. maxP.y = abs( (int)pg.vertex->get( i ).x ) + 1;
  179. }
  180. if( maxP.y < fabs( pg.vertex->get( i ).y ) )
  181. {
  182. maxP.x = abs( (int)pg.vertex->get( i ).y ) + 1;
  183. maxP.y = abs( (int)pg.vertex->get( i ).y ) + 1;
  184. }
  185. }
  186. minP = -maxP;
  187. if( !textur )
  188. {
  189. if( pg.tKordinaten )
  190. pg.tKordinaten->leeren();
  191. }
  192. RCArray< RCArray< DreieckListe< Vertex > > > lists;
  193. int lauf = 0;
  194. while( 1 )
  195. {
  196. lists.set( new RCArray< DreieckListe< Vertex > >(), lauf );
  197. outList.z( p )->set( Punkt( 0, 0 ), lauf );
  198. bool fertig = 0;
  199. Vertex a;
  200. Vertex b;
  201. Array< Punkt > tmpOutList;
  202. for( int i = 0; i < vAnz; i++ )
  203. {
  204. bool cont = 0;
  205. int vorher = i - 1;
  206. int nachher = i + 1;
  207. if( nachher >= vAnz )
  208. nachher = 0;
  209. if( vorher < 0 )
  210. vorher = vAnz - 1;
  211. int ola = outList.z( p )->getEintragAnzahl();
  212. for( int j = 0; j < ola; j++ )
  213. {
  214. Punkt out = outList.z( p )->get( j );
  215. if( out.x < out.y )
  216. {
  217. if( nachher > out.x && nachher < out.y )
  218. nachher = out.y;
  219. if( vorher > out.x && vorher < out.y )
  220. vorher = out.x;
  221. }
  222. if( out.x > out.y )
  223. {
  224. if( nachher > out.x || nachher < out.y )
  225. nachher = out.y;
  226. if( vorher > out.x || vorher < out.y )
  227. vorher = out.x;
  228. }
  229. if( out.x < out.y && i > out.x && i < out.y )
  230. cont = 1;
  231. if( out.x > out.y && ( i > out.x || i < out.y ) )
  232. cont = 1;
  233. }
  234. if( cont )
  235. continue;
  236. if( vorher < 0 )
  237. a = pg.vertex->get( vAnz + vorher );
  238. else
  239. a = pg.vertex->get( vorher );
  240. if( nachher > vAnz - 1 )
  241. b = pg.vertex->get( nachher - vAnz + 1 );
  242. else
  243. b = pg.vertex->get( nachher );
  244. if( istLinieInnen( a, b, p ) )
  245. {
  246. DreieckListe< Vertex > *lowL = new DreieckListe< Vertex >();
  247. DreieckListe< Vertex > *heightL = new DreieckListe< Vertex >();
  248. lowL->addPunkt( new Vertex( pg.vertex->get( i ) ), textur ? new Vertex( pg.tKordinaten->get( i ) ) : 0 );
  249. heightL->addPunkt( new Vertex( pg.vertex->get( i ) ), textur ? new Vertex( pg.tKordinaten->get( i ) ) : 0 );
  250. int height = i + 1;
  251. int low = i - 1;
  252. Punkt outL( 0, 0 );
  253. Punkt outH( 0, 0 );
  254. for( int k = 0; k < 2; k++ )
  255. {
  256. bool lowp = !k;
  257. while( 1 )
  258. {
  259. if( height >= vAnz )
  260. height = 0;
  261. if( low < 0 )
  262. low = vAnz - 1;
  263. for( int j = 0; j <= lauf; j++ )
  264. {
  265. Punkt out = outList.z( p )->get( j );
  266. if( out.x < out.y )
  267. {
  268. if( height > out.x && height < out.y )
  269. height = out.y;
  270. if( low > out.x && low < out.y )
  271. low = out.x;
  272. }
  273. if( out.x > out.y )
  274. {
  275. if( height > out.x || height < out.y )
  276. height = out.y;
  277. if( low > out.x || low < out.y )
  278. low = out.x;
  279. }
  280. }
  281. Vertex a = pg.vertex->get( height );
  282. Vertex b = pg.vertex->get( low );
  283. if( low == height )
  284. {
  285. fertig = 1;
  286. outList.z( p )->set( Punkt( 0, 0 ), lauf );
  287. if( !k )
  288. lowL->addPunkt( new Vertex( b ), textur ? new Vertex( pg.tKordinaten->get( low ) ) : 0 );
  289. else
  290. heightL->addPunkt( new Vertex( b ), textur ? new Vertex( pg.tKordinaten->get( low ) ) : 0 );
  291. break;
  292. }
  293. bool inside = istLinieInnen( a, b, p );
  294. if( inside )
  295. {
  296. if( !k )
  297. outL = Punkt( low, height );
  298. else
  299. outH = Punkt( low, height );
  300. outList.z( p )->set( Punkt( low, height ), lauf );
  301. }
  302. if( lowp )
  303. {
  304. if( !k )
  305. lowL->addPunkt( new Vertex( b ), textur ? new Vertex( pg.tKordinaten->get( low ) ) : 0 );
  306. else
  307. heightL->addPunkt( new Vertex( b ), textur ? new Vertex( pg.tKordinaten->get( low ) ) : 0 );
  308. low--;
  309. }
  310. else
  311. {
  312. if( !k )
  313. lowL->addPunkt( new Vertex( a ), textur ? new Vertex( pg.tKordinaten->get( height ) ) : 0 );
  314. else
  315. heightL->addPunkt( new Vertex( a ), textur ? new Vertex( pg.tKordinaten->get( height ) ) : 0 );
  316. height++;
  317. }
  318. lowp = !lowp;
  319. if( !inside )
  320. {
  321. height = i + 1;
  322. low = i - 1;
  323. outList.z( p )->set( Punkt( 0, 0 ), lauf );
  324. break;
  325. }
  326. }
  327. if( fertig )
  328. break;
  329. }
  330. if( lowL->getDreieckAnzahl() > heightL->getDreieckAnzahl() )
  331. {
  332. lists.z( lauf )->set( lowL, i );
  333. tmpOutList.set( outL, i );
  334. heightL->release();
  335. }
  336. else
  337. {
  338. lists.z( lauf )->set( heightL, i );
  339. tmpOutList.set( outH, i );
  340. lowL->release();
  341. }
  342. }
  343. else
  344. lists.z( lauf )->set( new DreieckListe< Vertex >(), i );
  345. if( fertig )
  346. break;
  347. }
  348. int maxP = -1;
  349. int max = 0;
  350. for( int i = 0; i < vAnz; i++ )
  351. {
  352. if( lists.z( lauf )->z( i ) && lists.z( lauf )->z( i )->getDreieckAnzahl() > max )
  353. {
  354. max = lists.z( lauf )->z( i )->getDreieckAnzahl();
  355. maxP = i;
  356. }
  357. }
  358. if( !max || maxP < 0 )
  359. break;
  360. vListen->z( p )->add( lists.z( lauf )->get( maxP ) );
  361. outList.z( p )->set( tmpOutList.get( maxP ), lauf );
  362. if( fertig )
  363. break;
  364. lauf++;
  365. }
  366. outList.z( p )->leeren();
  367. }
  368. return 1;
  369. }
  370. void Model2DData::removeModell() // setzt die Vertex daten zurück
  371. {
  372. if( polygons )
  373. {
  374. int anz = polygons->getEintragAnzahl();
  375. for( int i = 0; i < anz; i++ )
  376. {
  377. if( polygons->get( i ).name )
  378. polygons->get( i ).name->release();
  379. if( polygons->get( i ).tKordinaten )
  380. polygons->get( i ).tKordinaten->release();
  381. if( polygons->get( i ).vertex )
  382. polygons->get( i ).vertex->release();
  383. if( polygons->get( i ).schwerpunkt )
  384. delete polygons->get( i ).schwerpunkt;
  385. }
  386. polygons = polygons->release();
  387. }
  388. if( vListen )
  389. vListen = vListen->release();
  390. outList.leeren();
  391. minP = Punkt( 0, 0 );
  392. maxP = Punkt( 0, 0 );
  393. }
  394. bool Model2DData::calcHitPoint( Vertex pos, Vertex dir, const char *polygonName, Vertex &hitpoint, Vertex &moveSpeed, float &rotSpeed ) const
  395. {
  396. bool ret = 0;
  397. for( auto *polygon = &polygons->getArray(); polygon && polygon->set; polygon = polygon->next )
  398. {
  399. if( polygon->var.name->istGleich( polygonName ) )
  400. {
  401. int anz = polygon->var.vertex->getEintragAnzahl();
  402. for( int i = 0; i < anz; i++ )
  403. {
  404. Vertex a = polygon->var.vertex->get( i );
  405. Vertex b = polygon->var.vertex->get( ( i + 1 ) % anz );
  406. b -= a;
  407. float offset = 0;
  408. if( dir.y != 0 && dir.x != 0 )
  409. offset = ( ( a.y - pos.y ) / dir.y - ( a.x - pos.x ) / dir.x ) / ( b.x / dir.x - b.y / dir.y ); // solve hitpoint equasion
  410. else if( dir.y == 0 )
  411. offset = ( pos.y - a.y ) / b.y;
  412. else if( dir.x == 0 )
  413. offset = ( pos.x - a.x ) / b.x;
  414. Vertex point = a + ( b * offset );
  415. if( offset >= 0 && offset <= 1 )
  416. {
  417. float f = ( point.x - pos.x ) / dir.x;
  418. if( !dir.x )
  419. f = ( point.y - pos.y ) / dir.y;
  420. if( !ret || ( hitpoint - pos ).getLengthSq() > ( point - pos ).getLengthSq() && f > 0 )
  421. {
  422. Vertex normal = b.CW90().normalize();
  423. Vertex kNorm = Vertex( dir ).normalize();
  424. moveSpeed = normal * ( normal * kNorm ) * dir.getLengthSq();
  425. normal = ( point - *polygon->var.schwerpunkt ).CW90().normalize();
  426. Vertex rotKraft = normal * ( normal * kNorm ) * dir.getLength();
  427. rotSpeed = ( ( rotKraft.getLength() * ( point - *polygon->var.schwerpunkt ).getLength() ) / 180.f ) * 3.14f * ( normal * kNorm );
  428. hitpoint = point;
  429. }
  430. ret = 1;
  431. }
  432. }
  433. }
  434. }
  435. return ret;
  436. }
  437. bool Model2DData::split( Vertex pos, Vertex dir, char *polygonName, Polygon2D &partA, Polygon2D &partB, Punkt &posA, Punkt &posB, std::function< double() > random ) const
  438. {
  439. Vertex originalDir = dir;
  440. bool ret = 0;
  441. int num = 0;
  442. for( auto *polygon = &polygons->getArray(); polygon && polygon->set; polygon = polygon->next, num++ )
  443. {
  444. if( polygon->var.name->istGleich( polygonName ) )
  445. {
  446. while( istPunktInnen( pos, num ) )
  447. {
  448. pos -= dir;
  449. }
  450. int anz = polygon->var.vertex->getEintragAnzahl();
  451. Vertex startPoint;
  452. Vertex texturSP;
  453. int leftI = 0;
  454. int rightI = 0;
  455. Vertex txtChpPix( 0, 0 );
  456. for( int i = 0; i < anz; i++ )
  457. {
  458. Vertex a = polygon->var.vertex->get( i );
  459. Vertex b = polygon->var.vertex->get( ( i + 1 ) % anz );
  460. b -= a;
  461. if( ( txtChpPix.x == 0 || txtChpPix.y == 0 ) && b.x != 0 && b.y != 0 )
  462. {
  463. Vertex ta = polygon->var.tKordinaten->get( i );
  464. Vertex tb = polygon->var.tKordinaten->get( ( i + 1 ) % anz );
  465. tb -= ta;
  466. txtChpPix = Vertex( tb.x / b.x, tb.y / b.y );
  467. }
  468. float offset = 0;
  469. if( dir.y != 0 && dir.x != 0 )
  470. offset = ( ( a.y - pos.y ) / dir.y - ( a.x - pos.x ) / dir.x ) / ( b.x / dir.x - b.y / dir.y ); // solve hitpoint equasion
  471. else if( dir.y == 0 )
  472. offset = ( pos.y - a.y ) / b.y;
  473. else if( dir.x == 0 )
  474. offset = ( pos.x - a.x ) / b.x;
  475. Vertex point = a + ( b * offset );
  476. if( offset >= 0 && offset <= 1 )
  477. {
  478. if( !ret || ( startPoint - pos ).getLengthSq() > ( point - pos ).getLengthSq() )
  479. {
  480. leftI = i;
  481. rightI = ( i + 1 ) % anz;
  482. startPoint = point;
  483. texturSP = polygon->var.tKordinaten->get( i ) + ( polygon->var.tKordinaten->get( ( i + 1 ) % anz ) - polygon->var.tKordinaten->get( i ) ) * offset;
  484. }
  485. ret = 1;
  486. }
  487. }
  488. if( ret )
  489. {
  490. partA.transparent = polygon->var.transparent;
  491. partA.schwerpunkt = new Vertex( 0, 0 );
  492. partA.tKordinaten = new Array< Vertex >();
  493. partA.name = new Text( polygon->var.name->getText() );
  494. partA.vertex = new Array< Vertex >();
  495. partB.transparent = polygon->var.transparent;
  496. partB.schwerpunkt = new Vertex( 0, 0 );
  497. partB.tKordinaten = new Array< Vertex >();
  498. partB.name = new Text( polygon->var.name->getText() );
  499. partB.vertex = new Array< Vertex >();
  500. *partA.schwerpunkt += startPoint;
  501. *partB.schwerpunkt += startPoint;
  502. partA.vertex->add( startPoint );
  503. partB.vertex->add( startPoint );
  504. partA.tKordinaten->add( texturSP );
  505. partB.tKordinaten->add( texturSP );
  506. int leftIE = 0;
  507. int rightIE = 0;
  508. while( 1 )
  509. {
  510. pos = startPoint;
  511. Vertex next = startPoint + dir;
  512. Vertex nextT = texturSP + Vertex( dir.x * txtChpPix.x, dir.y * txtChpPix.y );
  513. ret = 0;
  514. bool needOne = !istPunktInnen( next );
  515. int bestI = -1;
  516. float bo1 = 1000;
  517. float bo2 = 1000;
  518. for( int i = 0; i < anz; i++ )
  519. {
  520. if( i == leftI )
  521. continue;
  522. Vertex a = polygon->var.vertex->get( i );
  523. Vertex b = polygon->var.vertex->get( ( i + 1 ) % anz );
  524. b -= a;
  525. float offset1 = 0;
  526. if( dir.y != 0 && dir.x != 0 )
  527. offset1 = ( ( a.y - pos.y ) / dir.y - ( a.x - pos.x ) / dir.x ) / ( b.x / dir.x - b.y / dir.y ); // solve hitpoint equasion
  528. else if( dir.y == 0 )
  529. offset1 = ( pos.y - a.y ) / b.y;
  530. else if( dir.x == 0 )
  531. offset1 = ( pos.x - a.x ) / b.x;
  532. Vertex point = a + ( b * offset1 );
  533. float offset2 = 0;
  534. if( dir.x != 0 )
  535. offset2 = ( point.x - pos.x ) / dir.x;
  536. else
  537. offset2 = ( point.y - pos.y ) / dir.y;
  538. if( needOne && MIN( abs( bo1 ), abs( bo1 - 1 ) ) + MIN( abs( bo2 ), bo2 - 1 ) > MIN( abs( offset1 ), abs( offset1 - 1 ) ) + MIN( abs( offset2 ), abs( offset2 - 1 ) ) )
  539. {
  540. bo1 = offset1;
  541. bo2 = offset2;
  542. bestI = i;
  543. }
  544. if( offset1 >= 0 && offset1 <= 1 && offset2 >= 0 && offset2 <= 1 )
  545. {
  546. if( !ret || ( startPoint - pos ).getLengthSq() > ( point - pos ).getLengthSq() )
  547. {
  548. leftIE = i;
  549. rightIE = ( i + 1 ) % anz;
  550. startPoint = point;
  551. texturSP = polygon->var.tKordinaten->get( i ) + ( polygon->var.tKordinaten->get( ( i + 1 ) % anz ) - polygon->var.tKordinaten->get( i ) ) * offset1;
  552. }
  553. ret = 1;
  554. }
  555. }
  556. if( needOne && !ret )
  557. {
  558. Vertex a = polygon->var.vertex->get( bestI );
  559. Vertex b = polygon->var.vertex->get( ( bestI + 1 ) % anz );
  560. b -= a;
  561. leftIE = bestI;
  562. rightIE = ( bestI + 1 ) % anz;
  563. startPoint = a + ( b * bo1 );
  564. texturSP = polygon->var.tKordinaten->get( bestI ) + ( polygon->var.tKordinaten->get( ( bestI + 1 ) % anz ) - polygon->var.tKordinaten->get( bestI ) ) * bo1;
  565. ret = 1;
  566. }
  567. if( ret )
  568. break;
  569. *partA.schwerpunkt += next;
  570. *partB.schwerpunkt += next;
  571. partA.vertex->add( next );
  572. partB.vertex->add( next );
  573. partA.tKordinaten->add( nextT );
  574. partB.tKordinaten->add( nextT );
  575. startPoint = next;
  576. texturSP = nextT;
  577. dir = originalDir.rotation( (float)(random() - 0.5) );
  578. }
  579. *partA.schwerpunkt += startPoint;
  580. *partB.schwerpunkt += startPoint;
  581. partA.vertex->add( startPoint );
  582. partB.vertex->add( startPoint );
  583. partA.tKordinaten->add( texturSP );
  584. partB.tKordinaten->add( texturSP );
  585. for( int i = rightIE; i != leftI; i++ )
  586. {
  587. i = i % anz;
  588. if( i == leftI )
  589. break;
  590. *partA.schwerpunkt += polygon->var.vertex->get( i );
  591. partA.vertex->add( polygon->var.vertex->get( i ) );
  592. partA.tKordinaten->add( polygon->var.tKordinaten->get( i ) );
  593. }
  594. *partA.schwerpunkt += polygon->var.vertex->get( leftI );
  595. partA.vertex->add( polygon->var.vertex->get( leftI ) );
  596. partA.tKordinaten->add( polygon->var.tKordinaten->get( leftI ) );
  597. for( int i = leftIE; i != rightI; i-- )
  598. {
  599. if( i < 0 )
  600. i += anz;
  601. if( i == rightI )
  602. break;
  603. *partB.schwerpunkt += polygon->var.vertex->get( i );
  604. partB.vertex->add( polygon->var.vertex->get( i ) );
  605. partB.tKordinaten->add( polygon->var.tKordinaten->get( i ) );
  606. }
  607. *partB.schwerpunkt += polygon->var.vertex->get( rightI );
  608. partB.vertex->add( polygon->var.vertex->get( rightI ) );
  609. partB.tKordinaten->add( polygon->var.tKordinaten->get( rightI ) );
  610. *partA.schwerpunkt /= (float)partA.vertex->getEintragAnzahl();
  611. *partB.schwerpunkt /= (float)partB.vertex->getEintragAnzahl();
  612. posA = (Punkt)*partA.schwerpunkt;
  613. posB = (Punkt)*partB.schwerpunkt;
  614. for( int i = 0; i < partA.vertex->getEintragAnzahl(); i++ )
  615. partA.vertex->set( partA.vertex->get( i ) - *partA.schwerpunkt, i );
  616. for( int i = 0; i < partB.vertex->getEintragAnzahl(); i++ )
  617. partB.vertex->set( partB.vertex->get( i ) - *partB.schwerpunkt, i );
  618. *partA.schwerpunkt = Vertex( 0, 0 );
  619. *partB.schwerpunkt = Vertex( 0, 0 );
  620. }
  621. }
  622. }
  623. return ret;
  624. }
  625. // Reference Counting
  626. Model2DData *Model2DData::getThis()
  627. {
  628. ref++;
  629. return this;
  630. }
  631. Model2DData *Model2DData::release()
  632. {
  633. ref--;
  634. if( !ref )
  635. delete this;
  636. return 0;
  637. }
  638. // Inhalt der Model2D Klasse aus Model2D.h
  639. // Konstruktor
  640. Model2DObject::Model2DObject()
  641. : Object2D()
  642. {
  643. rData = 0;
  644. textur = new RCArray< Textur2D >;
  645. ref = 1;
  646. }
  647. // Destruktor
  648. Model2DObject::~Model2DObject()
  649. {
  650. if( rData )
  651. rData->release();
  652. textur->release();
  653. }
  654. // nicht constant
  655. void Model2DObject::setModel( Model2DData *mdl )
  656. {
  657. if( rData )
  658. rData->release();
  659. rData = mdl;
  660. }
  661. void Model2DObject::setTextur( Textur2D *t )
  662. {
  663. int index = 0;
  664. if( rData )
  665. {
  666. for( auto i = rData->polygons->getArray(); i.set; i++ )
  667. textur->set( t->getThis(), index++ );
  668. }
  669. t->release();
  670. }
  671. void Model2DObject::impuls( Vertex start, Vertex speed )
  672. {
  673. start = getObjectPos( start );
  674. speed = getObjectDir( speed );
  675. if( rData )
  676. {
  677. Vertex resSpeed;
  678. float resRotSpeed;
  679. Vertex hp;
  680. Vertex mSpeed;
  681. float rSpeed;
  682. float dist = INFINITY;
  683. for( auto p = rData->polygons->getArray(); p.set; p++ )
  684. {
  685. if( rData->calcHitPoint( start, speed, p.var.name->getText(), hp, mSpeed, rSpeed ) )
  686. {
  687. float f = ( hp.x - start.x ) / speed.x;
  688. if( !speed.x )
  689. f = ( hp.y - start.y ) / speed.y;
  690. if( ( hp - start ).getLengthSq() < dist && f > 0 )
  691. {
  692. resSpeed = mSpeed.rotation( rotation );
  693. resRotSpeed = rSpeed;
  694. dist = ( hp - start ).getLengthSq();
  695. }
  696. }
  697. }
  698. // TODO schleife über alle polygone und translation von start und speed in Object koordinaten
  699. if( dist < INFINITY )
  700. {
  701. this->speed += resSpeed;
  702. this->rSpeed += resRotSpeed;
  703. }
  704. }
  705. }
  706. void Model2DObject::setTextur( Textur2D *t, const char *polygonName )
  707. {
  708. int index = 0;
  709. for( auto i = rData->polygons->getArray(); i.set; i++, index++ )
  710. {
  711. if( i.var.name->istGleich( polygonName ) )
  712. textur->set( t->getThis(), index );
  713. }
  714. t->release();
  715. }
  716. void Model2DObject::render( Mat3< float > &kamMat, Bild &zRObj )
  717. {
  718. if( !rData || !rData->polygons || !textur )
  719. return;
  720. int num = 0;
  721. for( auto *p = &rData->vListen->getArray(); p && p->set; p = p->next, num++ )
  722. {
  723. Mat3< float > mat = kamMat * getObjectMatrix();
  724. if( textur->z( num ) )
  725. {
  726. Bild *txt = textur->z( num )->zTextur();
  727. for( auto *i = &p->var->getArray(); i && i->set; i = i->next )
  728. {
  729. for( auto *j = &i->var->zListe()->getArray(); j->next->next && j->next->next->set; j = j->next )
  730. {
  731. Vertex a = mat * *j->var->punkt;
  732. Vertex b = mat * *j->next->var->punkt;
  733. Vertex c = mat * *j->next->next->var->punkt;
  734. Punkt ta = (Punkt)Vertex( j->var->textur->x * (float)txt->getBreite(), j->var->textur->y * (float)txt->getHeight() );
  735. Punkt tb = (Punkt)Vertex( j->next->var->textur->x * (float)txt->getBreite(), j->next->var->textur->y * (float)txt->getHeight() );
  736. Punkt tc = (Punkt)Vertex( j->next->next->var->textur->x * (float)txt->getBreite(), j->next->next->var->textur->y * (float)txt->getHeight() );
  737. zRObj.drawDreieckTexturAlpha( a, b, c, ta, tb, tc, *txt );
  738. }
  739. }
  740. }
  741. }
  742. }
  743. // constant
  744. bool Model2DObject::istPunktInnen( Vertex p ) const
  745. {
  746. if( !rData )
  747. return 0;
  748. p -= position;
  749. if( p < Mat3< float >::scaling( size ) * rData->minP || p > Mat3< float >::scaling( size ) * rData->maxP || !rData->polygons )
  750. return 0;
  751. int num = 0;
  752. for( auto *polygon = &rData->polygons->getArray(); polygon && polygon->set; polygon = polygon->next, num++ )
  753. {
  754. if( polygon->var.transparent )
  755. continue;
  756. Mat3< float > mat = Mat3< float >::rotation( rotation ) * Mat3< float >::scaling( size );
  757. int anz = polygon->var.vertex->getEintragAnzahl();
  758. bool c = 0;
  759. int j = anz - 1;
  760. for( int i = 0; i < anz; i++ )
  761. {
  762. Vertex a = mat * polygon->var.vertex->get( i );
  763. Vertex b = mat * polygon->var.vertex->get( j );
  764. if( ( ( a.y >= p.y ) != ( b.y >= p.y ) ) && ( p.x <= ( b.x - a.x ) * ( p.y - a.y ) / (float)( b.y - a.y ) + a.x ) )
  765. c = !c;
  766. j = i;
  767. }
  768. if( c )
  769. return 1;
  770. }
  771. return 0;
  772. }
  773. bool Model2DObject::istLinieInnen( Vertex a, Vertex b ) const
  774. {
  775. if( !rData || !rData->polygons )
  776. return 0;
  777. int pAnz = rData->polygons->getEintragAnzahl();
  778. for( int p = 0; p < pAnz; p++ )
  779. {
  780. if( rData->polygons->get( p ).transparent )
  781. continue;
  782. Mat3< float > mat = Mat3< float >::rotation( rotation ) * Mat3< float >::scaling( size );
  783. int anz = rData->polygons->get( p ).vertex->getEintragAnzahl();
  784. int j = anz - 1;
  785. for( int i = 0; i < anz; i++ )
  786. {
  787. Punkt va = mat * rData->polygons->get( p ).vertex->get( i );
  788. Punkt vb = mat * rData->polygons->get( p ).vertex->get( j );
  789. if( (Punkt)a == position + va && (Punkt)b == position + vb )
  790. return 1;
  791. if( (Punkt)a == position + vb && (Punkt)b == position + va )
  792. return 1;
  793. j = i;
  794. }
  795. Vertex len = b - a;
  796. Vertex speed( len.x > 0 ? 1 : -1.f, len.y > 0 ? 1 : -1.f );
  797. int mLen = 0;
  798. if( fabs( len.x ) > fabs( len.y ) )
  799. {
  800. mLen = (int)fabs( len.x );
  801. speed.y = len.y / (float)fabs( len.x );
  802. }
  803. else
  804. {
  805. mLen = (int)fabs( len.y );
  806. speed.x = len.x / (float)fabs( len.y );
  807. }
  808. int i = 1;
  809. bool inside = 1;
  810. for( Vertex vp = speed + a; (Punkt)vp != (Punkt)( b - speed ) && inside && i < mLen - 1; vp += speed, i++ )
  811. inside &= istPunktInnen( vp );
  812. if( inside )
  813. return 1;
  814. }
  815. return 0;
  816. }
  817. bool Model2DObject::istModelInnen( const Model2DObject *zMdl, bool end ) const
  818. {
  819. if( !end )
  820. {
  821. Vertex min = (Vertex)rData->minP * size + position;
  822. Vertex max = (Vertex)rData->maxP * size + position;
  823. Vertex min2 = (Vertex)zMdl->zModel()->minP * zMdl->getSize() + zMdl->getPosition();
  824. Vertex max2 = (Vertex)zMdl->zModel()->maxP * zMdl->getSize() + zMdl->getPosition();
  825. if( max.x < min2.x || min.x > max2.x || max.y < min2.y || min.y > max2.y )
  826. return 0;
  827. }
  828. Mat3< float > mat = getObjectMatrix();
  829. for( auto *polygon = &rData->polygons->getArray(); polygon && polygon->set; polygon = polygon->next )
  830. {
  831. if( polygon->var.transparent )
  832. continue;
  833. int anz = polygon->var.vertex->getEintragAnzahl();
  834. for( int i = 0; i < anz; i++ )
  835. {
  836. if( zMdl->istPunktInnen( mat * polygon->var.vertex->get( i ) ) )
  837. return 1;
  838. }
  839. }
  840. if( end )
  841. return 0;
  842. return zMdl->istModelInnen( this, 1 );
  843. }
  844. Rect< float > Model2DObject::getBoundingBox() const
  845. {
  846. if( rData )
  847. return Rect< float >{ (Vertex)rData->minP * size + position, (Vertex)rData->maxP * size + position };
  848. return Rect< float >();
  849. }
  850. bool Model2DObject::calcHitPoint( Vertex pos, Vertex dir, Vertex &hitpoint ) const
  851. {
  852. pos = getObjectPos( pos );
  853. dir = getObjectDir( dir );
  854. Vertex ms;
  855. Vertex hp;
  856. float rs;
  857. float dist = INFINITY;
  858. if( rData )
  859. {
  860. for( auto p = rData->polygons->getArray(); p.set; p++ )
  861. {
  862. if( rData->calcHitPoint( pos, dir, p.var.name->getText(), hp, ms, rs ) )
  863. {
  864. float f = ( hp.x - pos.x ) / dir.x;
  865. if( !speed.x )
  866. f = ( hp.y - pos.y ) / dir.y;
  867. if( ( hp - pos ).getLengthSq() < dist && f > 0 )
  868. {
  869. hitpoint = getObjectMatrix() * hp;
  870. dist = ( hp - pos ).getLengthSq();
  871. }
  872. }
  873. }
  874. if( dist < INFINITY )
  875. return 1;
  876. }
  877. return 0;
  878. }
  879. Model2DData *Model2DObject::getModel() const
  880. {
  881. return rData ? rData->getThis() : 0;
  882. }
  883. Model2DData *Model2DObject::zModel() const
  884. {
  885. return rData;
  886. }
  887. // Inhalt der Model2D Klasse aus Model2D.h
  888. // Konstruktor
  889. Model2D::Model2D()
  890. : Zeichnung()
  891. {
  892. farbe = 0;
  893. style = 0;
  894. rData = 0;
  895. drehung = 0;
  896. size = 1;
  897. textur = new RCArray< Textur2D >;
  898. ref = 1;
  899. }
  900. // Destruktor
  901. Model2D::~Model2D()
  902. {
  903. if( rData )
  904. rData->release();
  905. textur->release();
  906. }
  907. // nicht constant
  908. void Model2D::setModel( Model2DData *mdl )
  909. {
  910. if( rData )
  911. rData->release();
  912. rData = mdl;
  913. }
  914. void Model2D::setDrehung( float drehung )
  915. {
  916. this->drehung = drehung;
  917. while( this->drehung > PI * 2 )
  918. this->drehung -= (float)PI * 2;
  919. while( this->drehung < 0 )
  920. this->drehung += (float)PI * 2;
  921. rend = 1;
  922. }
  923. void Model2D::addDrehung( float drehung )
  924. {
  925. this->drehung += drehung;
  926. while( this->drehung > PI * 2 )
  927. this->drehung -= (float)PI * 2;
  928. while( this->drehung < 0 )
  929. this->drehung += (float)PI * 2;
  930. rend = 1;
  931. }
  932. void Model2D::setSize( float size )
  933. {
  934. this->size = size;
  935. rend = 1;
  936. }
  937. void Model2D::addSize( float size )
  938. {
  939. this->size += size;
  940. rend = 1;
  941. }
  942. void Model2D::setTextur( Textur2D *t )
  943. {
  944. int index = 0;
  945. if( rData )
  946. {
  947. for( auto i = rData->polygons->getArray(); i.set; i++ )
  948. textur->set( t->getThis(), index++ );
  949. }
  950. t->release();
  951. }
  952. void Model2D::setTextur( Textur2D *t, const char *polygonName )
  953. {
  954. int index = 0;
  955. for( auto i = rData->polygons->getArray(); i.set; i++, index++ )
  956. {
  957. if( i.var.name->istGleich( polygonName ) )
  958. textur->set( t->getThis(), index );
  959. }
  960. t->release();
  961. }
  962. void Model2D::setFarbe( int f )
  963. {
  964. farbe = f;
  965. rend = 1;
  966. }
  967. void Model2D::doMausEreignis( MausEreignis &me )
  968. {
  969. if( !mak || me.verarbeitet || !istPunktInnen( Punkt( me.mx, me.my ) ) )
  970. return;
  971. me.mx -= pos.x;
  972. me.my -= pos.y;
  973. mak( makParam, this, me );
  974. me.mx += pos.x;
  975. me.my += pos.y;
  976. me.verarbeitet = 1;
  977. }
  978. bool Model2D::tick( double tickVal )
  979. {
  980. bool ret = rend;
  981. rend = 0;
  982. return ret;
  983. }
  984. void Model2D::render( Bild &zRObj )
  985. {
  986. if( !rData || hatStyleNicht( Model2D::Style::Sichtbar ) || !rData->polygons )
  987. return;
  988. Zeichnung::render( zRObj );
  989. int num = 0;
  990. for( auto *p = &rData->vListen->getArray(); p && p->set; p = p->next, num++ )
  991. {
  992. Mat3< float > mat = Mat3< float >::translation( pos ) * Mat3< float >::rotation( drehung ) * Mat3< float >::scaling( size );
  993. if( hatStyle( Model2D::Style::Textur ) )
  994. {
  995. if( !textur || !textur->z( num ) || !textur->z( num )->zTextur() || !rData->polygons->get( num ).tKordinaten )
  996. {
  997. for( auto *i = &p->var->getArray(); i && i->set; i = i->next )
  998. {
  999. for( auto *j = &i->var->zListe()->getArray(); j->next->next && j->next->next->set; j = j->next )
  1000. {
  1001. Vertex a = mat * *j->var->punkt;
  1002. Vertex b = mat * *j->next->var->punkt;
  1003. Vertex c = mat * *j->next->next->var->punkt;
  1004. if( hatStyle( Model2D::Style::Alpha ) )
  1005. zRObj.drawDreieckAlpha( a, b, c, farbe );
  1006. else
  1007. zRObj.drawDreieck( a, b, c, farbe );
  1008. }
  1009. }
  1010. }
  1011. else
  1012. {
  1013. Bild *txt = textur->z( num )->zTextur();
  1014. for( auto *i = &p->var->getArray(); i && i->set; i = i->next )
  1015. {
  1016. for( auto *j = &i->var->zListe()->getArray(); j->next->next && j->next->next->set; j = j->next )
  1017. {
  1018. Vertex a = mat * *j->var->punkt;
  1019. Vertex b = mat * *j->next->var->punkt;
  1020. Vertex c = mat * *j->next->next->var->punkt;
  1021. Punkt ta = (Punkt)Vertex( j->var->textur->x * (float)txt->getBreite(), j->var->textur->y * (float)txt->getHeight() );
  1022. Punkt tb = (Punkt)Vertex( j->next->var->textur->x * (float)txt->getBreite(), j->next->var->textur->y * (float)txt->getHeight() );
  1023. Punkt tc = (Punkt)Vertex( j->next->next->var->textur->x * (float)txt->getBreite(), j->next->next->var->textur->y * (float)txt->getHeight() );
  1024. if( hatStyle( Model2D::Style::Alpha ) )
  1025. zRObj.drawDreieckTexturAlpha( a, b, c, ta, tb, tc, *txt );
  1026. else
  1027. zRObj.drawDreieckTextur( a, b, c, ta, tb, tc, *txt );
  1028. }
  1029. }
  1030. }
  1031. }
  1032. if( hatStyle( Model2D::Style::Mesh ) )
  1033. {
  1034. for( auto *i = &p->var->getArray(); i && i->set; i = i->next )
  1035. {
  1036. for( auto *j = &i->var->zListe()->getArray(); j->next->next && j->next->next->set; j = j->next )
  1037. {
  1038. Vertex a = mat * *j->var->punkt;
  1039. Vertex b = mat * *j->next->var->punkt;
  1040. Vertex c = mat * *j->next->next->var->punkt;
  1041. if( hatStyle( Model2D::Style::Alpha ) )
  1042. {
  1043. zRObj.drawLinieAlpha( a, b, farbe );
  1044. zRObj.drawLinieAlpha( b, c, farbe );
  1045. zRObj.drawLinieAlpha( c, a, farbe );
  1046. }
  1047. else
  1048. {
  1049. zRObj.drawLinie( a, b, farbe );
  1050. zRObj.drawLinie( b, c, farbe );
  1051. zRObj.drawLinie( c, a, farbe );
  1052. }
  1053. }
  1054. }
  1055. }
  1056. if( hatStyle( Model2D::Style::Rahmen ) )
  1057. {
  1058. ArrayEintrag< Vertex > &beg = rData->polygons->get( num ).vertex->getArray();
  1059. if( beg.set )
  1060. {
  1061. ArrayEintrag< Vertex > *letzter = 0;
  1062. for( ArrayEintrag< Vertex > *e = &beg; e && e->next && e->set && e->next->set; e = e->next )
  1063. {
  1064. if( hatStyle( Model2D::Style::Alpha ) )
  1065. zRObj.drawLinieAlpha( mat * e->var, mat * e->next->var, farbe );
  1066. else
  1067. zRObj.drawLinie( mat * e->var, mat * e->next->var, farbe );
  1068. letzter = e->next;
  1069. }
  1070. if( letzter && letzter->set )
  1071. {
  1072. if( hatStyle( Model2D::Style::Alpha ) )
  1073. zRObj.drawLinieAlpha( mat * letzter->var, mat * beg.var, farbe );
  1074. else
  1075. zRObj.drawLinie( mat * letzter->var, mat * beg.var, farbe );
  1076. }
  1077. }
  1078. }
  1079. }
  1080. }
  1081. // constant
  1082. float Model2D::getDrehung() const
  1083. {
  1084. return drehung;
  1085. }
  1086. float Model2D::getSize() const
  1087. {
  1088. return size;
  1089. }
  1090. bool Model2D::istPunktInnen( Vertex p ) const
  1091. {
  1092. if( !rData )
  1093. return 0;
  1094. p -= pos;
  1095. if( p < Mat3< float >::scaling( size ) * rData->minP || p > Mat3< float >::scaling( size ) * rData->maxP || !rData->polygons )
  1096. return 0;
  1097. int num = 0;
  1098. for( auto *polygon = &rData->polygons->getArray(); polygon && polygon->set; polygon = polygon->next, num++ )
  1099. {
  1100. if( polygon->var.transparent )
  1101. continue;
  1102. Mat3< float > mat = Mat3< float >::rotation( drehung ) * Mat3< float >::scaling( size );
  1103. int anz = polygon->var.vertex->getEintragAnzahl();
  1104. bool c = 0;
  1105. int j = anz - 1;
  1106. for( int i = 0; i < anz; i++ )
  1107. {
  1108. Vertex a = mat * polygon->var.vertex->get( i );
  1109. Vertex b = mat * polygon->var.vertex->get( j );
  1110. if( ( ( a.y >= p.y ) != ( b.y >= p.y ) ) && ( p.x <= ( b.x - a.x ) * ( p.y - a.y ) / (float)( b.y - a.y ) + a.x ) )
  1111. c = !c;
  1112. j = i;
  1113. }
  1114. if( c )
  1115. return 1;
  1116. }
  1117. return 0;
  1118. }
  1119. bool Model2D::istLinieInnen( Vertex a, Vertex b ) const
  1120. {
  1121. if( !rData || !rData->polygons )
  1122. return 0;
  1123. int pAnz = rData->polygons->getEintragAnzahl();
  1124. for( int p = 0; p < pAnz; p++ )
  1125. {
  1126. if( rData->polygons->get( p ).transparent )
  1127. continue;
  1128. Mat3< float > mat = Mat3< float >::rotation( drehung ) * Mat3< float >::scaling( size );
  1129. int anz = rData->polygons->get( p ).vertex->getEintragAnzahl();
  1130. int j = anz - 1;
  1131. for( int i = 0; i < anz; i++ )
  1132. {
  1133. Punkt va = mat * rData->polygons->get( p ).vertex->get( i );
  1134. Punkt vb = mat * rData->polygons->get( p ).vertex->get( j );
  1135. if( (Punkt)a == pos + va && (Punkt)b == pos + vb )
  1136. return 1;
  1137. if( (Punkt)a == pos + vb && (Punkt)b == pos + va )
  1138. return 1;
  1139. j = i;
  1140. }
  1141. Vertex len = b - a;
  1142. Vertex speed( len.x > 0 ? 1 : -1.f, len.y > 0 ? 1 : -1.f );
  1143. int mLen = 0;
  1144. if( fabs( len.x ) > fabs( len.y ) )
  1145. {
  1146. mLen = (int)fabs( len.x );
  1147. speed.y = len.y / (float)fabs( len.x );
  1148. }
  1149. else
  1150. {
  1151. mLen = (int)fabs( len.y );
  1152. speed.x = len.x / (float)fabs( len.y );
  1153. }
  1154. int i = 1;
  1155. bool inside = 1;
  1156. for( Vertex vp = speed + a; (Punkt)vp != (Punkt)( b - speed ) && inside && i < mLen - 1; vp += speed, i++ )
  1157. inside &= istPunktInnen( vp );
  1158. if( inside )
  1159. return 1;
  1160. }
  1161. return 0;
  1162. }
  1163. bool Model2D::istModelInnen( const Model2D *zMdl, bool end ) const
  1164. {
  1165. if( !end )
  1166. {
  1167. Vertex min = (Vertex)rData->minP * size + pos;
  1168. Vertex max = (Vertex)rData->maxP * size + pos;
  1169. Vertex min2 = (Vertex)zMdl->zModel()->minP * zMdl->getSize() + zMdl->getPosition();
  1170. Vertex max2 = (Vertex)zMdl->zModel()->maxP * zMdl->getSize() + zMdl->getPosition();
  1171. if( max.x < min2.x || min.x > max2.x || max.y < min2.y || min.y > max2.y )
  1172. return 0;
  1173. }
  1174. Mat3< float > mat = Mat3< float >::translation( pos ) * Mat3< float >::rotation( drehung ) * Mat3< float >::scaling( size );
  1175. for( auto *polygon = &rData->polygons->getArray(); polygon && polygon->set; polygon = polygon->next )
  1176. {
  1177. if( polygon->var.transparent )
  1178. continue;
  1179. int anz = polygon->var.vertex->getEintragAnzahl();
  1180. for( int i = 0; i < anz; i++ )
  1181. {
  1182. if( zMdl->istPunktInnen( mat * polygon->var.vertex->get( i ) ) )
  1183. return 1;
  1184. }
  1185. }
  1186. if( end )
  1187. return 0;
  1188. return zMdl->istModelInnen( this, 1 );
  1189. }
  1190. Model2DData *Model2D::getModel() const
  1191. {
  1192. return rData ? rData->getThis() : 0;
  1193. }
  1194. Model2DData *Model2D::zModel() const
  1195. {
  1196. return rData;
  1197. }
  1198. // Reference Counting
  1199. Model2D *Model2D::getThis()
  1200. {
  1201. ++ref;
  1202. return this;
  1203. }
  1204. Model2D *Model2D::release()
  1205. {
  1206. --ref;
  1207. if( !ref )
  1208. delete this;
  1209. return 0;
  1210. }