Timeline for How to do a clockwise ordering of a planar graph in order to define its faces?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2016 at 15:33 | history | edited | Yann Bouteiller | CC BY-SA 3.0 |
[Edit removed during grace period]
|
| May 14, 2016 at 0:12 | comment | added | Robert Israel | Who are "they"? | |
| May 13, 2016 at 23:43 | answer | added | Brendan McKay | timeline score: 1 | |
| May 13, 2016 at 19:13 | comment | added | Yann Bouteiller | Yes, the problem is, they ask for a triangulation. (Or at least a 3-connected graph even though I don't know yet how this helps at all for Tutte embeddings). But thank you for the paper, I'll read it. | |
| May 13, 2016 at 19:07 | comment | added | Tony Huynh | If all you care about is finding a Tutte embedding, then there are direct algorithms to do this. For example, see math.uwaterloo.ca/~jfgeelen/Publications/tutte.pdf | |
| May 13, 2016 at 18:56 | history | edited | Yann Bouteiller | CC BY-SA 3.0 |
added 250 characters in body
|
| May 13, 2016 at 18:38 | answer | added | Tony Huynh | timeline score: 1 | |
| May 13, 2016 at 18:30 | history | edited | Yann Bouteiller | CC BY-SA 3.0 |
spelling
|
| May 13, 2016 at 17:40 | answer | added | Joseph O'Rourke | timeline score: 0 | |
| May 13, 2016 at 17:00 | review | First posts | |||
| May 13, 2016 at 17:07 | |||||
| May 13, 2016 at 16:57 | history | asked | Yann Bouteiller | CC BY-SA 3.0 |