• Corpus ID: 102353486

Orthogonal Voronoi Diagram and Treemap

  title={Orthogonal Voronoi Diagram and Treemap},
  author={Yan-Chao Wang and Feng Lin and Seah Hock Soon},
In this paper, we propose a novel space partitioning strategy for implicit hierarchy visualization such that the new plot not only has a tidy layout similar to the treemap, but also is flexible to data changes similar to the Voronoi treemap. To achieve this, we define a new distance function and neighborhood relationship between sites so that space will be divided by axis-aligned segments. Then a sweepline+skyline based heuristic algorithm is proposed to allocate the partitioned spaces to form… 

A Taxonomy of Treemap Visualization Techniques

This paper proposes to discern between Space-filling Treemap TS, ContainmentTreemap TC, Implicit Edge Representation Tree TIE, and Mapped Tree TMT for classification of hierarchy visualization techniques and highlights their respective properties.

Survey of treemap layout algorithms

This paper provides an overview of published treemap layout algorithms from 1991 to 2019 that were used for information visualization and computational geometry. First, a terminology is outlined for



Fast Dynamic Voronoi Treemaps

A GPGPU-based technique allows for rapid computation of centroidal Voronoi Diagrams, providing almost two orders of magnitude speedup over previous work.

Visualization of varying hierarchies by stable layout of voronoi treemaps

This paper presents an extended layout algorithm for Voronoi treemaps that provides a high degree of layout similiarity for varying hierarchies, such as software-system hierarchies.

Stable Treemaps via Local Moves

This work presents a novel stable treemapping algorithm that has very high visual quality and introduces a new measure for stability that better captures the relative positions of rectangles.

Dynamic Voronoi Treemaps : A Visualization Technique for Time-Varying Hierarchical Data

This paper describes the novel approach and outline how it overcomes key limitations of prior Voronoi-based Treemap work to enable the visualization of dynamic data and results from an evaluation study of the technique are provided.

Computing Voronoi Treemaps: Faster, Simpler, and Resolution‐independent

It is shown that, contrary to the apparent popular belief, utilization of an algorithm for weighted Voronoi diagrams is not only feasible, but also more efficient than previous low‐resolution approximations, even when the latter are implemented on graphics hardware.

Voronoi treemaps

The approach of Voronoi treemaps presented in this paper eliminates problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure, and allows for creating treemap visualizations within areas of arbitrary shape.

Nmap: A Novel Neighborhood Preservation Space-filling Algorithm

A novel approach, called Neighborhood Treemap (Nmap), that seeks to solve the limitation of distance-similarity metaphor by employing a slice and scale strategy where the visual space is successively bisected on the horizontal or vertical directions and the bisections are scaled until one rectangle is defined per data element.

Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies

A new "strip" treemap algorithm is introduced which addresses shortcomings of previous algorithms, and is shown to be more stable, while maintaining relatively favorable aspect ratios of the constituent rectangles.

Ordered treemap layouts

Compared to other layout algorithms, ordered treemaps are more stable while maintaining relatively favorable aspect ratios of the constituent rectangles.

Hierarchical data visualization using a fast rectangle-packing algorithm

Two rectangle-packing algorithms for placing items of hierarchical data onto display spaces are presented, suitable for semantics-based or design-based data layout by generating templates according to the semantics or design.