visualization

hi everybody,

finally, i'm finishing my master thesis on Geocluster, a Drupal 7 module that aims at enabling scalable maps with more than 1,000,000 items or nodes by clustering based on Geohash with MySQL or Apache Solr.

you can go ahead to the module page to check out the module and see if it fits your requirements
http://drupal.org/project/geocluster

in addition, here's the link to the final draft of my master thesis on Geocluster
http://dasjo.at/files/thesis-dabernig.pdf

also check out the poster as a visual summary of Geocluster and the thesis

Visualize is a Views style plug-in for implementing the jQuery Visualize charting tool.

jQuery Visualize provides accessible charts providing textual information to non-visual users.
It uses a technique with JavaScript to scrape data from an HTML table and generate charts using the HTML 5 Canvas element.

Try out a demo: http://lakeandweb.com/visualize/

Hey, I've set up a data pipe from Drupal to Flex/Flare using jQuery. Its as easy as this:

1. IN DRUPAL TEMPLATE.PHP
   function phptemplate_views_view_list_{viewname}($view, $nodes, $type) {
   foreach ($nodes as $i => $nid) {
   $node = node_load($nid->nid);
   $output[]= json_encode($node);
   }
   return 'var videos=['.implode(',',$output).']';
   }

2. IN THE HTML-TEMPLATE

<

script type="text/javascript">
function getData(){
$.getScript("http://example.com/view", function(){
/*$(videos).each(function(i){

Just stumbled upon this post on Mashable: http://mashable.com/2007/05/15/16-awesome-data-visualization-tools/

Several good ideas what could be implemented in Drupal on the field of visualization. With open formats like SVG there is no stopping us :)

with lots of graphs - I would like to know which graphing library you are planning to use and how you think you will interface it.

-alex

Currently my problem is to find a good algorithm to visualize a tree. The problem is:

• determine each point's coordinates - find a layout
• draw the layout

This tree is not weighted, directed one - breadth-first search output for example. The second point is very obvious. The first one is not easy, especially for very big trees (~3000 points)