Graph Drawing 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Duncan, Christian (Επιμελητής έκδοσης), Symvonis, Antonios (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.
• Σειρά: Lecture Notes in Computer Science, 8871
• Θέματα: Computer science.; Algorithms.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Computer Graphics.

This book constitutes the proceedings of the 22nd International Symposium on Graph Drawing, GD 2014, held in Würzburg, Germany, in September 2014. The 41 full papers presented in this volume were carefully reviewed and selected from 72 submissions. The back matter of the book also contains 2 page po...

Πίνακας περιεχομένων:

• Planar Subgraphs
• Planar Induced Subgraphs of Sparse Graphs
• Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Simultaneous Embeddings
• Drawing Simultaneously Embedded Graphs with Few Bends
• Planar and Quasi Planar Simultaneous Geometric Embedding
• Simultaneous Embeddability of Two Partitions
• Applications
• Luatodonotes: Boundary Labeling for Annotations in Texts
• A Coloring Algorithm for Disambiguating Graph and Map Drawings
• Untangling Hairballs: From 3 to 14 Degrees of Separation
• GION: Interactively Untangling Large Graphs on Wall-Sized Displays
• Contact Representations
• Balanced Circle Packings for Planar Graphs
• Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
• The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
• Bitonic st-orderings of Biconnected Planar Graphs
• k-Planar Graphs
• Drawing Outer 1-planar Graphs with Few Slopes
• Fan-Planar Graphs: Combinatorial Properties and Complexity Results
• On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
• Crossing Minimization Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• A Crossing Lemma for the Pair-Crossing Number
• Are Crossings Important for Drawing Large Graphs?
• Level Drawings
• The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity)
• Column Planarity and Partial Simultaneous Geometric Embedding
• Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
• Theory
• Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
• Morphing Schnyder Drawings of Planar Triangulations
• Trade-Offs in Planar Polyline Drawings
• Fixed Edge Directions
• Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
• Planar Octilinear Drawings with One Bend Per Edge
• On the Complexity of HV-rectilinear Planarity Testing
• Embedding Four-Directional Paths on Convex Point Sets
• Drawing under Constraints
• Drawing Graphs within Restricted Area
• Height-Preserving Transformations of Planar Graph Drawings
• Drawing Planar Graphs with Reduced Height
• Anchored Drawings of Planar Graphs
• Clustered Planarity
• Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
• Clustered Planarity Testing Revisited
• A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
• MapSets: Visualizing Embedded and Clustered Graphs
• Greedy Graphs
• Increasing-Chord Graphs On Point Sets
• On Self-approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
• On Monotone Drawings of Trees
• Graph Drawing Contest
• Graph Drawing Contest Report
• Posters
• A User Study on the Visualization of Directed Graphs
• GraphBook: Making Graph Paging Real
• Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling
• PiGra– A Tool for Pixelated Graph Representations
• Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
• Touching Triangle Representations in a k-gon of Biconnected Outerplanar Graphs
• 3D Graph Visualization with the Oculus Rift
• Force-Directed 3D Arc Diagrams
• People Prefer Less Stress and Fewer Crossings
• A New Approach to Visualizing General Trees Using Thickness-Adjustable Quadratic Curves
• Minimum Representations of Rectangle Visibility Graphs.