Timeline for Cubic curve closest to the given set of points
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2023 at 15:03 | history | edited | LSpice | CC BY-SA 4.0 |
Capitalise title, and minor proofreading, while this is on the front page
|
| Apr 25, 2023 at 9:19 | answer | added | Iddo Hanniel | timeline score: 3 | |
| Apr 8, 2011 at 13:58 | comment | added | Michael Lugo | fedja, that's a good point. Like I said, I didn't actually do the algebra. | |
| Apr 7, 2011 at 17:57 | comment | added | fedja | Honestly, I do not see how the LSM works here because, unlike the distance to the line, the (signed) distance to the curve is not linear in the parameters (actually, it has no nice explicit formula whatsoever). I wonder if there is some convexity in the problem that would ensure at least that the local minimizer is unique. Then the gradient descend method has a chance to work :) | |
| Apr 7, 2011 at 16:18 | comment | added | isnmr | LMC will work, but it minimizes slightly different thing, namely the sum of squares of distances between points of S and some specific knots (each for every point of S) on the curve. For programming purposes this is enough, of course. | |
| Apr 7, 2011 at 15:58 | comment | added | Michael Lugo | You probably want to work with the sum of squares of distances. Then standard least-squares methods should work. But I haven't actually done the algebra. | |
| Apr 7, 2011 at 15:34 | history | asked | isnmr | CC BY-SA 2.5 |