FieldMgr.cpp 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981
  1. #include "stdafx.h"
  2. #include "otsdataconst.h"
  3. #include "FieldMgr.h"
  4. #include "../OTSLog/COTSUtilityDllFunExport.h"
  5. namespace OTSIMGPROC {
  6. namespace {
  7. // fill the matrics with the spiral sequence number ,n*n is the largest fill number.
  8. // the row and col number should be odd number.
  9. void getSpiralMatrics(std::vector <std::vector <int>>& arrays,int row,int col)
  10. {
  11. int n = max(col, row);
  12. arrays.resize(n, std::vector<int>(n));
  13. int c = 0, i, j;
  14. int z = n * n;
  15. int ou = z;
  16. while (ou >= 1)
  17. {
  18. i = 0;
  19. j = 0;
  20. for (i += c, j += c; j < n - c; j++)//从左到右
  21. {
  22. if (ou > z) break;
  23. arrays[i][j] = ou--;
  24. }
  25. for (j--, i++; i < n - c; i++) // 从上到下
  26. {
  27. if (ou > z) break;
  28. arrays[i][j] = ou--;
  29. }
  30. for (i--, j--; j >= c; j--)//从右到左
  31. {
  32. if (ou > z) break;
  33. arrays[i][j] = ou--;
  34. }
  35. for (j++, i--; i >= c + 1; i--)//从下到上
  36. {
  37. if (ou > z) break;
  38. arrays[i][j] = ou--;
  39. }
  40. c++;
  41. }
  42. // if col<>row then shift the matrics so that the smallest number is in the center of the row*col's matrics.
  43. if (row > col)
  44. {
  45. int offset = (row - col) / 2;
  46. for (int k = 0; k < col; k++)//move mat to left (row-col)/2 cols.
  47. {
  48. for (int m = 0; m < row; m++)
  49. {
  50. arrays[m][k] = arrays[m][k + offset];
  51. }
  52. }
  53. }
  54. else if (col > row)
  55. {
  56. int offset = (col - row) / 2;
  57. for (int k = 0; k < row; k++)//move mat to up (col-row)/2 cols.
  58. {
  59. for (int m = 0; m < col; m++)
  60. {
  61. arrays[k][m] = arrays[k+offset][m];
  62. }
  63. }
  64. }
  65. }
  66. void getDownUpMeanderMatrics(std::vector <std::vector <int>>& arrays, int row, int col)
  67. {
  68. arrays.resize(row, std::vector<int>(col));
  69. for (int i = 0; i < row; i++)
  70. {
  71. for (int j = 0; j < col; j++)
  72. {
  73. if (i % 2 == 0)
  74. {
  75. arrays[i][j] = col * i + j+1;
  76. }
  77. else
  78. {
  79. arrays[i][j] = col * i+(col- j);
  80. }
  81. }
  82. }
  83. }
  84. void getUpDownMeanderMatrics(std::vector <std::vector <int>>& arrays, int row, int col)
  85. {
  86. arrays.resize(row, std::vector<int>(col));
  87. for (int i = 0; i <row; i++)
  88. {
  89. for (int j = 0; j < col; j++)
  90. {
  91. if (i % 2 == 0)
  92. {
  93. arrays[i][j] = col * (row-i) + j + 1;
  94. }
  95. else
  96. {
  97. arrays[i][j] = col *(row- i) + (col - j);
  98. }
  99. }
  100. }
  101. }
  102. }
  103. using namespace OTSDATA;
  104. // CFieldMgr
  105. CFieldMgr::CFieldMgr(int scanfieldsize,CSize a_ResolutionSize)
  106. {
  107. m_ScanFieldSize = scanfieldsize;
  108. m_ResolutionSize = a_ResolutionSize;
  109. m_pMeasureArea=nullptr;
  110. }
  111. CFieldMgr::~CFieldMgr()
  112. {
  113. }
  114. // CFieldMgr member functions
  115. // public
  116. // initialization
  117. BOOL CFieldMgr::Init(CDomainPtr a_pMeasureArea, CSize a_ResolutionSize,int a_scanfieldsize,int a_FieldStartMode)
  118. {
  119. // input check
  120. ASSERT(a_pMeasureArea);
  121. // assign class member
  122. m_pMeasureArea = CDomainPtr(new CDomain(a_pMeasureArea.get()));
  123. m_ResolutionSize = a_ResolutionSize;
  124. m_fieldStartMode = a_FieldStartMode;
  125. m_ScanFieldSize = a_scanfieldsize;
  126. // calculate field centre points list
  127. // ok, return TRUE;
  128. return TRUE;
  129. }
  130. std::vector<CPoint> CFieldMgr::GetUnmeasuredFieldCentrePoints(std::vector<CPoint> a_listMeasuredFieldCentrePoints)
  131. {
  132. std::vector<CPoint> allPoints = CalculateFieldCentrePoints1();
  133. std::vector<CPoint> unmeasuredPoints;
  134. for(auto p:allPoints)
  135. if (!IsInMeasuredFieldList(p,a_listMeasuredFieldCentrePoints))
  136. {
  137. // add the field centre into the unmeasured field centre points list
  138. unmeasuredPoints.push_back(p);
  139. }
  140. return unmeasuredPoints;
  141. }
  142. // reset
  143. BOOL CFieldMgr::Reset(CDomainPtr a_pMeasureArea,
  144. CSize a_ResolutionSize, int a_FieldStartMode,
  145. int a_scanFieldSzie,
  146. std::vector<CPoint>& a_listMeasuredFieldCentrePoints)
  147. {
  148. // input check
  149. ASSERT(a_pMeasureArea);
  150. if (!a_pMeasureArea || a_pMeasureArea->IsInvalid())
  151. {
  152. LogErrorTrace(__FILE__, __LINE__, _T("Reset: invalid measure area poiter."));
  153. return FALSE;
  154. }
  155. // check member parameters
  156. //ASSERT(m_pMeasureArea && m_poImageScanParam && m_poSEMDataMsr);
  157. if (!m_pMeasureArea || m_ScanFieldSize==0)
  158. {
  159. // shouldn't happen
  160. LogErrorTrace(__FILE__, __LINE__, _T("Reset: invalid member parameter(s)."));
  161. return FALSE;
  162. }
  163. // check if need to re-do field centres calculation
  164. if (!(*(a_pMeasureArea.get()) == *(m_pMeasureArea.get())) || // measure domain has been changed
  165. a_FieldStartMode != m_fieldStartMode )
  166. {
  167. // need to re-do field centres calculation
  168. return Init(a_pMeasureArea, m_ResolutionSize, a_scanFieldSzie,m_fieldStartMode);
  169. }
  170. return TRUE;
  171. }
  172. // calculate total fields
  173. long CFieldMgr::CalculateTotalFields(CDomainPtr a_poMeasureArea, double a_dScanFieldSizeX, CSize a_sizePixelImage)
  174. {
  175. // total fields
  176. long nTotalFields = -1;
  177. // input check
  178. ASSERT(a_poMeasureArea);
  179. if (!a_poMeasureArea || a_poMeasureArea->IsInvalid())
  180. {
  181. LogErrorTrace(__FILE__, __LINE__, _T("CalculateTotalFields: invalid mesure area point."));
  182. return nTotalFields;
  183. }
  184. // calculate scan field size--Y
  185. double dScanFieldSizeY = a_dScanFieldSizeX * (double)a_sizePixelImage.cy / (double)a_sizePixelImage.cx;
  186. // calculate total columns
  187. long nTotalCols = (long)ceil((double)a_poMeasureArea->GetDomainRect().Width() / a_dScanFieldSizeX);
  188. // calculate total rows
  189. long nTotalRows = (long)ceil((double)a_poMeasureArea->GetDomainRect().Height() / dScanFieldSizeY);
  190. // calculate column on the right of the center column
  191. long nRightColumns = nTotalCols / 2;
  192. // calculate rows above the center row
  193. long nTopRows = nTotalRows / 2;
  194. // re-calculate total columns, total rows make sure they are odd numbers
  195. nTotalCols = nRightColumns * 2 + 1;
  196. nTotalRows = nTopRows * 2 + 1;
  197. // measure are is a rectangle?
  198. if (a_poMeasureArea->IsRect() || nTotalCols == 1 || nTopRows == 1)
  199. {
  200. // easy
  201. nTotalFields = nTotalCols * nTopRows;
  202. }
  203. else
  204. {
  205. // we need to do more calculation
  206. // centre row, centre column and centre field
  207. nTotalFields = nRightColumns * 2 + nTotalRows * 2 + 1;
  208. // calculate top right part
  209. int nTopRightPartFileds = 0;
  210. CPoint poi;
  211. // row by row
  212. for (int i = 1; i <= nTopRows; ++i)
  213. {
  214. // calculate row y position (field bottom)
  215. poi.y = a_poMeasureArea->GetDomainCenter().y + (int)dScanFieldSizeY * i - (int)dScanFieldSizeY / 2;
  216. // column by column
  217. for (int j = 1; j <= nRightColumns; ++j)
  218. {
  219. // calculate column x position (field left)
  220. poi.x = a_poMeasureArea->GetDomainCenter().x + (int)a_dScanFieldSizeX * i - (int)a_dScanFieldSizeX / 2;
  221. // test if this field is in the measure domain
  222. if (a_poMeasureArea->PtInDomain(poi))
  223. {
  224. // in the measure domain, count it.
  225. ++nTopRightPartFileds;
  226. }
  227. else
  228. {
  229. // not in the measure domain, get out row test
  230. break;
  231. }
  232. }
  233. }
  234. // add other fields (top right part fields times 4)
  235. nTotalFields += nTopRightPartFileds * 4;
  236. }
  237. // return total fields
  238. return nTotalFields;
  239. }
  240. // field centre points list
  241. BOOL CFieldMgr::GetFieldRectByIndex(int a_nIndex, CRect& a_rectField)
  242. {
  243. auto m_listFieldCentrePoints = CalculateFieldCentrePoints1();
  244. // check input
  245. if (a_nIndex < 0 || a_nIndex >(int)m_listFieldCentrePoints.size())
  246. {
  247. LogErrorTrace(__FILE__, __LINE__, _T("GetFieldRectByIndex: invalid intex value."));
  248. return FALSE;
  249. }
  250. // get image size
  251. CSize sizePixelImage = m_ResolutionSize;
  252. // scan field size (x, y)
  253. CSize sizeImage;
  254. sizeImage.cx = m_ScanFieldSize;
  255. sizeImage.cy = sizeImage.cx * sizePixelImage.cy / sizePixelImage.cx;
  256. // get left top
  257. CPoint ptLeftTop = m_listFieldCentrePoints[a_nIndex] - CPoint(sizeImage.cx / 2, sizeImage.cy / 2);
  258. // get field rectangle
  259. a_rectField = CRect(ptLeftTop, sizeImage);
  260. return TRUE;
  261. }
  262. // measure area
  263. void CFieldMgr::SetMeasureArea(CDomainPtr a_pMeasureArea)
  264. {
  265. // input check
  266. ASSERT(a_pMeasureArea);
  267. if (!a_pMeasureArea)
  268. {
  269. LogErrorTrace(__FILE__, __LINE__, _T("SetMeasureArea: invalid measure area poiter."));
  270. return;
  271. }
  272. m_pMeasureArea = CDomainPtr(new CDomain(a_pMeasureArea.get()));
  273. }
  274. COTSFieldDataPtr CFieldMgr::FindNeighborField(const COTSFieldDataList a_flds, COTSFieldDataPtr a_centerField, SORTING_DIRECTION a_direction)
  275. {
  276. COTSFieldDataPtr fld;
  277. double pixelsize;
  278. double mScanfieldsize_y = m_ScanFieldSize * m_ResolutionSize.cy / m_ResolutionSize.cx;
  279. for (auto f : a_flds)
  280. {
  281. SORTING_DIRECTION di;
  282. IsNeighborFieldCentre(f->GetPosition(), a_centerField->GetPosition(), m_ScanFieldSize, mScanfieldsize_y, di);
  283. if (di == a_direction)
  284. {
  285. return f;
  286. }
  287. }
  288. return fld;
  289. }
  290. // protected
  291. // calculate field centre points list
  292. std::vector<CPoint> CFieldMgr::CalculateFieldCentrePoints1()
  293. {
  294. // field centre points list
  295. std::vector<CPoint> m_listFieldCentrePoints;
  296. // clean up
  297. m_listFieldCentrePoints.clear();
  298. CSize ImageSizeByPixel = m_ResolutionSize;
  299. // scan field size (x, y)
  300. double pixelx = ImageSizeByPixel.cx ;
  301. double pixely = ImageSizeByPixel.cy;
  302. double dScanFiledSizeX = m_ScanFieldSize ;
  303. double dScanFiledSizeY = m_ScanFieldSize * pixely / pixelx;
  304. CSize sizeImage;
  305. sizeImage.cx = dScanFiledSizeX;
  306. sizeImage.cy = dScanFiledSizeY;
  307. // pixel size (micros)
  308. //double dPixelSize = (double)dScanFiledSizeX / (double)ImageSizeByPixel.cx;
  309. double dOverLapSize = m_Overlap * dScanFiledSizeX / pixelx;
  310. // the measure domain rectangle
  311. CRect rectMeasureDomain = m_pMeasureArea->GetDomainRect();
  312. // the measure domain centre
  313. CPoint poiDomainCentre = rectMeasureDomain.CenterPoint();
  314. // start mode
  315. OTS_GET_IMAGE_MODE nStartMode = (OTS_GET_IMAGE_MODE)m_fieldStartMode;
  316. // calculate total columns, rows and make sure the domain area be covered
  317. int nTotalCols = (int)(ceil((double)rectMeasureDomain.Width() / (dScanFiledSizeX - dOverLapSize)));
  318. int nTotalRows = (int)(ceil((double)rectMeasureDomain.Height() / (dScanFiledSizeY - dOverLapSize)));
  319. // calculate column on the left of the centre point
  320. int nLeftCols = nTotalCols / 2;
  321. int nRightCols = nLeftCols;
  322. // fields on top
  323. int nRowsOnTop = nTotalRows / 2;
  324. // sure total columns, rows are odd numbers
  325. nTotalCols = nLeftCols * 2 + 1;
  326. //nTotalRows = nTotalRows * 2 + 1;
  327. nTotalRows = nRowsOnTop * 2 + 1;
  328. // calculate left, right field column position (x only
  329. int nLeftMostColX = poiDomainCentre.x - nLeftCols * ((int)dScanFiledSizeX - (int)dOverLapSize);
  330. int nUpMostRowY = poiDomainCentre.y - nRowsOnTop * ((int)dScanFiledSizeY - (int)dOverLapSize);
  331. std::vector <std::vector <CPoint>> pointMatrics(nTotalRows, std::vector<CPoint>(nTotalCols));
  332. for (int i = 0; i < nTotalRows; i++)
  333. {
  334. for (int j = 0; j < nTotalCols; j++)
  335. {
  336. pointMatrics[i][j].x = nLeftMostColX + j * ((int)dScanFiledSizeX - (int)dOverLapSize);
  337. pointMatrics[i][j].y = nUpMostRowY + i * ((int)dScanFiledSizeY - (int)dOverLapSize);
  338. }
  339. }
  340. std::vector <std::vector <int>> sequenceMat; //construct an matrics map to the pointMatrics,but the content is the sequence number.
  341. switch (nStartMode)
  342. {
  343. case OTS_GET_IMAGE_MODE::FROM_CENTER:
  344. getSpiralMatrics(sequenceMat, nTotalRows,nTotalCols);
  345. break;
  346. case OTS_GET_IMAGE_MODE::UP_TO_DOWN :
  347. getUpDownMeanderMatrics(sequenceMat, nTotalRows, nTotalCols);
  348. break;
  349. case OTS_GET_IMAGE_MODE::DOWN_TO_UP :
  350. case OTS_GET_IMAGE_MODE::RANDOM :
  351. getDownUpMeanderMatrics(sequenceMat, nTotalRows, nTotalCols);
  352. break;
  353. }
  354. std::map <int, CPoint> mapCenterPoint;
  355. for (int i = 0; i < nTotalRows; i++)
  356. {
  357. for (int j = 0; j < nTotalCols; j++)
  358. {
  359. int sequenceNum = sequenceMat[i][j];
  360. CPoint p = pointMatrics[i][j];
  361. mapCenterPoint[sequenceNum] = p;// sorting all the field center point by the sequence number.
  362. }
  363. }
  364. // 判断当前样品获取帧图信息的测量区域为多边形
  365. if ((int)m_pMeasureArea->GetShape() > 1)
  366. {
  367. std::vector<CPoint> ptPolygon = m_pMeasureArea->GetPolygonPoint();
  368. for (auto itr : mapCenterPoint)
  369. {
  370. CPoint itrPoint = itr.second;
  371. if (IsInPolygonMeasureArea(itrPoint, sizeImage, ptPolygon))
  372. {
  373. m_listFieldCentrePoints.push_back(itr.second);
  374. }
  375. }
  376. }
  377. else
  378. {
  379. for (auto itr : mapCenterPoint)
  380. {
  381. if (IsInMeasureArea(itr.second, sizeImage))
  382. {
  383. m_listFieldCentrePoints.push_back(itr.second);
  384. }
  385. }
  386. }
  387. return m_listFieldCentrePoints;
  388. }
  389. // test if field is in or partly in the measure domain area
  390. BOOL CFieldMgr::IsInPolygonMeasureArea(CPoint a_poiField, CSize a_sizeImageSize, std::vector<CPoint> ptPolygon)
  391. {
  392. // check measure area parameter
  393. ASSERT(m_pMeasureArea);
  394. if (!m_pMeasureArea)
  395. {
  396. // shouldn't happen
  397. LogErrorTrace(__FILE__, __LINE__, _T("IsInDomainArea: invalid measure area parameter."));
  398. return FALSE;
  399. }
  400. // test field centre point first
  401. if (PtInPolygon(a_poiField, ptPolygon))
  402. {
  403. // centre in the measure domain area, return TRUE
  404. return TRUE;
  405. }
  406. // get measure field centre
  407. CPoint poiMsrAreaCentre = m_pMeasureArea->GetDomainCenter();
  408. // move to left top postion.
  409. a_poiField -= CPoint(a_sizeImageSize.cx / 2, a_sizeImageSize.cy / 2);
  410. // rectangle of the field
  411. CRect rectFiled(a_poiField, a_sizeImageSize);
  412. // // on the top left side, need to test the bottom right corner
  413. if (PtInPolygon(CPoint(rectFiled.right, rectFiled.top), ptPolygon))
  414. {
  415. return TRUE;
  416. }
  417. // // on the bottom left side, need to test the top right corner
  418. if (PtInPolygon(rectFiled.BottomRight(), ptPolygon))
  419. {
  420. return TRUE;
  421. }
  422. // // on the top left side, need to test the bottom right corner
  423. if (PtInPolygon(rectFiled.TopLeft(), ptPolygon))
  424. {
  425. return TRUE;
  426. }
  427. // // on the bottom left side, need to test the top right corner
  428. if (PtInPolygon(CPoint(rectFiled.left, rectFiled.bottom), ptPolygon))
  429. {
  430. return TRUE;
  431. }
  432. // this field is not in the area at all, return FALSE.
  433. return FALSE;
  434. }
  435. //作用:判断点是否在多边形内
  436. //p指目标点, ptPolygon指多边形的点集合, nCount指多边形的边数
  437. BOOL CFieldMgr::PtInPolygon(CPoint p, std::vector<CPoint> ptPolygon)
  438. {
  439. int nCount = ptPolygon.size();
  440. // 交点个数
  441. int nCross = 0;
  442. for (int i = 0; i < nCount; i++)
  443. {
  444. CPoint p1 = ptPolygon[i];
  445. CPoint p2 = ptPolygon[(i + 1) % nCount];// 点P1与P2形成连线
  446. if (p1.y == p2.y)
  447. continue;
  448. if (p.y < min(p1.y, p2.y))
  449. continue;
  450. if (p.y >= max(p1.y, p2.y))
  451. continue;
  452. // 求交点的x坐标(由直线两点式方程转化而来)
  453. double x = (double)(p.y - p1.y) * (double)(p2.x - p1.x) / (double)(p2.y - p1.y) + p1.x;
  454. // 只统计p1p2与p向右射线的交点
  455. if (x > p.x)
  456. {
  457. nCross++;
  458. }
  459. }
  460. // 交点为偶数,点在多边形之外
  461. // 交点为奇数,点在多边形之内
  462. if ((nCross % 2) == 1)
  463. {
  464. //true;
  465. return TRUE;
  466. }
  467. else
  468. {
  469. //false;
  470. return FALSE;
  471. }
  472. }
  473. // test if field is in or partly in the measure domain area
  474. BOOL CFieldMgr::IsInMeasureArea(CPoint a_poiField, CSize a_sizeImageSize)
  475. {
  476. // check measure area parameter
  477. ASSERT(m_pMeasureArea);
  478. if (!m_pMeasureArea)
  479. {
  480. // shouldn't happen
  481. LogErrorTrace(__FILE__, __LINE__, _T("IsInDomainArea: invalid measure area parameter."));
  482. return FALSE;
  483. }
  484. // test field centre point first
  485. if (m_pMeasureArea->PtInDomain(a_poiField))
  486. {
  487. // centre in the measure domain area, return TRUE
  488. return TRUE;
  489. }
  490. // get measure field centre
  491. CPoint poiMsrAreaCentre = m_pMeasureArea->GetDomainCenter();
  492. // move to left top postion.
  493. a_poiField -= CPoint(a_sizeImageSize.cx / 2, a_sizeImageSize.cy / 2);
  494. // rectangle of the field
  495. CRect rectFiled(a_poiField, a_sizeImageSize);
  496. // check field position
  497. if (rectFiled.left <= poiMsrAreaCentre.x && rectFiled.right >= poiMsrAreaCentre.x)
  498. {
  499. // centre column field or centre field
  500. return TRUE;
  501. }
  502. else if (rectFiled.top <= poiMsrAreaCentre.y && rectFiled.bottom >= poiMsrAreaCentre.y)
  503. {
  504. // centre row field?
  505. return TRUE;
  506. }
  507. else if ( rectFiled.right <= poiMsrAreaCentre.x)
  508. {
  509. // on the left side
  510. //up
  511. if (rectFiled.top >= poiMsrAreaCentre.y)
  512. {
  513. // on the top left side, need to test the bottom right corner
  514. if (m_pMeasureArea->PtInDomain(CPoint(rectFiled.right, rectFiled.top)))
  515. {
  516. return TRUE;
  517. }
  518. }
  519. else if(rectFiled.bottom <= poiMsrAreaCentre.y) //down//
  520. {
  521. // on the bottom left side, need to test the top right corner
  522. if (m_pMeasureArea->PtInDomain(rectFiled.BottomRight()))
  523. {
  524. return TRUE;
  525. }
  526. }
  527. }
  528. else if(rectFiled.left >= poiMsrAreaCentre.x)
  529. {
  530. // on the right side
  531. //up
  532. if (rectFiled.top >= poiMsrAreaCentre.y)
  533. {
  534. // on the top left side, need to test the bottom right corner
  535. if (m_pMeasureArea->PtInDomain(rectFiled.TopLeft()))
  536. {
  537. return TRUE;
  538. }
  539. }
  540. else if (rectFiled.bottom <= poiMsrAreaCentre.y) //down//
  541. {
  542. // on the bottom left side, need to test the top right corner
  543. if (m_pMeasureArea->PtInDomain(CPoint(rectFiled.left, rectFiled.bottom)))
  544. {
  545. return TRUE;
  546. }
  547. }
  548. }
  549. // this field is not in the area at all, return FALSE.
  550. return FALSE;
  551. }
  552. // test if field is in the measured field centre points list
  553. BOOL CFieldMgr::IsInMeasuredFieldList(CPoint a_poiField, std::vector<CPoint> m_listHaveMeasuredFieldCentrePoints)
  554. {
  555. // has to not be in the measured field centre points list
  556. //auto itr = std::find(m_listHaveMeasuredFieldCentrePoints.begin(), m_listHaveMeasuredFieldCentrePoints.end(), a_poiField);
  557. //if (itr != m_listHaveMeasuredFieldCentrePoints.end())
  558. //{
  559. // // in the measured field centre points list, this is a measured field, return TRUE
  560. // return TRUE;
  561. //}
  562. for (CPoint pnt : m_listHaveMeasuredFieldCentrePoints)
  563. {
  564. double scanHeight = (double)m_ScanFieldSize * ((double)m_ResolutionSize.cy / (double)m_ResolutionSize.cx);
  565. CPoint leftTop = CPoint(pnt.x - m_ScanFieldSize / 2, pnt.y + scanHeight / 2);
  566. CPoint rightBottom = CPoint(pnt.x + m_ScanFieldSize / 2, pnt.y - scanHeight / 2);
  567. COTSRect rec = COTSRect(leftTop, rightBottom);
  568. if (rec.PointInRect(a_poiField))
  569. {
  570. return true;
  571. }
  572. }
  573. // ok, return FALSE
  574. return FALSE;
  575. }
  576. // find the next field centre
  577. BOOL CFieldMgr::FindNeighborFieldCentre(const std::vector<CPoint>& a_listFieldCentres,
  578. double a_dScanFieldSizeX,
  579. double a_dScanFieldSizeY,
  580. CPoint a_poiCurrent,
  581. SORTING_DIRECTION& a_nDirection,
  582. CPoint& a_poiNeighbor)
  583. {
  584. // assume no neighbor
  585. BOOL bFind = FALSE;
  586. // go through the field centres list
  587. for (const CPoint& poiFieldCentre : a_listFieldCentres)
  588. {
  589. // test if this is a neighbor field centre
  590. SORTING_DIRECTION nDirection;
  591. if (IsNeighborFieldCentre(poiFieldCentre, a_poiCurrent, a_dScanFieldSizeX, a_dScanFieldSizeY, nDirection))
  592. {
  593. // we find a neighbor field centre
  594. // let see if this is neighbor we are looking for
  595. switch (a_nDirection)
  596. {
  597. // last move is left
  598. case SORTING_DIRECTION::LEFT:
  599. {
  600. // we are looking for DOWN neighbor
  601. if (nDirection == SORTING_DIRECTION::DOWN)
  602. {
  603. // we find a neighbor below, get out
  604. a_poiNeighbor = poiFieldCentre;
  605. a_nDirection = SORTING_DIRECTION::DOWN;
  606. return TRUE;
  607. }
  608. }
  609. break;
  610. // last move is down
  611. case SORTING_DIRECTION::DOWN:
  612. {
  613. // we are looking for RIGHT neighbor
  614. if (nDirection == SORTING_DIRECTION::RIGHT)
  615. {
  616. // we find a neighbor on the right, get out
  617. a_poiNeighbor = poiFieldCentre;
  618. a_nDirection = SORTING_DIRECTION::RIGHT;
  619. return TRUE;
  620. }
  621. }
  622. break;
  623. // last move is right
  624. case SORTING_DIRECTION::RIGHT:
  625. {
  626. // we are looking for UP neighbor
  627. if (nDirection == SORTING_DIRECTION::UP)
  628. {
  629. // we find a neighbor above
  630. a_poiNeighbor = poiFieldCentre;
  631. a_nDirection = SORTING_DIRECTION::UP;
  632. return TRUE;
  633. }
  634. }
  635. break;
  636. // last move is up
  637. case SORTING_DIRECTION::UP:
  638. {
  639. // we are looking for LEFT neighbor
  640. if (nDirection == SORTING_DIRECTION::LEFT)
  641. {
  642. // we find a neighbor on the left, get out
  643. a_poiNeighbor = poiFieldCentre;
  644. a_nDirection = SORTING_DIRECTION::LEFT;
  645. return TRUE;
  646. }
  647. }
  648. break;
  649. }
  650. }
  651. }
  652. for (const CPoint& poiFieldCentre : a_listFieldCentres)
  653. {
  654. // test if this is a neighbor field centre
  655. SORTING_DIRECTION nDirection;
  656. if (IsNeighborFieldCentre(poiFieldCentre, a_poiCurrent, a_dScanFieldSizeX, a_dScanFieldSizeY, nDirection))
  657. {
  658. // we find a neighbor field centre
  659. // let see if this is neighbor we are looking for
  660. switch (a_nDirection)
  661. {
  662. // last move is left
  663. case SORTING_DIRECTION::LEFT:
  664. {
  665. // we are looking for DOWN neighbor , but not found
  666. // or LEFT neighbor otherwise
  667. if (nDirection == SORTING_DIRECTION::LEFT)
  668. {
  669. // we find a neighbor on the left, continue looking
  670. a_poiNeighbor = poiFieldCentre;
  671. return TRUE;
  672. }
  673. }
  674. break;
  675. // last move is down
  676. case SORTING_DIRECTION::DOWN:
  677. {
  678. // we are looking for RIGHT neighbor, but not found
  679. // or DOWN neighbor otherwise
  680. if (nDirection == SORTING_DIRECTION::DOWN)
  681. {
  682. // we find a neighbor below, continue looking
  683. a_poiNeighbor = poiFieldCentre;
  684. return TRUE;
  685. }
  686. }
  687. break;
  688. // last move is right
  689. case SORTING_DIRECTION::RIGHT:
  690. {
  691. // we are looking for UP neighbor, but not found
  692. // or RIGHT neighbor, otherwise
  693. if (nDirection == SORTING_DIRECTION::RIGHT)
  694. {
  695. // we find a neighbor on the right, continue looking
  696. a_poiNeighbor = poiFieldCentre;
  697. return TRUE;
  698. }
  699. }
  700. break;
  701. // last move is up
  702. case SORTING_DIRECTION::UP:
  703. {
  704. // we are looking for LEFT neighbor, but not found
  705. // or UP neighbor, otherwise
  706. if (nDirection == SORTING_DIRECTION::UP)
  707. {
  708. // we find a neighbor above, continue looking
  709. a_poiNeighbor = poiFieldCentre;
  710. return TRUE;
  711. }
  712. }
  713. break;
  714. }
  715. }
  716. }
  717. // return find result
  718. return bFind;
  719. }
  720. // find field centre closest to measure domain point
  721. BOOL CFieldMgr::FindFieldCentreClosestMeasureDomainCentre(const std::vector<CPoint>& a_listFieldCentres, CPoint a_poiMeasureDomain, CPoint& a_poi)
  722. {
  723. // distance ratio
  724. int nDisRadio = -1;
  725. for (const CPoint& poiFieldCentre : a_listFieldCentres)
  726. {
  727. // calculate current field centre distance ratio
  728. int nCurFiledDisRadio = (poiFieldCentre.x - a_poiMeasureDomain.x)*(poiFieldCentre.x - a_poiMeasureDomain.x) + (poiFieldCentre.y - a_poiMeasureDomain.y)*(poiFieldCentre.y - a_poiMeasureDomain.y);
  729. // pick one which more closer to centre
  730. if (nDisRadio > nCurFiledDisRadio || nDisRadio == -1)
  731. {
  732. a_poi = poiFieldCentre;
  733. nDisRadio = nCurFiledDisRadio;
  734. }
  735. }
  736. // nDisRadio != -1 means there still field centre in the a_listFieldCentres
  737. return nDisRadio != -1;
  738. }
  739. // find right far side field centre
  740. void CFieldMgr::FindRightMostFieldCentre(const std::vector<CPoint>& a_listFieldCentres, CPoint& a_poi)
  741. {
  742. for (auto& poi : a_listFieldCentres)
  743. {
  744. if (poi.y == a_poi.y && poi.x > a_poi.x)
  745. {
  746. a_poi = poi;
  747. }
  748. }
  749. }
  750. // find left far side field centre
  751. void CFieldMgr::FindLeftMostFieldCentre(const std::vector<CPoint>& a_listFieldCentres, CPoint& a_poi)
  752. {
  753. for (auto& poi : a_listFieldCentres)
  754. {
  755. if (poi.y == a_poi.y && poi.x < a_poi.x)
  756. {
  757. a_poi = poi;
  758. }
  759. }
  760. }
  761. // find top far side field centre
  762. void CFieldMgr::FindHeighestFieldCentre(const std::vector<CPoint>& a_listFieldCentres, CPoint& a_poi)
  763. {
  764. for (auto& poi : a_listFieldCentres)
  765. {
  766. if (poi.x == a_poi.x && poi.y > a_poi.y)
  767. {
  768. a_poi = poi;
  769. }
  770. }
  771. }
  772. // find bottom far side field centre
  773. void CFieldMgr::FindLowestFieldCentre(const std::vector<CPoint>& a_listFieldCentres, CPoint& a_poi)
  774. {
  775. for (auto& poi : a_listFieldCentres)
  776. {
  777. if (poi.x == a_poi.x && poi.y < a_poi.y)
  778. {
  779. a_poi = poi;
  780. }
  781. }
  782. }
  783. // check if this is a neighbor field centre
  784. BOOL CFieldMgr::IsNeighborFieldCentre(CPoint a_poiFieldCentre,
  785. CPoint a_poiCurrent,
  786. double a_dScanFieldSizeX,
  787. double a_dScanFieldSizeY,
  788. SORTING_DIRECTION& a_nDirection)
  789. {
  790. // x position of the tow field centres are the same, y positions have one field difference
  791. if (a_poiFieldCentre.x == a_poiCurrent.x && abs(a_poiFieldCentre.y - a_poiCurrent.y) == long(a_dScanFieldSizeY))
  792. {
  793. // test is above or below
  794. if (a_poiCurrent.y > a_poiFieldCentre.y)
  795. {
  796. // below
  797. a_nDirection = SORTING_DIRECTION::DOWN;
  798. }
  799. else
  800. {
  801. // above
  802. a_nDirection = SORTING_DIRECTION::UP;
  803. }
  804. // this is a neighbor field centre, return TRUE
  805. return TRUE;
  806. }
  807. // y position of the tow field centres are the same, x positions have one field difference
  808. else if (a_poiFieldCentre.y == a_poiCurrent.y && abs(a_poiFieldCentre.x - a_poiCurrent.x) == long(a_dScanFieldSizeX))
  809. {
  810. // test is on left or right
  811. if (a_poiCurrent.x > a_poiFieldCentre.x)
  812. {
  813. // on the left
  814. a_nDirection = SORTING_DIRECTION::LEFT;
  815. }
  816. else
  817. {
  818. // on the right
  819. a_nDirection = SORTING_DIRECTION::RIGHT;
  820. }
  821. // this is a neighbor field centre, return TRUE
  822. return TRUE;
  823. }
  824. // this is not a neighbor field centre, return FALSE
  825. return FALSE;
  826. }
  827. // get a random number in a given range
  828. int CFieldMgr::GetRangedRandNumber(int a_nRange_min, int a_nRange_max)
  829. {
  830. // return a random number
  831. int nRet;
  832. // get a random number in the given range
  833. nRet = long((double)rand() / (RAND_MAX + 1) * (a_nRange_max - a_nRange_min) + a_nRange_min);
  834. // return the random number
  835. return nRet;
  836. }
  837. }