studio_geo_c.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185
  1. /**
  2. ******************************************************************************
  3. * @file : studio_geo_c.h
  4. * @author : wangyingjie
  5. * @brief : 几何矢量类型 C 语言版
  6. * @attention : None
  7. * @date : 2025/5/10
  8. ******************************************************************************
  9. */
  10. #include "studio_geo_c.h"
  11. ////////////// 点 //////////////
  12. studio_point_c studio_point_init(double xx, double yy)
  13. {
  14. studio_point_c point = {xx, yy};
  15. return point;
  16. }
  17. bool studio_point_equal(const studio_point_c *p1, const studio_point_c *p2)
  18. {
  19. bool is_equal = fabs(p1->x - p2->x) <= AO_EPSILON && fabs(p1->y - p2->y) <= AO_EPSILON;
  20. return is_equal;
  21. }
  22. ////////////// 线 //////////////
  23. // 初始化线段 (默认容量为4)
  24. studio_line_c studio_line_c_init()
  25. {
  26. studio_line_c line;
  27. line.size = 0;
  28. line.capacity = 4;
  29. line.data = (studio_point_c *) malloc(line.capacity * sizeof(studio_point_c));
  30. return line; // 注意: 返回结构体副本 (需配合 C99 或更高标准)
  31. }
  32. // 销毁线段 (释放内存)
  33. void studio_line_c_destroy(studio_line_c *line)
  34. {
  35. if (line->data)
  36. {
  37. free(line->data);
  38. line->data = NULL;
  39. line->size = 0;
  40. line->capacity = 0;
  41. }
  42. }
  43. // 添加点 (自动扩容)
  44. void studio_line_c_add_point(studio_line_c *line, studio_point_c point)
  45. {
  46. // 容量不足时扩容 (策略: 增加固定容量 10)
  47. if (line->size >= line->capacity)
  48. {
  49. line->capacity += 10;
  50. studio_point_c *new_data = (studio_point_c *) realloc(line->data, line->capacity * sizeof(studio_point_c));
  51. if (!new_data)
  52. {
  53. // 此处可添加错误处理 (例如: 终止程序或返回错误码)
  54. return;
  55. }
  56. line->data = new_data;
  57. }
  58. // 添加新元素
  59. line->data[line->size++] = point;
  60. }
  61. // 获取当前元素数量
  62. unsigned int studio_line_c_size(const studio_line_c *line)
  63. {
  64. return line->size;
  65. }
  66. studio_point_c studio_line_c_get_point(const studio_line_c *line, unsigned int index)
  67. {
  68. studio_point_c tmp;
  69. if (index < line->size)
  70. {
  71. tmp = line->data[index];
  72. return tmp;
  73. }
  74. return tmp; // 越界返回0,0点
  75. }
  76. bool studio_line_c_set_point(studio_line_c *line, unsigned int index, studio_point_c point)
  77. {
  78. bool status = false;
  79. if (index > line->size)
  80. {
  81. return status;
  82. }
  83. line->data[index] = point;
  84. status = true;
  85. return status;
  86. }
  87. ////////////// 矩形 //////////////
  88. studio_rect_c studio_rect_init(double l, double t, double r, double b)
  89. {
  90. studio_rect_c rect = {studio_point_init(l, t), studio_point_init(r, b)};
  91. return rect;
  92. }
  93. void studio_rect_correct(studio_rect_c *rect)
  94. {
  95. if (rect->left_top.x > rect->right_bottom.x)
  96. {
  97. double temp = rect->left_top.x;
  98. rect->left_top.x = rect->right_bottom.x;
  99. rect->right_bottom.x = temp;
  100. }
  101. if (rect->left_top.y < rect->right_bottom.y)
  102. {
  103. double temp = rect->left_top.y;
  104. rect->left_top.y = rect->right_bottom.y;
  105. rect->right_bottom.y = temp;
  106. }
  107. }
  108. bool studio_rect_intersect(const studio_rect_c *r1, const studio_rect_c *r2)
  109. {
  110. return !(r1->right_bottom.x < r2->left_top.x || r1->left_top.x > r2->right_bottom.x || r1->right_bottom.y > r2->
  111. left_top.y || r1->left_top.y < r2->right_bottom.y);
  112. }
  113. ////////////// 圆 //////////////
  114. studio_circle_c studio_circle_init(studio_point_c center, double radius)
  115. {
  116. studio_circle_c circle = {center, radius};
  117. return circle;
  118. }
  119. double studio_circle_area(const studio_circle_c *circle)
  120. {
  121. return AO_M_PI * circle->radius * circle->radius;
  122. }
  123. ////////////// 三角形 //////////////
  124. studio_triangle_c studio_triangle_init(studio_point_c a, studio_point_c b, studio_point_c c)
  125. {
  126. studio_triangle_c triangle = {a, b, c};
  127. return triangle;
  128. }
  129. double studio_triangle_oriented_area(const studio_triangle_c *triangle)
  130. {
  131. return (triangle->a.x * (triangle->b.y - triangle->c.y) + triangle->b.x * (triangle->c.y - triangle->a.y) + triangle
  132. ->c.x * (triangle->a.y - triangle->b.y)) / 2.0;
  133. }
  134. double studio_triangle_area(const studio_triangle_c *triangle)
  135. {
  136. return fabs(studio_triangle_oriented_area(triangle));
  137. }
  138. ////////////// 椭圆 //////////////
  139. studio_ellipse_c studio_ellipse_init(studio_point_c center, double rx, double ry)
  140. {
  141. studio_ellipse_c ellipse = {center, rx, ry};
  142. return ellipse;
  143. }
  144. double studio_ellipse_area(const studio_ellipse_c *ellipse)
  145. {
  146. return AO_M_PI * ellipse->rx * ellipse->ry;
  147. }
  148. double studio_ellipse_circumference(const studio_ellipse_c *ellipse, int Ramanujan)
  149. {
  150. if (Ramanujan == 1)
  151. {
  152. return AO_M_PI * (3 * (ellipse->rx + ellipse->ry) - sqrt(
  153. (3 * ellipse->rx + ellipse->ry) * (ellipse->rx + 3 * ellipse->ry)));
  154. }
  155. return 2 * AO_M_PI * sqrt((ellipse->rx * ellipse->rx + ellipse->ry * ellipse->ry) / 2);
  156. }