Ellimaps, une technique basée sur la loi d'inclusion pour représenter des hiérarchies avec noeuds pondérés

Otjacques, Benoît; Collin, Pierre; Noirhomme, Monique; Feltz, Fernand

doi:10.3166/ria.22.301-327

Cited by 3 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, they use nested ellipses instead of nested rectangles and this offers some new perspectives as well as new challenges. A previous study [8] has shown that (under the conditions summarized hereafter) the ellimaps provide a better support to the perception of the hierarchical structure than squarified treemaps. In addition, they received better score for the subjective perception of the test users.…”

Section: State Of Artmentioning

confidence: 93%

“…For visualizing hierarchies, the common region principle materializes by nesting shapes into each other. The nodes are represented by rectangles [13], ellipses [8], complex shapes [1] or even distorted shapes [16]. The hierarchical relationship is represented by the successive inclusion of these shapes.…”

Section: State Of Artmentioning

confidence: 99%

“…Ellimaps [8] are more recent and have been significantly less studied (e.g. [9] for an example of use for monitoring web-based platforms).…”

Section: State Of Artmentioning

confidence: 99%

See 2 more Smart Citations

CGD – A New Algorithm to Optimize Space Occupation in Ellimaps

Otjacques¹,

Cornil²,

Noirhomme

et al. 2009

Human-Computer Interaction – INTERACT 2009

Self Cite

View full text Add to dashboard Cite

How to visualize datasets hierarchically structured is a basic issue in information visualization. Compared to the common diagrams based on the nodes-links paradigm (e.g. trees), the enclosure-based methods have shown high potential to represent simultaneously the structure of the hierarchy and the weight of nodes. In addition, these methods often support scalability up to sizes where trees become very complicated to understand. Several approaches belong to this class of visualization methods such as treemaps, ellimaps, circular treemaps or Voronoi treemaps. This paper focuses on the specific case of ellimaps in which the nodes are represented by ellipses nested one into each other. A controlled experiment has previously shown that the initial version of the ellimaps was efficient to support the perception of the dataset structure and was reasonably acceptable for the perception of the node weights. However it suffers from a major drawback in terms of display space occupation. We have tackled this issue and the paper proposes a new algorithm to draw ellimaps. It is based on successive distortions and relocations of the ellipses in order to occupy a larger proportion of the display space than the initial algorithm. A Monte-Carlo simulation has been used to evaluate the filling ratio of the display space in this new approach. The results show a significant improvement of this factor.

show abstract

Section: State Of Artmentioning

confidence: 93%

Section: State Of Artmentioning

confidence: 99%

See 1 more Smart Citation

CGD – A New Algorithm to Optimize Space Occupation in Ellimaps

Otjacques¹,

Cornil²,

Noirhomme

et al. 2009

Human-Computer Interaction – INTERACT 2009

Self Cite

View full text Add to dashboard Cite

show abstract

“…The ellimaps [14] approach is a variation of the treemaps in which rectangles are replaced by ellipses. In fact, this technique can be considered as a trade-off between the treemaps and the circular treemaps and therefore appears as a potential good candidate to support the inclusion of gauges.…”

Section: Storage Ellimapsmentioning

confidence: 99%

“…Others have explored the potential offered by primitive shapes that are not rectangles. For instance, bubblemaps [2] use some complex areas approximating common shapes like rectangles or circles, Voronoi treemaps [1] use polygons, circular treemaps [21] and bubble trees [5] rely on circles and finally ellimaps [14] are based on ellipses. Vliegen et al [19] adopted another approach and distorted the whole treemap in order to mimics usual business graphics.…”

Section: Introductionmentioning

confidence: 99%

Visualizing consumption in weighted hierarchies

Otjacques¹,

Collin²,

Feltz³

et al. 2008

2008 Third International Conference on Digital Information Management

Self Cite

View full text Add to dashboard Cite

Visualizing hierarchies is a recurrent topic in information visualization. Trees have been largely studied and are efficient to highlight the dataset structure. When a numerical value is attached to each node (weighted hierarchies), the enclosurebased methods such as treemaps appear to be powerful approaches. Surprisingly, hierarchies with nodes associated to consumable resources have been less studied and the existing approaches for visualizing hierarchies must admit some limitations from this perspective. However, such hierarchies are very common in practice (e.g. budget, storage disk quotas). This paper focuses on this specific problem and explores how the enclosure-based techniques can be adapted to represent two numerical values for each node: a quantity of available resources and the level of consumption of this resource. The approach proposed in the paper relies on the metaphor of storage tanks that are partially filled.

show abstract