Graph drawing : 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20 23, 2000 : proceedings
This year s meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year 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...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
1984 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph drawing, 8th International Symposium GD 2000, Colonial Williamsburg, Va, USA, September 20-23, 2000, proceedings, Joe Marks (ed.), 2001, New York, Springer, 1 vol. (XII-418 p.), Lecture notes in computer science, 3-540-41554-8 • Graph Drawing, Texte imprimé, 9783662208045 |
Table des matières:
- Invited Talk
- The Visual Representation of Information Structures
- Empirical Studies and Standards
- 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
- Theory I
- 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
- Applications and Systems
- 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)
- Invited Talk
- Knowledge Discovery from Graphs
- Force-Directed Layout
- 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
- GRIP: Graph dRawing with Intelligent Placement
- k-Level Graph Layout
- A Fast Layout Algorithm for k-Level Graphs
- Graph Layout for Displaying Data Structures
- k-Layer Straightline Crossing Minimization by Speeding Up Sifting
- Orthogonal Drawing I
- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
- Orthogonal Drawings of Cycles in 3D Space
- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
- Orthogonal Drawing II
- A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs
- Refinement ofThree-Dimensional Orthogonal Graph Drawings
- Theory II
- ?-Searchlight Obedient Graph Drawings
- Unavoidable Configurations in Complete Topological Graphs
- Minimum Weight Drawings of Maximal Triangulations
- A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
- Symmetry and Incremental Layout
- An Algorithm for Finding Three Dimensional Symmetry in Trees
- On Maximum Symmetric Subgraphs
- Clan-Based Incremental Drawing
- The Marey Graph Animation Tool Demo
- Workshop and Contest
- Graph Data Format Workshop Report
- Graph-Drawing Contest Report.