A fast algorithm for constructing Delaunay triangulations in the plane
Advances in Engineering Software
Fractal views: a fractal-based method for controlling information display
ACM Transactions on Information Systems (TOIS)
Design galleries: a general approach to setting parameters for computer graphics and animation
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Dynamic space management for user interfaces
UIST '00 Proceedings of the 13th annual ACM symposium on User interface software and technology
Adaptive unwrapping for interactive texture painting
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
H-BLOB: a hierarchical visual clustering method using implicit surfaces
Proceedings of the conference on Visualization '00
PhotoMesa: a zoomable image browser using quantum treemaps and bubblemaps
Proceedings of the 14th annual ACM symposium on User interface software and technology
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
ACM Transactions on Graphics (TOG)
Dynamic Aggregation with Circular Visual Designs
INFOVIS '98 Proceedings of the 1998 IEEE Symposium on Information Visualization
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Disconnected Graph Layout and the Polyomino Packing Approach
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Research report: Interacting with huge hierarchies: beyond cone trees
INFOVIS '95 Proceedings of the 1995 IEEE Symposium on Information Visualization
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
Tree-Maps: a space-filling approach to the visualization of hierarchical information structures
VIS '91 Proceedings of the 2nd conference on Visualization '91
VLSI module placement based on rectangle-packing by the sequence-pair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hierarchical Visualization of Network Intrusion Detection Data
IEEE Computer Graphics and Applications
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
An approximation algorithm for dissecting a rectangle into rectangles with specified areas
Discrete Applied Mathematics
Proceedings of the International Conference on Advanced Visual Interfaces
Fractal map: fractal-based 2D expansion method for multi-scale high-dimensional data visualization
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
A personal photograph browser for life log analysis based on location, time, and person
Proceedings of the 2011 ACM Symposium on Applied Computing
D-FLIP: dynamic & flexible interactive PhotoShow
SIGGRAPH Asia 2013 Emerging Technologies
| Hi-index | 0.00 |
Abstract--This paper presents a technique for the representation of large-scale hierarchical data which aims to provide good overviews of complete structures and the content of the data in one display space. The technique represents the data by using nested rectangles. It first packs icons or thumbnails of the lowest-level data and then generates rectangular borders that enclose the packed data. It repeats the process of generating rectangles that enclose the lower-level rectangles until the highest-level rectangles are packed. This paper presents two rectangle-packing algorithms for placing items of hierarchical data onto display spaces. The algorithms refer to Delaunay triangular meshes connecting the centers of rectangles to find gaps where rectangles can be placed. The first algorithm places rectangles where they do not overlap each other and where the extension of the layout area is minimal. The second algorithm places rectangles by referring to templates describing the ideal positions for nodes of input data. It places rectangles where they do not overlap each other and where the combination of the layout area and the distances between the positions described in the template and the actual positions is minimal. It can smoothly represent time-varying data by referring to templates that describe previous layout results. It is also suitable for semantics-based or design-based data layout by generating templates according to the semantics or design.