Displaying arbitrary relationships in a tree-map visualization

Computer graphics processing and selective visual display system – Computer graphics processing – Graph generating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C345S440200, C715S853000, C715S854000, C715S855000

Reexamination Certificate

active

07605813

ABSTRACT:
A treemap visualization system can include a treemap configured to visualize a set of nodes. The treemap visualization system also can include an event handler programmed to process a proximity event associated with a specific portion of the treemap. The event handler can process the proximity event by visually coupling selected nodes which are inter-related to a node associated with the proximity event. The system further can include logic for displaying a direction for each inter-relationship between the selected nodes and the node associated with the proximity event. In this regard, the proximity event can include a mouse-over event, a mouse-click event, and a keyboard selection event.

REFERENCES:
patent: 5619632 (1997-04-01), Lamping et al.
patent: 5903870 (1999-05-01), Kaufman
patent: 5926180 (1999-07-01), Shimamura
patent: 5974384 (1999-10-01), Yasuda
patent: 6057843 (2000-05-01), Van Overveld et al.
patent: 6212548 (2001-04-01), DeSimone et al.
patent: 6259458 (2001-07-01), Theisen et al.
patent: 6271841 (2001-08-01), Tsujimoto
patent: 6301579 (2001-10-01), Becker
patent: 6304260 (2001-10-01), Wills
patent: 6496842 (2002-12-01), Lyness
patent: 6509898 (2003-01-01), Chi et al.
patent: 6774911 (2004-08-01), Hodgson et al.
patent: 6810516 (2004-10-01), Lauris
patent: 6829615 (2004-12-01), Schirmer et al.
patent: 6952688 (2005-10-01), Goldman et al.
patent: 6983288 (2006-01-01), Kirkwood et al.
patent: 7039642 (2006-05-01), Horvitz et al.
patent: 7139973 (2006-11-01), Kirkwood et al.
patent: 7346622 (2008-03-01), Horvitz et al.
patent: 2002/0118214 (2002-08-01), Card et al.
patent: 2002/0154171 (2002-10-01), Lee et al.
patent: 2003/0050906 (2003-03-01), Clifton-Bligh
patent: 2003/0131007 (2003-07-01), Schirmer et al.
patent: 2004/0168115 (2004-08-01), Bauernschmidt et al.
patent: 2004/0212615 (2004-10-01), Uthe
patent: 2005/0165766 (2005-07-01), Szabo
patent: 2006/0044307 (2006-03-01), Song
Cushion treemaps: visualization of hierarchical information Van Wijk, J.J.; Van de Wetering, H.; Information Visualization, 1999. (Info Vis '99) Proceedings. 1999 IEEE Symposium on Oct. 24-29, 1999 pp. 73-78, 147 Digital Object Identifier 10.1109/INFVIS.1999.801860.
Using a multiple view system in a virtual environment to explore and interpret communication data sets André Hinkenjann Nov. 2001 AFRIGRAPH '01: Proceedings of the 1st international conference on Computer graphics, virtual reality and visualisation.
Simon Urbanek; Many Faces of a Tree; Mar. 14, 2003; Interface 2003: Security and Infrastructure Protection, 35th Symposium on the Interface, Salt Lake City, Utah ,Mar. 12-15, 2003, pp. 1-9.
Bill Kules, Ben Shneiderman and Catherine Plaisant; Data Exploration with Paired Hierarchical Visualizations: Initial Designs of PairTrees; May 18-21, 2003; Proceedings of the 2003 annual national conference on Digital government research, Boston, MA Source ACM International Conference Proceeding Series; vol. 130; pp. 1-6.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Displaying arbitrary relationships in a tree-map visualization does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Displaying arbitrary relationships in a tree-map visualization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Displaying arbitrary relationships in a tree-map visualization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4120546

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.