Graph Drawing: 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings (Lecture Notes in Computer Science, 1984)

This year{u2019}s meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year{u2019}s symposium possible, and we were delighted that so many people came to - lonial Williamsburg, Virginia, for three days of the latest results in the eld of graph drawing. As in previous years, the review process was quite competitive. We accepted 30 out of 53 regular-length submissions, and 5 out of 15 short submissions, for a total acceptance ratio of 35 out of 68, or 51%. This year{u2019}s program featured several new developments in the eld. Four di erent approaches for handling very large graphs were presented in a session on force-directed layout. Two sessions were devoted to the latest advances in orthogonal graph drawing. And alongside the usual mix of theory and practice papers we had several contributions based on empirical studies of users and of systems. Our invited talks were given by two speakers who were new to most members of the GD community, but who work in areas that are closely related to graph drawing. Professor Colin Ware of the University of New Hampshire told us how knowledge of human visual perception is useful for the design of e ective data visualizations. And Professor David Jensen of the University of Massachusetts at Amherst talked about the process of knowledge discovery from graphs, a process that involves more than just graph drawing and visualization The Visual Representation of Information Structures....Pages 1-4 User Preference of Graph Layout Aesthetics: A UML Study....Pages 5-18 A User Study in Similarity Measures for Graph Drawing....Pages 19-30 Interactive Partitioning System Demonstration, Short....Pages 31-36 An Experimental Comparison of Orthogonal Compaction Algorithms....Pages 37-51 GraphXML — An XML-Based Graph Description Format....Pages 52-62 On Polar Visibility Representations of Graphs....Pages 63-76 A Linear Time Implementation of SPQR-Trees....Pages 77-90 Labeling Points with Rectangles of Various Shapes....Pages 91-102 How to Draw the Minimum Cuts of a Planar Graph....Pages 103-114 2 D -Structure Drawings of Similar Molecules....Pages 115-126 Fast Layout Methods for Timetable Graphs....Pages 127-138 An Algorithmic Framework for Visualizing Statecharts....Pages 139-149 Visualization of the Autonomous Systems Interconnections with H ermes ....Pages 150-163 Drawing Hypergraphs in the Subset Standard (Short Demo Paper)....Pages 164-169 Knowledge Discovery from Graphs....Pages 170-170 A Multilevel Algorithm for Force-Directed Graph Drawing....Pages 171-182 A Fast Multi-scale Method for Drawing Large Graphs....Pages 183-196 FADE: Graph Drawing, Clustering, and Visual Abstraction....Pages 197-210 A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs....Pages 211-221 GRIP: Graph dRawing with Intelligent Placement....Pages 222-228 A Fast Layout Algorithm for k -Level Graphs....Pages 229-240 Graph Layout for Displaying Data Structures....Pages 241-252 k -Layer Straightline Crossing Minimization by Speeding Up Sifting....Pages 253-258 Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings....Pages 259-271 Orthogonal Drawings of Cycles in 3D Space....Pages 272-283 Three-Dimensional Orthogonal Graph Drawing with Optimal Volume....Pages 284-295 A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs....Pages 296-307 Refinement of Three-Dimensional Orthogonal Graph Drawings....Pages 308-320 ω -Searchlight Obedient Graph Drawings....Pages 321-327 Unavoidable Configurations in Complete Topological Graphs....Pages 328-337 Minimum Weight Drawings of Maximal Triangulations....Pages 338-349 A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band....Pages 350-359 An Algorithm for Finding Three Dimensional Symmetry in Trees....Pages 360-371 On Maximum Symmetric Subgraphs....Pages 372-383 Clan-Based Incremental Drawing....Pages 384-395 The Marey Graph Animation Tool Demo....Pages 396-406 Graph Data Format Workshop Report....Pages 407-409 Graph-Drawing Contest Report....Pages 410-418 Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings Author: Joe Marks Published by Springer Berlin Heidelberg ISBN: 978-3-540-41554-1 DOI: 10.1007/3-540-44541-2 Table of Contents: The Visual Representation of Information Structures User Preference of Graph Layout Aesthetics: A UML Study A User Study in Similarity Measures for Graph Drawing Interactive Partitioning System Demonstration, Short An Experimental Comparison of Orthogonal Compaction Algorithms GraphXML — An XML-Based Graph Description Format On Polar Visibility Representations of Graphs A Linear Time Implementation of SPQR-Trees Labeling Points with Rectangles of Various Shapes How to Draw the Minimum Cuts of a Planar Graph 2D-Structure Drawings of Similar Molecules Fast Layout Methods for Timetable Graphs An Algorithmic Framework for Visualizing Statecharts Visualization of the Autonomous Systems Interconnections with Hermes Drawing Hypergraphs in the Subset Standard (Short Demo Paper) Knowledge Discovery from Graphs A Multilevel Algorithm for Force-Directed Graph Drawing A Fast Multi-scale Method for Drawing Large Graphs FADE: Graph Drawing, Clustering, and Visual Abstraction A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs This book constitutes the thoroughly refereed post-proceedings of the 8th International Symposium on Graph Drawing, GD 2000, held in Colonial Williamsburg, VA, USA, in September 2000. The 36 revised full papers presented were carefully reviewed and selected from a total of 68 submissions. The book presents topical sections on empirical studies and standards, theory, application and systems, force-directed layout, k-level graph layout, orthogonal drawing, symmetry and incremental layout, and reports on a workshop on graph data formats and on the annual GD graph drawing contest The human visual system provides by far the highest bandwidth channel into the brain (70% of all receptors, more than 40% of cortex devoted to vision).