Skip to main content

graphics - How can I sequentially apply different graph embeddings?


Imagine I have some graph G, and I perform a graph embedding using a command like:


G = Graph[GraphEdges, GraphLayout -> {"SpringElectricalEmbedding"}]

I then want to apply a "GridEmbedding" to the post-Spring/Electrical embedded graph.


How can I do this?


Specifically, I have a graph I know to be a rectangular lattice, but the vertices are at random positions initially. Attempting a direct "GridEmbedding" yields junk; however the "SpringElectricalEmbedding" almost works, but begins to fail around the edges of the graph. Does anyone have advice for dealing with this?


Alternatively, can "GridEmbedding" be made to respect edge lengths / weights akin to what is possible for "SpringElectricalEmbedding"?




Answer



Here's the one way:


g = Graph[RandomSample[EdgeList[GridGraph[{10, 12}]], 218], 
      GraphLayout -> {"GridEmbedding", "Dimension" -> {10, 12}}]

enter image description here


Apply SpringElectricalEmbedding to see how it work:


SetProperty[g, GraphLayout -> "SpringElectricalEmbedding"]

enter image description here



Since you know your graph is rectangular, you can pick four corners by checking vertex degree.


In[356]:= corners = VertexList[g, x_ /; VertexDegree[g, x] == 2]
Out[356]= {111, 120, 10, 1}

Get possible tuples of corners:


In[357]:= tuples = Subsets[corners, {2}]
Out[357]= {{111, 120}, {111, 10}, {111, 1}, {120, 10}, {120, 1}, {10, 1}}

Generate shortest path function for further computation:


shortpath = FindShortestPath[g];


By checking lengths of paths between corners, you could find two boundary paths:


In[359]:= bound = shortpath @@@ tuples;
          {m, n} = Most[Sort[Union[Length /@ bound]]];
           paths = Select[bound, Length[#] == m &]
Out[361]= {{111, 112, 113, 114, 115, 116, 117, 118, 119, 120}, {10, 9,
           8, 7, 6, 5, 4, 3, 2, 1}}

Compute grids of vertex indices:


pairs = If[Length[shortpath[paths[[1, 1]], paths[[2, 1]]]] == n,

   Transpose[paths], paths[[1]] = Reverse[paths[[1]]]; 
   Transpose[paths]];
grids = (VertexIndex[g, #] & /@ shortpath[##]) & @@@ pairs;

Compute coordinates using "SpringElectricalEmbedding":


coords = GraphEmbedding[g, "SpringElectricalEmbedding"];

Now straighten coords by the mean of each grid lines:


Table[coords[[i, 2]] = Mean[coords[[i, 2]]];, {i, grids}];
 Table[

coords[[i, 1]] = Mean[coords[[i, 1]]];, {i, Transpose[grids]}];

Here's the results:


SetProperty[g, VertexCoordinates -> coords]

enter image description here


You could make function to do all steps:


gridCoordinates[g_] :=
   Block[{coords, corners, tuples, shortpath, bound, m, n, paths, pairs,
     grids},

    coords = GraphEmbedding[g, "SpringElectricalEmbedding"];
    corners = VertexList[g, x_ /; VertexDegree[g, x] == 2];
    tuples = Subsets[corners, {2}];
    shortpath = FindShortestPath[g];
    bound = shortpath @@@ tuples;
    {m, n} = Most[Sort[Union[Length /@ bound]]];
    paths = Select[bound, Length[#] == m &];
    pairs = If[Length[shortpath[paths[[1, 1]], paths[[2, 1]]]] == n,
              Transpose[paths], paths[[1]] = Reverse[paths[[1]]]; 
              Transpose[paths]];

    grids = (VertexIndex[g, #] & /@ shortpath[##]) & @@@ pairs;
    Table[coords[[i, 2]] = Mean[coords[[i, 2]]];, {i, grids}];
    Table[coords[[i, 1]] = Mean[coords[[i, 1]]];, {i, Transpose[grids]}];
    coords
   ]

Here's the version that generate coordinate on unit grid:


  gridUnitCoordinates[g_] :=
   Block[{coords, corners, tuples, shortpath, bound, m, n, paths, pairs,
     grids},

    corners = VertexList[g, x_ /; VertexDegree[g, x] == 2];
    tuples = Subsets[corners, {2}];
    shortpath = FindShortestPath[g];
    bound = shortpath @@@ tuples;
    {m, n} = Most[Sort[Union[Length /@ bound]]];
    paths = Select[bound, Length[#] == m &];
    pairs = If[Length[shortpath[paths[[1, 1]], paths[[2, 1]]]] == n,
              Transpose[paths], paths[[1]] = Reverse[paths[[1]]]; 
              Transpose[paths]];
    grids = (VertexIndex[g, #] & /@ shortpath[##]) & @@@ pairs;

    {m, n} = Dimensions[grids];
    coords = Flatten[Table[{j, i}, {i, m}, {j, n}], 1];
    coords[[Ordering[Flatten[grids]]]]
   ]

Comments

Post a Comment

Popular posts from this blog

plotting - Filling between two spheres in SphericalPlot3D

Manipulate[ SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, Mesh -> None, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], {n, 0, 1}] I cant' seem to be able to make a filling between two spheres. I've already tried the obvious Filling -> {1 -> {2}} but Mathematica doesn't seem to like that option. Is there any easy way around this or ... Answer There is no built-in filling in SphericalPlot3D . One option is to use ParametricPlot3D to draw the surfaces between the two shells: Manipulate[ Show[SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], ParametricPlot3D[{ r {Sin[t] Cos[1.5 Pi], Sin[t] Sin[1.5 Pi], Cos[t]}, r {Sin[t] Cos[0 Pi], Sin[t] Sin[0 Pi], Cos[t]}}, {r, 1, 2 - n}, {t, 0, Pi}, PlotStyle -> Yellow, Mesh -> {2, 15}]], {n, 0, 1}]
Post a Comment
Read more

plotting - Plot 4D data with color as 4th dimension

I have a list of 4D data (x position, y position, amplitude, wavelength). I want to plot x, y, and amplitude on a 3D plot and have the color of the points correspond to the wavelength. I have seen many examples using functions to define color but my wavelength cannot be expressed by an analytic function. Is there a simple way to do this? Answer Here a another possible way to visualize 4D data: data = Flatten[Table[{x, y, x^2 + y^2, Sin[x - y]}, {x, -Pi, Pi,Pi/10}, {y,-Pi,Pi, Pi/10}], 1]; You can use the function Point along with VertexColors . Now the points are places using the first three elements and the color is determined by the fourth. In this case I used Hue, but you can use whatever you prefer. Graphics3D[ Point[data[[All, 1 ;; 3]], VertexColors -> Hue /@ data[[All, 4]]], Axes -> True, BoxRatios -> {1, 1, 1/GoldenRatio}]
Post a Comment
Read more

plotting - Mathematica: 3D plot based on combined 2D graphs

I have several sigmoidal fits to 3 different datasets, with mean fit predictions plus the 95% confidence limits (not symmetrical around the mean) and the actual data. I would now like to show these different 2D plots projected in 3D as in but then using proper perspective. In the link here they give some solutions to combine the plots using isometric perspective, but I would like to use proper 3 point perspective. Any thoughts? Also any way to show the mean points per time point for each series plus or minus the standard error on the mean would be cool too, either using points+vertical bars, or using spheres plus tubes. Below are some test data and the fit function I am using. Note that I am working on a logit(proportion) scale and that the final vertical scale is Log10(percentage). (* some test data *) data = Table[Null, {i, 4}]; data[[1]] = {{1, -5.8}, {2, -5.4}, {3, -0.8}, {4, -0.2}, {5, 4.6}, {1, -6.4}, {2, -5.6}, {3, -0.7}, {4, 0.04}, {5, 1.0}, {1, -6.8}, {2, -4.7}, {3, -1.
Post a Comment
Read more