View allAll Photos Tagged graphity
Usually I would look at a line graph and think mountains; now I actually see them.
-sharpie marker, pencil & watercolor
A graph that demonstrates the answer to a survey question about when participants last had a blood test.
Data produced by Sheffield Corporation in 1963.
Presented by JR James in a lecture at the Department of Town and Regional Planning at The University of Sheffield between 1967 and 1978.
My overall weight loss was more or less static over the last week. Well, I am down about another 5 lbs from my high since the last graph, but as you can see had a major spike up during this week. I was eating the same (or better) during this time, and was exercising faithfully (average 30 minutes stationary or outdoor bike per day). My best guess is when I took some allergy pills early in the week (which mention "weight gain" as a side effect) that it caused me to gain or retain. Since I stopped taking them (Wednesday), my weight resumed its downward march.
I am glad the overall trend line still looks more or less the same, even accounting for this variation. Hopefully, next week will be better... or smoother, graph wise anyway. :-)
Now a feature in Integrity 3.7.2 - I added colour before releasing the new version (the colour indicates distance from home)
Alistair will give an overview of the techniques and technologies for visualising graph data, and explain where these work well for different types of problem. Graph databases help you to express the connections in your data. Simply by visualising those connections, you have a simple analysis tool, and a compelling user interface.
See the skillscast (film/code/slides) at skillsmatter.com/skillscasts/5095-seeing-patterns-in-your...
A pattern made from graph paper, using the 6 colors of the rainbow in a continuous sequence to form a design.
In weaving we are constantly dealing with a family of four graphs that are readily interconverted: a triangulation, a cubic graph, a medial graph, and a radial graph.
An orthogonal projection vertex-edge frame of the 8-cube, drawn from a diagonal perspective, so the edge path distance from one node to all others are grouped into columns.
There's 256 vertices and 1024 edges in this graph.
The number of nodes by column are the 8th row of Pascal's triangle:
1 8 28 56 70 56 28 8 1
The nodes are colored by frequency, red as one, orange as two, etc.
See also: