CHI-ANNOUNCEMENTS Archives

ACM SIGCHI General Interest Announcements (Mailing List)

CHI-ANNOUNCEMENTS@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
From:
"Shneiderman, Ben" <[log in to unmask]>
Reply To:
Shneiderman, Ben
Date:
Thu, 13 Jun 2002 09:17:43 -0400
Content-Type:
text/plain
Parts/Attachments:
text/plain (30 lines)
               *** Treemap 3.2 ***
  Now available free for personal/educational use

      Human-Computer Interaction Laboratory
             University of Maryland

Treemaps are a space-filling visualization for hierarchical structures that are
extremely effective in showing attributes of leaf nodes by size and color
coding.  Treemaps enable users to compare sizes of nodes and of sub-trees, and
are especially strong in spotting unusual patterns.  They were developed by Ben
Shneiderman and colleagues at the Human-Computer Interaction Laboratory (HCIL)
of the University of Maryland, during the 1990s.  A review of treemaps and their
growing set of applications appears at: http://www.cs.umd.edu/hcil/treemaps/
Treemaps are a continuing topic of research and application at the HCIL.

Our improved Java version, Treemap 3.2, includes dynamic query filters, and
three treemap layout algorithms:
  -- slice-and-dice (original format. sorted order, but thin rectangles)
  -- squarified (square aspect ratios, but unsorted)
  -- strip (mostly square AND sorted).

Treemap 3.2 runs as a stand alone executable or could be turned into Java
applet.  It also maps your hard drive directories to help you clean cluttered
disks.  Free download and information at:
  http://www.cs.umd.edu/hcil/treemap3

Treemap 3.2 is available free for personal/educational use.  For commercial
licensing please contact: James A. Poulos, Univ. of Maryland Office of
Technology Commercialization, [log in to unmask]

ATOM RSS1 RSS2