Information Technology Reference
In-Depth Information
non-uniform polygons. Furthermore, most existing treemap algorithms
lack the ability to emphasize hierarchical structure, which is useful for
exploring and analysing hierarchical data.
Fig. 5.16. Line chart for the average completion time comparison between Angular
Treemaps and traditional vertical-horizontal treemaps in three categorized tasks.
Angular Treemaps is a new member of the treemap family, which
maps tree structure to the constrained rectangular geometric area, similarly
to the original rectangular tree maps concept. However, Angular Treemaps
do not restrict tessellation to only vertical and horizontal directions.
This chapter has demonstrated the advantage of Angular Treemaps
through both a case study and usability studies. Taking into account its
real-time performance, and the quality of its visualization layouts, Angular
Treemaps can be a very effective and flexible interactive tool for
producing visual representations of large data structures, as well as
emphasizing substructures using an angular partitioning approach. For
future work, we will adopt Angular Treemaps for a wider range of
applications within different polygonal container shapes. To enhance user
experience, we will expand user-centred evaluation for the applications
developed.
Search WWH ::




Custom Search