Timeline for Fitting closed polynomial curves to given points in the plane
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7 at 12:10 | history | edited | LSpice | CC BY-SA 4.0 |
Capitalise title, while this is on the front page
|
| May 7 at 12:02 | answer | added | user31127 | timeline score: 1 | |
| Apr 30 at 7:50 | comment | added | cknoll | Thank you. I corrected the question. | |
| Apr 29 at 20:57 | history | edited | cknoll | CC BY-SA 4.0 |
correct the number of parameters in q
|
| Apr 29 at 12:54 | comment | added | Alexandre Eremenko | Your count of parameters is incorrect: a polynomial of degree $N$ depends on $(N+1)(N+2)/2$ parameters. | |
| Apr 29 at 7:20 | comment | added | cknoll | I added this to the question: $N$ can be choosen arbitrarily. In general $\mathbf q$ contains $2(N+1)$ free parameters and the $n$ given points together pose $2n$ conditions. Thus I would suppose that $(N+1) \geq 2n$ is a condition for solvability. But there might be additional constraints come into play to ensure that the curve is closed (may be better formulated: has at least one closed branch). | |
| Apr 29 at 7:19 | history | edited | cknoll | CC BY-SA 4.0 |
Added paragraph about the relation between N and n
|
| Apr 29 at 4:07 | comment | added | Gerry Myerson | Is there any relation between $n$ and $N$? | |
| Apr 28 at 17:36 | history | asked | cknoll | CC BY-SA 4.0 |