Timeline for Graphs with dangling edges
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2014 at 23:27 | comment | added | Mirco A. Mannucci | Your suggestion is simple but perhaps promising: one "completes" the graph adding the generic node, say N0. Even with types one can handle the extra-complexity: for instance by saying this: if first edge from node N1 has type T1 and second edge from node N2 has type T2 and T1 is compatible with T2, we close the triangle (N1, N0, N2) by adding a real edge from N1 to N2. Good material for thought... | |
| Feb 21, 2014 at 22:10 | comment | added | Arno | I've edited my answer to clarify. Whatever type a "halfedge" would carry can be attached to the "virtual" vertex you are inserting to complete it. Only if "completed edges" still need to carry different types it becomes more complicated. | |
| Feb 21, 2014 at 22:08 | history | edited | Arno | CC BY-SA 3.0 |
tried to clarify a point
|
| Feb 21, 2014 at 18:02 | comment | added | Alex Degtyarev | Probably, this discussion is meaningless unless we know what you need. In my opinion, a graph is a certain combinatorial structure that can be studied by means of geometric intuition: this is the power of the approach. One can change the combinatorics any way one likes, but then there's no need to call it a graph :) Back to the scarce hints you've given, for you an edge is a pair of pointers. Then, just say that one or both of them may be $\mathrm{nil}$. The closest mathematical analogy seems introducing a dummy vertex (at address $0$) and attaching all hanging edges to it. | |
| Feb 21, 2014 at 17:21 | comment | added | Mirco A. Mannucci | Hmmmm, I just gave you my point fro your answer (gotta start somewhere), but I have my reservations on your proposals: you are modeling some "data structure" where the nodes carry the type, but what I am after is instead a edge type. They are not the same thing: nodes may perhaps be "the same thing" (ie have the same universal type, but they may protrude different types of edges (think of those edges as sensors). Depending on the edge type they have protruded, they may match or may not. This is the scenario I have in mind.... | |
| Feb 21, 2014 at 17:17 | history | answered | Arno | CC BY-SA 3.0 |