Tag Info

New answers tagged

5

Algorithm Description Implementation Here, I use the chord-lenght Generate the pre-knots $\left\{\overset{-}{u}_0,\overset{-}{u}_1,\cdots , \overset{-}{u}_n\right\}$ chordLength[curvePts : {{_, _} ..}] := Module[{len, d}, len = EuclideanDistance @@@ Partition[curvePts, 2, 1]; d = Plus @@ len; Accumulate[Prepend[len/d, 0]] ] Calculate ...


3

I have not encountered that problem before that I know of. It doesn't seem too surprising to me however considering this: Instability in DeleteDuplicates and Tally As an alternative consider Subdivide (new in 10.1): sd = Subdivide[dd, dd - kk*delX, kk]; Length[sd] sd == Append[testOutcome, dd - kk*delX] 41 True LLlAMnYP made an astute ...


7

The OP linked to an answer of mine for interpolating over general point sets; for constructing a single interpolating function, a slight modification of my procedure is needed. (In particular, you don't need centripetal or chord-length parametrization in this case.) Let's start with some data: data = {{0, 0}, {1/10, 3/10}, {1/2, 3/5}, {1, -1/5}, {2, 3}, ...



Top 50 recent answers are included