Cone Trees: animated 3D visualizations of hierarchical information
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
The adaptive pyramid: a framework for 2D image analysis
CVGIP: Image Understanding
Cheops: a compact explorer for complex hierarchies
Proceedings of the 7th conference on Visualization '96
A Pyramid Framework for Early Vision: Multiresolutional Computer Vision
A Pyramid Framework for Early Vision: Multiresolutional Computer Vision
VisDB: Database Exploration Using Multidimensional Visualization
IEEE Computer Graphics and Applications
Visualization Techniques for Mining Large Databases: A Comparison
IEEE Transactions on Knowledge and Data Engineering
CHI '99 Extended Abstracts on Human Factors in Computing Systems
Recursive Pattern: A Technique for Visualizing Very Large Amounts of Data
VIS '95 Proceedings of the 6th conference on Visualization '95
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
InterRing: An Interactive Tool for Visually Navigating and Manipulating Hierarchical Structures
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
SpaceTree: Supporting Exploration in Large Node Link Tree, Design Evolution and Empirical Evaluation
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
DGCVis: An Exploratory 3D Visualization of Graph Pyramids
CMV '04 Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization
Voronoi treemaps for the visualization of software metrics
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Hi-index | 0.00 |
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time consumed querying these random data. Such a structure is built as a series of graphs with different resolutions. Levels are constructed and surviving cells are chosen following irregular irregular pyramidal rules and according to a proximity criterion among the space points under consideration. Experimental results show that using such a structure to query data can save considerable search time.