| Description |
1 online resource (xiii, 402 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 4875 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 4875. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Invited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions -- Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices -- LunarVis -- Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report |
| Summary |
This book constitutes the thoroughly refereed post-conference proceedings of the 15th International Symposium on Graph Drawing, GD 2007, held in Sydney, Australia, September 24-26, 2007. The 27 full papers and 9 short papers presented together with 2 invited talks, and a report on the graph drawing contest were carefully selected from 74 initial submissions. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields |
| Analysis |
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
computergrafie |
|
computer graphics |
|
wiskunde |
|
mathematics |
|
computerwetenschappen |
|
computer sciences |
|
gegevensstructuren |
|
data structures |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Computer graphics -- Congresses
|
|
Graph theory -- Congresses
|
|
Informatique.
|
|
Computer graphics
|
|
Graph theory
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Hong, Seok-Hee.
|
|
Nishizeki, T. (Takao), 1947-2022
|
|
Quan, Wu
|
| ISBN |
9783540775379 |
|
3540775374 |
|
9783540775362 |
|
3540775366 |
|
9788354077534 |
|
8354077535 |
|
