region.cpp 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137
  1. /*******************************************************************
  2. Fichier : Region.cpp
  3. Date : 14/12/10
  4. Version : 1.000
  5. Description : Classe de gestion des régions
  6. |*******************************************************************/
  7. #include "region.h"
  8. #include <cstdlib>
  9. Region::Region()
  10. {
  11. m_tpoints = NULL;
  12. m_nbPoints = 0;
  13. }
  14. Region::~Region()
  15. {
  16. if ( m_tpoints )
  17. {
  18. delete[] m_tpoints;
  19. m_tpoints = NULL;
  20. m_nbPoints = 0;
  21. }
  22. }
  23. bool Region::PtInRegion0(int x, int y)
  24. {
  25. Point vPoint;
  26. vPoint.x = x;
  27. vPoint.y = y;
  28. return PtInRegion(&vPoint);
  29. }
  30. bool Region::PtInRegion(Point *vPoint)
  31. {
  32. int i, j, vx, vy;
  33. bool c = false;
  34. vx = vPoint->x;
  35. vy = vPoint->y;
  36. for (i = 0, j = m_nbPoints - 1; i < m_nbPoints; j = i++)
  37. {
  38. if ((m_tpoints[j].y - m_tpoints[i].y) != 0) // Contre les divisions par 0
  39. {
  40. if ((((m_tpoints[i].y <= vy) && (vy < m_tpoints[j].y))
  41. || ((m_tpoints[j].y <= vy) && (vy < m_tpoints[i].y))) &&
  42. (vx < (m_tpoints[j].x - m_tpoints[i].x) * (vy - m_tpoints[i].y) / (m_tpoints[j].y - m_tpoints[i].y) + m_tpoints[i].x))
  43. {
  44. c = !c;
  45. }
  46. }
  47. }
  48. return c;
  49. }
  50. Rect Region::GetRgnBox()
  51. {
  52. int minx, maxx, miny, maxy;
  53. int i;
  54. Rect vRect;
  55. minx = 32768;
  56. maxx = 0;
  57. miny = 32768;
  58. maxy = 0;
  59. for (i = 0; i < m_nbPoints; i++)
  60. {
  61. if (m_tpoints[i].x <= minx)
  62. {
  63. minx = m_tpoints[i].x;
  64. }
  65. if (m_tpoints[i].x >= maxx)
  66. {
  67. maxx = m_tpoints[i].x;
  68. }
  69. if (m_tpoints[i].y <= miny)
  70. {
  71. miny = m_tpoints[i].y;
  72. }
  73. if (m_tpoints[i].y >= maxy)
  74. {
  75. maxy = m_tpoints[i].y;
  76. }
  77. }
  78. vRect.left = minx;
  79. vRect.right = maxx;
  80. vRect.top = miny;
  81. vRect.bottom = maxy;
  82. return vRect;
  83. }
  84. bool Region::CreatePolygonRgn(Point *tabPoints, int n_points)
  85. {
  86. int i;
  87. /*
  88. if ( !tabPoints )
  89. {
  90. return false;
  91. }
  92. */
  93. m_nbPoints = n_points;
  94. m_tpoints = new Point[ n_points ];
  95. /* if ( !m_tpoints )
  96. {
  97. return false;
  98. }
  99. */
  100. for (i = 0; i < m_nbPoints; i++)
  101. {
  102. m_tpoints[i].x = tabPoints[i].x;
  103. m_tpoints[i].y = tabPoints[i].y;
  104. }
  105. return true;
  106. }
  107. void Region::DeleteObject()
  108. {
  109. if ( m_tpoints )
  110. {
  111. delete[] m_tpoints;
  112. m_tpoints = NULL;
  113. m_nbPoints = 0;
  114. }
  115. }