Timeline for Reporting all faces in a planar graph
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 1, 2022 at 16:27 | comment | added | Onye | Nice. Thanks for this. | |
| Sep 15, 2020 at 7:48 | comment | added | Erik Brendel | Can you give an example of a "standard general-purpose algorithm for computing planar subdivisions"? I do not know what you mean by that. | |
| Mar 17, 2017 at 23:24 | comment | added | Boris Dalstein | I do have Computational Geometry: Algorithms and Applications in front of me and I can confirm that it is covered. The most relevant section is 2.3 Computing the Overlay of Two Subdivisions, and the most relevant pages are p36-37. The book is extremely well written and informative, if you need to solve the problem of the OP, it is highly worth buying. | |
| May 8, 2010 at 22:42 | vote | accept | Icemanxp | ||
| May 8, 2010 at 20:07 | history | answered | Darsh Ranjan | CC BY-SA 2.5 |