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
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2016 at 18:52 | comment | added | Yann Bouteiller | (a triangulation defines one only embedding, an embedding can lead to several triangulations) | |
| May 13, 2016 at 18:48 | comment | added | Yann Bouteiller | Yes but it would be quite stupid because I have to deduce the embedding from the triangulation, and not the triangulation from the embedding. | |
| May 13, 2016 at 18:47 | comment | added | Tony Huynh | Once you have an embedding, it is easy to triangulate the graph. | |
| May 13, 2016 at 18:45 | comment | added | Yann Bouteiller | I know, but that is not what I want to do. I want to triangulate the graph (any triangulation will do, it only has to keep the planarity of the graph) | |
| May 13, 2016 at 18:45 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 140 characters in body
|
| May 13, 2016 at 18:38 | history | answered | Tony Huynh | CC BY-SA 3.0 |