Location of Repository

Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph. A graph contains nodes and edges where the nodes represent the items or concepts of interest, and the edges connect two nodes together according to some associational scheme. Examples of graph data include: network topologies; maps, where nodes represent towns and edges represent roads; and social diagrams where people are the nodes and edges represent some relationship between people, for instance, that they are friends. A good layout allows users to more easily investigate the data when performing tasks such as following paths, seeing clusters of closely related nodes and discovering general structures in data. Laying out graphs by hand is time consuming, however there are a number of proven graph drawing methods which can be used to automatically visualize the data

Topics:
QA76

Publisher: Pergamon

Year: 2004

OAI identifier:
oai:kar.kent.ac.uk:14049

Provided by:
Kent Academic Repository

- A Hybrid Genetic Algorithm for Aesthetic
- (1984). A Multilevel Algorithm for Force-Directed Graph Drawing.
- (1999). Algorithms for the Visualization of Graphs.
- An stem and its Applications to Software Engineering,
- (2001). Animated Exploration of Dynamic Graphs with Radial Layout.
- awing Graphs: Methods and Models,
- (2001). D.S. McCrickard & C.M. Ke World Wide Web Conference.
- De aph Visualization System DaVinci,
- Delaunay Triangulations in TIN Creation: An Overview and a Liner-Time Algorithm.
- (1996). Drawing graphics nicely using simulated annealing.
- Drawing Graphs: Methods and Models,
- (1998). e Best Viewpoints for Three-Dimensional Graph Drawings. Graph Draw
- (1990). Embedding planar graphs on the grid.
- (1996). Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions.
- Fillets: Cues for Connections in Focus+Context Views of Graph-like Diagrams.
- (2001). Generating Schematic Cable Plans Using Springembedder Methods.
- (1999). Graph Drawing: Algorithms for the Visualisation of Graphs.
- (1963). How to draw a graph.
- JIGGLE: Java Interactive Graph Layout Algorithm.
- (2001). Map Labeling with Application to Graph Drawing.
- (2000). Mapping and Visualizing the Internet,
- (2000). Mapping Cyberspace.
- (1981). Methods for Visual Understa Structures.
- (2000). Multiple-View and Multiform Visualization.
- (1996). Natural Trees -- Neighborhood-Location in a Nutshell.
- (1999). NicheWorks -- Interactive Visualization of Very Large Graphs.
- (1997). On the Edge Label Placement Problem. Graph Drawing (GD) 96, LNCS .
- Preserving the Mental Map of a Diagram.
- (1991). Richard Webber. Finding th ing (GD) 97, LNCS 1353. pp.8 amics. Pegasus Communications monstration of the Interactive Gr .
- (2000). Self organizing cognitive maps.
- (2000). Self organizing cognitive maps. The Professional Geographer,
- (2002). Spring Embedder Preprocessing for WWW Visualization. In
- (1997). Structuring space with image schemata: Wayfinding in airports as a case study, Spatial Information Theory: A Theoretical Bas 102).
- Supporting visual analysis of geospatially-referenced statistics through web-deployable, cross-platform tools.
- (2000). thea Wagner, Using Graph Layout to Visualize Train Interconnection Data. hms and Applications 4(3):135-155,
- Ulrik Brandes and Doro
- (2000). User Preference of Graph Layout Aesthetics: A UML Study. Graph Drawing (GD)
- (1984). Using fuzzy cognitive maps to define the search space in problem solving. mputing Systems: Cognitive CS
- Visualizing Search Results using SQWID.
- (1995). Visualizing the Structure of the World Wide Web in 3D Hyperbolic Space.
- (1998). WebOFDAV — navigating and visualizing the Web on-line with animated context swapping. WWW7: 7th International World Wide Web Conference.
- (1973). World Dyn .

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.