Hierarchical data visualization using a fast rectangle-packing algorithm

Area of Science:

• Computer Science
• Information Visualization
• Human-Computer Interaction

Background:

• Effective visualization of large-scale hierarchical data remains a challenge.
• Existing methods often struggle to provide comprehensive overviews within a single display space.

Purpose of the Study:

• To present a new technique for representing large-scale hierarchical data using nested rectangles.
• To develop efficient rectangle-packing algorithms for improved data visualization.

Main Methods:

• Data is represented using nested rectangles, starting with lowest-level data packing and progressing to higher levels.
• Two rectangle-packing algorithms are introduced, utilizing Delaunay triangular meshes to identify placement gaps.
• Algorithms ensure non-overlapping rectangles and optimize layout area and template-based positioning.

Main Results:

• The technique successfully represents hierarchical data structures within a single display space.
• Algorithms efficiently pack data, minimizing layout area and allowing for template-driven or semantic layouts.
• The method supports smooth representation of time-varying data and design-based layouts.

Conclusions:

• The nested rectangle technique offers an effective solution for visualizing large hierarchical data.
• The developed algorithms provide efficient and flexible data packing for enhanced visualization.
• This approach is suitable for various applications, including time-varying and semantics-based data representation.