Visualizing large trees with divide & conquer partition
- Publication Type:
- Conference Proceeding
- Citation:
- ACM International Conference Proceeding Series, 2013, pp. 79 - 87
- Issue Date:
- 2013-09-16
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2013003537OK.pdf | 1.53 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
While prior works on enclosure approach, guarantees the space utilization of a single geometrical area, mostly rectangle, this paper proposes a flexible enclosure tree layout method for partitioning various polygonal shapes that break through the limitation of rectangular constraint. Similar to Treemap techniques, it uses enclosure to divide display space into smaller areas for its sub-hierarchies. The algorithm can partition a polygonal shape or even an arbitrary shape into smaller polygons, rotated rectangles or vertical-horizontal rectangles. The proposed method and implementation algorithms provide an effective interactive visualization tool for partitioning large hierarchical structures within a confined display area with different shapes for real-time applications. We demonstrated the effective of the new method with a case study, an automated evaluation and a usability study. © 2013 ACM.
Please use this identifier to cite or link to this item: