【发布时间】:2016-05-11 09:21:20
【问题描述】:
【问题讨论】:
标签: c++ opencv polynomial-math polynomials
【问题讨论】:
标签: c++ opencv polynomial-math polynomials
让我们看看这是否有帮助。如下:
f = polynomial
f' = derivative of f
N = Number of subdivisions
D = length of each subdivisions
a = x coordinate of f for the first end of the curve.
M = max of f' in the interval [a, b] where the curve is to be drawn.
k = an integer such that an error of M/k would be negligible
算法
对于每个1 <= j <= N - 1,找到n(j) 使得以下sum(j) 接近jD 小于M/k:
sum(j) = sum from i=1 to n(j) of sqrt(1 + f'(a + (i-1)/k)^2)/k
算法思路
数量:
1/k * sqrt(1 + f'(a + (i-1)/k)^2)
是a + (i-1)/k 和a + i/k 之间曲线的大致长度。
该算法的思想是将这些小曲线段的长度相加,试图找出哪些与D、2D、3D等足够接近。
【讨论】: