Timeline for Constructing a graph that approximates a sphere using rotationally symmetric building blocks with equal numbers of edges
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 17, 2011 at 21:16 | vote | accept | FireAndCoffee | ||
Jul 16, 2011 at 14:45 | history | edited | FireAndCoffee | CC BY-SA 3.0 |
added 147 characters in body; edited title; added 13 characters in body
|
Jul 16, 2011 at 14:27 | history | edited | FireAndCoffee | CC BY-SA 3.0 |
Please see the "update"
|
Jul 16, 2011 at 12:03 | answer | added | André Henriques | timeline score: 2 | |
Jul 16, 2011 at 5:57 | comment | added | FireAndCoffee | @Will, and thanks for reading my question! | |
Jul 16, 2011 at 5:55 | comment | added | FireAndCoffee | @Will Jagy, I added a further constraint that all edge lengths should be equal. Shouldn't there be a fixed value for theta(interior) that allows the formation of a N-gon approximating a sphere without gaps? | |
Jul 16, 2011 at 5:53 | history | edited | FireAndCoffee | CC BY-SA 3.0 |
Fixed all edge lengths at some value L
|
Jul 16, 2011 at 4:41 | comment | added | Will Jagy | Look, who says what is allowed, what symmetries must be exhibited? | |
Jul 16, 2011 at 2:44 | history | asked | FireAndCoffee | CC BY-SA 3.0 |