Timeline for Adding geometrical boundary edges to a graph or closing the embedding of a graph
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2020 at 12:58 | comment | added | sam wolfe | Thank you! I'm almost done, now I'm just getting a bit of a problem getting KVertexConnectedGraphQ[g, 2] = True. Though the graphs are merged, I still have degree-1 vertices, which I don't want. | |
| Mar 17, 2020 at 9:42 | comment | added | Szabolcs | @samwolfe You got your answer from kglr. I would have likely come up with something very similar. | |
| Mar 16, 2020 at 21:01 | comment | added | Szabolcs | I will, tomorrow. Sorry, too tired. | |
| Mar 16, 2020 at 20:55 | comment | added | sam wolfe | Please look at Edit 2. I managed to get what I wanted, now I simply need to join the two graphs. | |
| Mar 16, 2020 at 20:47 | comment | added | Szabolcs | No. As I said, it's a geometrical operation. If you post sample data, I will show you how to do it, and actually augment a Graph with new edges. | |
| Mar 16, 2020 at 20:24 | comment | added | sam wolfe | Yes, I figured out that could be the way to go (see edit). But can I apply the ConvexHullMesh to a graph? | |
| Mar 16, 2020 at 20:23 | history | answered | Szabolcs | CC BY-SA 4.0 |