midterm idea - treemap-revised
Tuesday, March 4th, 2008My ‘plan’ was to concentrate more on finding ways to acquire text data from URL by using of XML. But I found it more difficult that I thought it would be, decided that I would pursuit that later on my final, not midterm.
The main idea is to subdivide 2D space to show the relative frequency of each word(from .txt file)in mapping of tree structures.
The code was built mainly from Visualizing Data (Ben Fry, O’reilly) Ch. 7 -Trees, Hierarchies, and Recursion, then I modified it to ‘my version’ of it.
After several trials of modifying the last code for midterm, I came up with some results with slightly different visuals.
Each sample shows different stroke and ellipse size. First three examples are from the same text file from the book-Mark Twain’s Following the Equator, depicting word usage in the book, and forth one’s visuals created from Korean-English dictionary from The Project Gutenberg. The fifth one shows the word usage in The War of the Worlds by H.G.Wells.
Since the text is only drawn if the size of the text is smaller than that of ellipse, for many times it shows ‘blank’ ellipses.
Follow-ups : After in-class presentation, I got lots of helpful feedback both from Dannie and classmates. Among those, I sorted out some very important opinions.
- The sequence of how those ellipses form in visual - For now, it is procedural, my processing code doesn’t contain ‘random’ value. Next time, I should think about how I ‘intentionally’ form whole fragments in visual more successfully.
- Using more dynamic data - Absolutely. This should be my goal for final project. Parsing data from XML should be studied. In fact, one of my classmates showed us the perfect example that I can refer to. Stored text data makes the visual very static.
- Make the visual less ‘arbitrary - Current code is done not by means of any underlying principle or logic, but by whim or some decidedly illogical formula. Using ‘baysean filter’ to build more logic first, then come up with better solution.
Source code here
























