Smashing Peacocks Further: Drawing Quasi-Trees From Biconnected Components @TamaraMunzner
Smashing Peacocks Further: Drawing Quasi-Trees From Biconnected Components  @TamaraMunzner
Uploaded March 2014 | Updated November 2026, 3 days ago
cs.ubc.ca/labs/imager/tr/2006/Archambault_SPF_InfoVis2006
Two-level approach to drawing complex graphs where an area-aware version of the RINGS tree drawing algorithm is used to show the high-level structure, and the force-directed LGL approach is used to show the low-level structure. Companion video to InfoVis 2006 paper by Archambault, Auber, and Munzner.
Smashing Peacocks Further: Drawing Quasi-Trees From Biconnected ComponentsData Abstraction (Ch 2), Visualization Analysis & Design, 2021Revised: Marks and Channels (Ch 5), Visualization Analysis & Design, Jan 2025.1991 Summer Student Compilation (Geometry Center). Mangled audio.Algorithm animations. George Havas. (Geometry Center)Data-First Design Studies, video talk (BELIV 2020)My time at the Geometry Center, Chaim Goodman-Strauss, Aug 14, 1995.Layout/Tables II Lecture, Sep 2026.Animated Geometry III: 1994 Undergraduate Summer Institute VideosNetworks & Trees (CPSC 436V: InfoVis, Jan 2021)Networks Lecture, Jan 2026.Rules of Thumb (CPSC 436V: InfoVis, Jan 2021)
Tamara Munzner |

Smashing Peacocks Further: Drawing Quasi-Trees From Biconnected Components

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER