Timeline for Generating random polygons from a given triangulation of points
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 5, 2010 at 19:14 | comment | added | katsarola | Thank you for the comment. There are 3-connected triangulations which are also hamiltonian, so by checking 4-connectivity I might miss possible solutions. Also I would like to avoid to triangulate under the 4-connectivity constraint for the same reason. | |
| Sep 4, 2010 at 23:07 | comment | added | Joseph O'Rourke | This is a tangential remark: Tutte proved that every 4-connected planar graph has a Hamiltonian circuit. So if you could ensure 4-connectivity, you would have that guarantee. | |
| Sep 4, 2010 at 17:51 | history | edited | katsarola | CC BY-SA 2.5 |
added 5 characters in body
|
| Sep 4, 2010 at 14:11 | history | asked | katsarola | CC BY-SA 2.5 |