1. A tangential approximation algorithm for measured data reduction of blade section curves
- Author
-
Xu Yang, Xin Wang, Jiming Liu, Xing-tian Qu, Jia Liu, and Ji Zhao
- Subjects
Applied Mathematics ,Computation ,Approximation algorithm ,Tangent ,Data compression ratio ,02 engineering and technology ,Condensed Matter Physics ,Curvature ,01 natural sciences ,Approximation error ,0103 physical sciences ,Polygon ,Line (geometry) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Electrical and Electronic Engineering ,010306 general physics ,Instrumentation ,Algorithm ,Mathematics - Abstract
In order to reduce the measurement time of blade in the machining process, a data reduction algorithm is proposed in this paper. The proposed algorithm first selects a set of starting points on section curves. And then change-points are found according to its tangent properties for different segments divided by the starting points. In each segment redivided by the change-points, a redefined criterion uses a variable distance between the approximating line and section curve as objective function to ensure the proposed algorithm reserves more points where the curvature of the curve is large. This makes the achieved polygon accurately retains both the shape and details of section curves. When compared with other polygonal approximation algorithms, the proposed algorithm gives consideration to both computation time and compression rate, obtains a better approximation error distribution. Experimental results show that the proposed algorithm is stable and useful in actual machining process.
- Published
- 2018
- Full Text
- View/download PDF