Cone Trees: animated 3D visualizations of hierarchical information
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
TreeViz: treemap visualization of hierarchically structured information
CHI '92 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Laying out and visualizing large trees using a hyperbolic space
UIST '94 Proceedings of the 7th annual ACM symposium on User interface software and technology
“Finding and reminding” reconsidered
ACM SIGCHI Bulletin
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Data mountain: using spatial memory for document management
Proceedings of the 11th annual ACM symposium on User interface software and technology
Presto: an experimental architecture for fluid interactive document spaces
ACM Transactions on Computer-Human Interaction (TOCHI)
How do people organize their desks?: Implications for the design of office information systems
ACM Transactions on Information Systems (TOIS)
Box-trees and R-trees with near-optimal query time
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Names should mean what, not where
EW 5 Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring
AFRIGRAPH '01 Proceedings of the 1st international conference on Computer graphics, virtual reality and visualisation
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Exploring Large Graphs in 3D Hyperbolic Space
IEEE Computer Graphics and Applications
Navigation in hypertext: A critical review of the concept
INTERACT '90 Proceedings of the IFIP TC13 Third Interational Conference on Human-Computer Interaction
Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space
INFOVIS '98 Proceedings of the 1998 IEEE Symposium on Information Visualization
MediaFinder: an interface for dynamic personal media management with semantic regions
CHI '03 Extended Abstracts on Human Factors in Computing Systems
VENNFS: A Venn-Diagram File Manager
IV '03 Proceedings of the Seventh International Conference on Information Visualization
Layout Metrics for Euler Diagrams
IV '03 Proceedings of the Seventh International Conference on Information Visualization
A visual adaptive interface to file systems
Proceedings of the working conference on Advanced visual interfaces
Diagrammatic Reasoning Systems
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Exploring Human Factors in Formal Diagram Usage
Engineering Interactive Systems
A graph theoretic approach to general Euler diagram drawing
Theoretical Computer Science
Abstractions of Euler Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient on-line algorithms for Euler diagram region computation
Computational Geometry: Theory and Applications
Speedith: a diagrammatic reasoner for spider diagrams
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Looking beyond the single pane of glass: visualization and perspective in enterprise network
DUXU'13 Proceedings of the Second international conference on Design, User Experience, and Usability: web, mobile, and product design - Volume Part IV
| Hi-index | 0.00 |
In this paper, we describe how to use Euler Diagrams to represent virtual directories. i.e. collection of files that are computed on demand and satisfy a number of constraints. We, then, briefly describe the state of VennFS project that is currently modified to include this new capability. In particular, we show a data structure designed to answer queries about a given Euler Diagram and its sets. The data structure EulerTree described here is based on the R-Tree (see [Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar and Herman J. Haverkort, Box-trees and R-trees with near-optimal query time, in: Symposium on Computational Geometry, 2001, pp. 124-133]), a data structure designed for answering range queries over a family of shapes in the 2-dimensional space.