line_fit.h 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154
  1. #ifndef _LINE_FIT_
  2. #define _LINE_FIT_
  3. #include <math.h>
  4. #include <vector>
  5. #include "zlist.h"
  6. NAMESPACE_POINT_BEGIN(NAMESPACE_POINT)
  7. struct fit_item
  8. {
  9. double x,y,xx,xy;
  10. fit_item();
  11. fit_item&set(double x,double y);
  12. void log()const
  13. {
  14. printf("x=%.3lf,y=%.3lf,xx=%.3lf,xy=%.3lf\n",x,y,xx,xy);
  15. }
  16. };
  17. struct card_fit;
  18. struct fit_batch:zlist<fit_item,64>
  19. {
  20. double xo,yo;
  21. std::vector<card_fit*> tool;
  22. public:
  23. fit_batch();
  24. ~fit_batch();
  25. int tool_size()const
  26. {
  27. return tool.size();
  28. }
  29. card_fit&operator[](int i) { return *tool[i]; }
  30. const card_fit&operator[](int i) const { return *tool[i]; }
  31. void add_tool(double max_x_span,int min_point);
  32. void add_tool(double max_x_span,int min_point,int max_point);
  33. void reset_data();
  34. double add(double x,double y);
  35. void replace(double x,double y);
  36. void remove_bad(int tool_id);
  37. double x(int index)const;
  38. double y(int index)const;
  39. void rlog(int i)const
  40. {
  41. rat(i).log();
  42. }
  43. void log();
  44. };
  45. struct fit_result
  46. {
  47. double k,kb,ke,ka;
  48. double xo,yo;
  49. int num_point;
  50. int min_point;
  51. double max_x_span;
  52. fit_result();
  53. fit_result(double max_x_span,int min_point);
  54. void reset();
  55. int size()const
  56. {
  57. return num_point;
  58. }
  59. bool is_valid()const
  60. {
  61. return num_point>=min_point;
  62. }
  63. void log()
  64. {
  65. //printf("%5s, %d, k=(%.3f,%.3f)\n",is_valid()?"true":"false", size(),k,ke);
  66. }
  67. double testk(double x,double y)const;
  68. double differ_k(double x,double y)const;
  69. };
  70. struct card_fit:fit_result
  71. {
  72. const fit_batch&d;
  73. double A , B , C , D ;
  74. card_fit(const fit_batch&d,double _max_x_span,int min_point);
  75. virtual ~card_fit();
  76. void reset();
  77. void dec_(const fit_item&i);
  78. void add_(const fit_item&i);
  79. virtual void add_last();
  80. virtual bool check_x_span();
  81. virtual bool fit();
  82. };
  83. struct card_fit_stop:card_fit
  84. {
  85. card_fit_stop(const fit_batch&d_,double _max_x_span,int min_point)
  86. :card_fit(d_,_max_x_span,min_point)
  87. {
  88. }
  89. virtual void add_last()
  90. {
  91. }
  92. virtual bool fit()
  93. {
  94. return false;
  95. }
  96. };
  97. struct card_fit_lastn:card_fit
  98. {
  99. int max_point;
  100. card_fit_lastn(const fit_batch&d_,double _max_x_span,int min_point,int max_point_)
  101. :card_fit(d_,_max_x_span,min_point)
  102. ,max_point(max_point_)
  103. {
  104. }
  105. bool check_x_span()
  106. {
  107. int i=size()-1;
  108. for(;i>0;i--)
  109. {
  110. double off=d(0).x-d(i).x;
  111. if(off>max_x_span+0.5 || i>=max_point)
  112. {
  113. --num_point;
  114. dec_(d(i));
  115. continue;
  116. }
  117. break;
  118. }
  119. return num_point>=min_point;
  120. }
  121. };
  122. NAMESPACE_POINT_END(NAMESPACE_POINT)
  123. #endif