FieldMgr.cpp 25 KB

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