Density functions for visual attributes and effective partitioning in graph visualization
- 8 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attributes to a node or edge that indicates an associated value. In an application involving divisive clustering, we would like to partition the graph into subsets of graph elements based on metric values in such a way that all subsets are evenly populated. Assuming a uniform distribution of metric values during either partitioning or coloring can have undesired effects such as empty clusters or only one level of emphasis for the entire graph. Probability density functions derived from statistics about a metric can help systems succeed at these tasks.Keywords
This publication has 10 references indexed in Scilit:
- Dynamic hierarchy specification and visualizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A tool for visualizing the topology of three-dimensional vector fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- FAST: a multi-processed environment for visualization of computational fluid dynamicsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Systems of functional equationsRandom Structures & Algorithms, 2000
- Graph visualization and navigation in information visualization: A surveyIEEE Transactions on Visualization and Computer Graphics, 2000
- Tree Visualisation and Navigation Clues for Information VisualisationComputer Graphics Forum, 1998
- Navigating hierarchically clustered networks through fisheye and full-zoom methodsACM Transactions on Computer-Human Interaction, 1996
- Structural analysis of hypertextsACM Transactions on Information Systems, 1992
- Generalized fisheye viewsPublished by Association for Computing Machinery (ACM) ,1986
- The number of registers required for evaluating arithmetic expressionsTheoretical Computer Science, 1979