spline.dart 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354
  1. import 'dart:math';
  2. import 'dart:ui';
  3. import 'package:fis_measure/interfaces/date_types/point.dart';
  4. import 'package:fis_measure/interfaces/enums/items.dart';
  5. import 'package:fis_measure/interfaces/process/items/item.dart';
  6. import 'package:fis_measure/interfaces/process/items/item_metas.dart';
  7. import 'package:fis_measure/interfaces/process/items/terms.dart';
  8. import 'package:fis_measure/interfaces/process/items/types.dart';
  9. import 'package:fis_measure/interfaces/process/workspace/point_info.dart';
  10. import 'package:fis_measure/process/calcuators/curve.dart';
  11. import 'package:fis_measure/process/calcuators/calculator.dart';
  12. import 'package:fis_measure/process/items/item.dart';
  13. import 'package:fis_measure/process/items/item_feature.dart';
  14. import 'package:fis_measure/process/primitives/utils/auto_snap.dart';
  15. import 'package:fis_measure/utils/canvas.dart';
  16. import 'area_abstract.dart';
  17. /// 曲线连线
  18. class Spline extends AreaItemAbstract with AutoSnapMixin {
  19. Spline(ItemMeta meta, [IMeasureItem? parent]) : super(meta, parent);
  20. static Spline createAreaPerimeter(ItemMeta meta, [IMeasureItem? parent]) {
  21. Spline spline = Spline(meta, parent);
  22. spline.calculator = _AreaPerimeterCalc(spline);
  23. spline.isClosed = false;
  24. spline.splineTension = 0.5;
  25. return spline;
  26. }
  27. static Spline createCurveLength(
  28. ItemMeta meta, [
  29. IMeasureItem? parent,
  30. ]) {
  31. Spline spline = Spline(meta, parent);
  32. spline.calculator = CurveLengthCal(spline);
  33. spline.isClosed = false;
  34. spline.splineTension = 0.5;
  35. return spline;
  36. }
  37. @override
  38. bool onExecuteMouse(PointInfo args) {
  39. if (state == ItemStates.finished) {
  40. if (args.pointType == PointInfoType.mouseDown) {
  41. state = ItemStates.waiting;
  42. }
  43. }
  44. if (state == ItemStates.waiting) {
  45. if (args.pointType == PointInfoType.mouseDown) {
  46. handleMouseDownWhileWaiting(args);
  47. }
  48. } else if (state == ItemStates.running) {
  49. if (feature == null) return false;
  50. if (args.pointType == PointInfoType.mouseUp) return false;
  51. final f = feature!;
  52. if (args.pointType == PointInfoType.mouseDown) {
  53. f.innerPoints.add(args);
  54. } else {
  55. f.innerPoints.last = args;
  56. }
  57. doCalculate();
  58. if (checkAutoSnap(args)) {
  59. f.innerPoints.removeLast();
  60. }
  61. }
  62. return true;
  63. }
  64. @override
  65. bool onExecuteTouch(PointInfo args) {
  66. // TODO: implement onExecuteTouch
  67. throw UnimplementedError();
  68. }
  69. void handleMouseDownWhileWaiting(PointInfo args) {
  70. // TODO: 判断是否当前area
  71. final point = args.toAreaLogicPoint();
  72. feature = SplineFeature(this, point);
  73. if (args.hostVisualArea != null) {
  74. feature!.hostVisualArea = args.hostVisualArea;
  75. }
  76. state = ItemStates.running;
  77. }
  78. }
  79. class SplineFeature extends AreaItemFeatureAbstract {
  80. static const double _splineTolerance = 0.05;
  81. SplineFeature(Spline refItem, DPoint point) : super(refItem) {
  82. innerPoints.add(point.clone());
  83. innerPoints.add(point.clone());
  84. }
  85. @override
  86. void paint(Canvas canvas, Size size) {
  87. if (innerPoints.isEmpty) return;
  88. final paintPoints = innerPoints;
  89. drawId(canvas, size);
  90. final startOffset = convert2ViewPoint(size, startPoint).toOffset();
  91. if (paintPoints.length == 1) {
  92. drawVertex(canvas, startOffset, true);
  93. return;
  94. } else if (paintPoints.length == 2) {
  95. final endOffset = convert2ViewPoint(size, endPoint).toOffset();
  96. drawVertex(canvas, startOffset, true);
  97. drawVertex(canvas, endOffset, true);
  98. canvas.drawDashLine(startOffset, endOffset, 1, 10, paintLinePan);
  99. return;
  100. }
  101. /// 全部innerPoints点集转为Offset集绘制
  102. for (var e in innerPoints) {
  103. drawVertex(canvas, convert2ViewPoint(size, e).toOffset());
  104. }
  105. /// 获取拟合点集
  106. final fittedPoints = getFitPoints(
  107. innerPoints, isClosed, splineTension, _splineTolerance / 2);
  108. /// 全部拟合点集转为Offset集
  109. final fittedOffsets =
  110. fittedPoints.map((e) => convert2ViewPoint(size, e).toOffset()).toList();
  111. canvas.drawDashPointsLine(fittedOffsets, 1, 10, paintLinePan, close: true);
  112. }
  113. List<DPoint> getFitPoints(
  114. List<DPoint> points,
  115. bool isClosed,
  116. double tension,
  117. double tolerance,
  118. ) {
  119. final List<DPoint> polyLineSegment = [];
  120. final len = points.length;
  121. for (var i = 0; i < points.length; i++) {
  122. if (i == 0) {
  123. addSegment(
  124. polyLineSegment, points, [len - 1, 0, 1, 2], tension, tolerance);
  125. } else if (i == points.length - 2) {
  126. addSegment(
  127. polyLineSegment, points, [i - 1, i, i + 1, 0], tension, tolerance);
  128. } else if (i == points.length - 1) {
  129. addSegment(
  130. polyLineSegment, points, [i - 1, i, 0, 1], tension, tolerance);
  131. } else {
  132. addSegment(polyLineSegment, points, [i - 1, i, i + 1, i + 2], tension,
  133. tolerance);
  134. }
  135. }
  136. return polyLineSegment;
  137. }
  138. static void addSegment(List<DPoint> polyLineSegment, List<DPoint> points,
  139. List<int> pointIndex, double tension, double tolerance) {
  140. if (points.length < 2) return;
  141. segment(
  142. polyLineSegment,
  143. points[pointIndex[0]],
  144. points[pointIndex[1]],
  145. points[pointIndex[2]],
  146. points[pointIndex[3]],
  147. tension,
  148. tension,
  149. tolerance,
  150. );
  151. }
  152. static double segment(List<DPoint> points, DPoint pt0, DPoint pt1, DPoint pt2,
  153. DPoint pt3, double t1, double t2, double tolerance) {
  154. double length = 0;
  155. final sx1 = t1 * (pt2.x - pt0.x);
  156. final sy1 = t1 * (pt2.y - pt0.y);
  157. final sx2 = t2 * (pt3.x - pt1.x);
  158. final sy2 = t2 * (pt3.y - pt1.y);
  159. final ax = sx1 + sx2 + 2 * pt1.x - 2 * pt2.x;
  160. final ay = sy1 + sy2 + 2 * pt1.y - 2 * pt2.y;
  161. final bx = -2 * sx1 - sx2 - 3 * pt1.x + 3 * pt2.x;
  162. final by = -2 * sy1 - sy2 - 3 * pt1.y + 3 * pt2.y;
  163. final cx = sx1;
  164. final cy = sy1;
  165. final dx = pt1.x;
  166. final dy = pt1.y;
  167. var num = (((pt1.x - pt2.x).abs() + (pt1.y - pt2.y).abs()) ~/ tolerance);
  168. // Set num = 2 to calculate the length. when the distance of pt1,pt2 is very tiny, the num will be 0, the length will be 0
  169. if (num < 2) num = 2;
  170. // Notice begins at 1 so excludes the first point (which is just pt1)
  171. for (var i = 1; i < num; i++) {
  172. var t = i / (num - 1);
  173. var pt = DPoint(ax * t * t * t + bx * t * t + cx * t + dx,
  174. ay * t * t * t + by * t * t + cy * t + dy);
  175. if (i == 1) {
  176. length += (pt - pt1).length;
  177. } else {
  178. length += (pt - points[points.length - 1]).length;
  179. }
  180. points.add(pt);
  181. }
  182. return length;
  183. }
  184. }
  185. class _AreaPerimeterCalc extends Calculator<Spline, double> {
  186. _AreaPerimeterCalc(Spline ref) : super(ref);
  187. @override
  188. void calculate() {
  189. if (ref.feature == null) return;
  190. final feature = ref.feature!;
  191. final viewport = feature.hostVisualArea!.viewport!;
  192. final points = feature.innerPoints.map((e) => viewport.convert(e)).toList();
  193. final tension = feature.splineTension;
  194. feature.values.clear();
  195. double area;
  196. double perimeter;
  197. //计算周长
  198. final res = calcPerimeterAndArea(points, feature.isClosed, tension, 0.25);
  199. perimeter = res[0];
  200. area = res[1];
  201. for (var output in ref.meta.outputs) {
  202. if (output.name == MeasureTerms.Perimeter) {
  203. var value = roundDouble(perimeter, output.fractionalDigits);
  204. feature.updateFloatValue(output, value, output.unit);
  205. } else if (output.name == MeasureTerms.Area) {
  206. var value = roundDouble(area, output.fractionalDigits);
  207. feature.updateFloatValue(output, value, output.unit);
  208. }
  209. }
  210. }
  211. static double calcArea(List<DPoint> points) {
  212. if (points.isEmpty) {
  213. return 0;
  214. }
  215. double sum = 0;
  216. var ax = points[0].x;
  217. var ay = points[0].y;
  218. for (var i = 1; i < points.length - 1; i++) {
  219. var bx = points[i].x;
  220. var by = points[i].y;
  221. var cx = points[i + 1].x;
  222. var cy = points[i + 1].y;
  223. sum += ax * by - ay * bx + ay * cx - ax * cy + bx * cy - cx * by;
  224. }
  225. return (-sum / 2).abs();
  226. }
  227. static List<double> calcPerimeterAndArea(
  228. List<DPoint> points,
  229. bool isClosed,
  230. double tension,
  231. double tolerance,
  232. ) {
  233. final List<DPoint> polyLineSegment = [];
  234. final len = points.length;
  235. double perimeter = 0;
  236. if (len < 2) {
  237. return [0, 0];
  238. }
  239. if (len == 2) {
  240. final p1 = points[0];
  241. final p2 = points[1];
  242. final dx = p1.x - p2.x;
  243. final dy = p1.y - p2.y;
  244. perimeter = sqrt(dx * dx + dy * dy);
  245. return [perimeter, 0];
  246. }
  247. for (var i = 0; i < points.length; i++) {
  248. if (i == 0) {
  249. perimeter += segment(
  250. polyLineSegment,
  251. isClosed ? points[points.length - 1] : points[0],
  252. points[0],
  253. points[1],
  254. points[2],
  255. tension,
  256. tension,
  257. tolerance);
  258. } else if (i == points.length - 2) {
  259. perimeter += segment(
  260. polyLineSegment,
  261. points[i - 1],
  262. points[i],
  263. points[i + 1],
  264. isClosed ? points[0] : points[i + 1],
  265. tension,
  266. tension,
  267. tolerance);
  268. } else if (i == points.length - 1) {
  269. if (isClosed) {
  270. perimeter += segment(polyLineSegment, points[i - 1], points[i],
  271. points[0], points[1], tension, tension, tolerance);
  272. }
  273. } else {
  274. perimeter += segment(polyLineSegment, points[i - 1], points[i],
  275. points[i + 1], points[i + 2], tension, tension, tolerance);
  276. }
  277. }
  278. final area = calcArea(polyLineSegment);
  279. return [perimeter, area];
  280. }
  281. static double segment(List<DPoint> points, DPoint pt0, DPoint pt1, DPoint pt2,
  282. DPoint pt3, double t1, double t2, double tolerance) {
  283. double length = 0;
  284. final sx1 = t1 * (pt2.x - pt0.x);
  285. final sy1 = t1 * (pt2.y - pt0.y);
  286. final sx2 = t2 * (pt3.x - pt1.x);
  287. final sy2 = t2 * (pt3.y - pt1.y);
  288. final ax = sx1 + sx2 + 2 * pt1.x - 2 * pt2.x;
  289. final ay = sy1 + sy2 + 2 * pt1.y - 2 * pt2.y;
  290. final bx = -2 * sx1 - sx2 - 3 * pt1.x + 3 * pt2.x;
  291. final by = -2 * sy1 - sy2 - 3 * pt1.y + 3 * pt2.y;
  292. final cx = sx1;
  293. final cy = sy1;
  294. final dx = pt1.x;
  295. final dy = pt1.y;
  296. var num = (((pt1.x - pt2.x).abs() + (pt1.y - pt2.y).abs()) ~/ tolerance);
  297. // Set num = 2 to calculate the length. when the distance of pt1,pt2 is very tiny, the num will be 0, the length will be 0
  298. if (num < 2) num = 2;
  299. // Notice begins at 1 so excludes the first point (which is just pt1)
  300. for (var i = 1; i < num; i++) {
  301. var t = i / (num - 1);
  302. var pt = DPoint(ax * t * t * t + bx * t * t + cx * t + dx,
  303. ay * t * t * t + by * t * t + cy * t + dy);
  304. if (i == 1) {
  305. length += (pt - pt1).length;
  306. } else {
  307. length += (pt - points[points.length - 1]).length;
  308. }
  309. points.add(pt);
  310. }
  311. return length;
  312. }
  313. }