Timeline for Extremal curves with a "should pass through" constraint
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 24 at 8:54 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken bit.ly link
|
| Apr 24 at 7:52 | review | Suggested edits | |||
| S Apr 24 at 8:54 | |||||
| Dec 3, 2013 at 13:56 | comment | added | Ricardo Andrade | Dear @Ganesh: Please avoid using link shorteners as they aid link-rot and prevent people from seeing the destination of the link. | |
| Jul 28, 2012 at 15:38 | answer | added | Will Sawin | timeline score: 1 | |
| Apr 7, 2012 at 7:55 | history | edited | Ganesh | CC BY-SA 3.0 |
added 3 characters in body
|
| Apr 7, 2012 at 7:45 | history | edited | Ganesh | CC BY-SA 3.0 |
added 1240 characters in body
|
| Mar 24, 2011 at 11:56 | comment | added | fedja | @Ganesh: Of course, but you have either to choose one or the other, or to tell exactly how you weigh the two. You cannot have them at their minima simultaneously. | |
| Mar 24, 2011 at 6:42 | vote | accept | Ganesh | ||
| Apr 7, 2012 at 7:30 | |||||
| Mar 19, 2011 at 15:20 | answer | added | Spencer | timeline score: 1 | |
| Mar 19, 2011 at 1:04 | comment | added | user9072 | I deleted my first comment; sorry, I did not get that you were only interested in the formulation. | |
| Mar 19, 2011 at 0:50 | comment | added | Ganesh | @ fedja: Won't the huge "almost circles" [ whatever that might be] lead to a big increase in length? | |
| Mar 19, 2011 at 0:49 | history | edited | Ganesh | CC BY-SA 2.5 |
added 2 characters in body
|
| Mar 19, 2011 at 0:47 | comment | added | Ganesh | Right, from a programmer's perspective it's a dynamic programming problem. However, I'm more interested in the <i>formulation </i> of the problem, and trying to extend this to functionals that may not be possibly additive. | |
| Mar 19, 2011 at 0:44 | comment | added | fedja | The second (curvature) version of your problem on SE hardly makes sense without additional restrictions: just go in huge "almost circles" swooping one point a time. The first one is the classical traveling salesman problem on the plane. It is easier than the general version but still hard to solve exactly. Look up "Barvinok"+"traveling salesman"+"Euclidean" on Google or ArXiV for approximate polynomial time solutions. | |
| Mar 19, 2011 at 0:44 | history | edited | Ganesh | CC BY-SA 2.5 |
added 573 characters in body
|
| Mar 18, 2011 at 23:44 | history | edited | Ganesh | CC BY-SA 2.5 |
added 11 characters in body
|
| Mar 18, 2011 at 23:38 | history | asked | Ganesh | CC BY-SA 2.5 |