Timeline for Reconstructing a curve in $S^2$ from intersections with great circles
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 21, 2018 at 17:51 | vote | accept | guest_1213 | ||
Oct 21, 2018 at 14:31 | comment | added | Ben McKay | The relevant Crofton formula (computed with multiplicity, but without sign) is explained very clearly in Alvarez Paiva, Fernandez, 2007, Gelfand transforms and Crofton formulas: the length of a curve is its average number of intersections with circles, for a suitable constant multiple of the invariant density on the space of circles. | |
Oct 21, 2018 at 13:45 | answer | added | Alexandre Eremenko | timeline score: 2 | |
Oct 21, 2018 at 13:39 | comment | added | Alexandre Eremenko | How exactly do you count intersections? With sign or without? How do you count tangency? | |
Oct 21, 2018 at 9:38 | history | edited | Ivan Izmestiev |
edited tags
|
|
Oct 21, 2018 at 9:24 | answer | added | Ivan Izmestiev | timeline score: 2 | |
Oct 21, 2018 at 9:14 | history | edited | Ivan Izmestiev |
edited tags
|
|
Oct 20, 2018 at 21:04 | answer | added | Ben McKay | timeline score: 1 | |
Oct 20, 2018 at 20:10 | review | First posts | |||
Oct 20, 2018 at 21:03 | |||||
Oct 20, 2018 at 20:05 | history | asked | guest_1213 | CC BY-SA 4.0 |