“Here & There is a project by S&W exploring speculative projections of dense cities. These maps of Manhattan look uptown from 3rd and 7th, and downtown from 3rd and 35th. They’re intended to be seen at those same places, putting the viewer simultaneously above the city and in it where she stands, both looking down and looking forward.”
“For a long time now I have been a great admirer of Matthew Hurst’s work and I’m continuously impressed by the works posted at visualcomplexity.com. So I decided it was time for me to try something like this myself.
What I did is write a program that is able to log in to a very popular German Social Networking website and grab some data from it. I grabbed the friends of my profile (only 2) their friends (about 100) and the friends of their friends (about 5000). I used PHP with cURL for that and saved the data to a MySQL database.
At its core, the Visual Understanding Environment (VUE) is a concept and content mapping application, developed to support teaching, learning and research and for anyone who needs to organize, contextualize, and access digital information. Using a simple set of tools and a basic visual grammar consisting of nodes and links, faculty and students can map relationships between concepts, ideas and digital content.
History Flow is a tool for visualizing dynamic, evolving documents and the interactions of multiple collaborating authors. In its current implementation, history flow is being used to visualize the evolutionary history of wiki* pages on Wikipedia.
Twitter Spectrum is an application that is built with Processing and shows the conjunction of two words on Twitter. As Jeff states, “I’ve slightly improved the Twitter Spectrum application so that clicking on words used in conjunction with both terms properly use OR in the query. I also changed the default search terms to ‘from:jasoncalacanis’ and ‘from:scobleizer’ to show how you can compare the tweets from two users rather than related to two terms.”
“Wordle is a toy for generating word clouds from text that you provide. The clouds give greater prominence to words that appear more frequently in the source text. You can tweak your clouds with different fonts, layouts, and color schemes. The images you create with Wordle are yours to use however you like. You can print them out, or save them to the Wordle gallery to share with your friends.”
“The Linux kernel is one of most complex open source project. There is a lot of books, however it is still a difficult subject to comprehend. The Interactive Linux kernel map gives you top-down view to the kernel. You could see most important layers, functionalities, modules, functions and calls. Each function on the map is hypertext link to source code. The map is interactive. You can zoom in and drag around to see details.”
“LastGraph is a web-based service that aims to give you a new way to explore your last.fm listening history. We use the last.fm API to transfer across your basic profile data, and then crunch it around in various interesting (and often hilariously inefficient) ways.The site is written and run by Andrew Godwin, with a large amount of rendering power generously donated by State51.”
This is a fairly long list of visualizations produced by Chris Harrison. Chris is a doctoral student in the Human-Computer Interaction Institute at Carnegie Mellon University. The data sets span a wide range of sources including, digg, colors amazon, wikipedia and trends. If you have some time on your hands check out these great visualizations. They all have complete descriptions and screenshots. Thanks Chris!
“Graph visualization is a way to discover and visualize structures in complex relations. What sort of structures are people who do large scale computation studying? We can get a glimpse by visualizing the thousands of sparse matrices submitted to the University of Florida Sparse Matrix collection. The resulting gallery contains the drawing of graphs as represented by 1890 sparse matrices in this collection. Each of these sparse matrices (for rectangular matrix, an augmented matrix is formed first) is viewed as the adjacency matrix of an undirected graph, and is laid out by a multilevel graph drawing algorithm.”