Timeline for Finding all faces in a wireframe mesh
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 1, 2016 at 7:55 | comment | added | Mario Cervera | Nice analysis. Note that, if we only consider "external faces", the reduction to finding chordless cycles should work. When reducing one problem to another, sometimes the original input cannot be used as is (that is, it requires some kind of pre-processing). Then, we can solve the probem using the modified input, and, finally, post-process the result to obtain a solution to the original problem. In your wireframe mesh problem, the original 3D object must be "unfolded". This way we obtain a 2D object (represented as a planar graph) with some vertices of the original object duplicated. | |
| Aug 31, 2016 at 22:36 | history | edited | hgs3 | CC BY-SA 3.0 |
Spelling.
|
| Aug 31, 2016 at 22:29 | history | answered | hgs3 | CC BY-SA 3.0 |