LEADER 05934nam 22008295 450 001 9910767528703321 005 20251226203419.0 010 $a1-280-86451-6 010 $a9786610864515 010 $a3-540-70904-5 024 7 $a10.1007/978-3-540-70904-6 035 $a(CKB)1000000000284100 035 $a(SSID)ssj0000297848 035 $a(PQKBManifestationID)11256353 035 $a(PQKBTitleCode)TC0000297848 035 $a(PQKBWorkID)10343549 035 $a(PQKB)10266985 035 $a(DE-He213)978-3-540-70904-6 035 $a(MiAaPQ)EBC3036658 035 $a(MiAaPQ)EBC6806044 035 $a(Au-PeEL)EBL6806044 035 $a(OCoLC)185027059 035 $a(PPN)123160294 035 $a(MiAaPQ)EBC302170 035 $a(BIP)14000971 035 $a(EXLCZ)991000000000284100 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing $e14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006, Revised Papers /$fedited by Michael Kaufmann, Dorothea Wagner 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XIV, 454 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4372 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-70903-7 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- The Number of Triangulations on Planar Point Sets -- The Algorithmic Beauty of Digital Nature -- Papers -- Integrating Edge Routing into Force-Directed Layout -- Multipole-Based Force Approximation Revisited ? A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree -- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding -- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data -- Angle and Distance Constraints on Tree Drawings -- Schematisation of Tree Drawings -- Trees with Convex Faces and Optimal Angles -- Three-Dimensional Drawings of Bounded Degree Trees -- Simultaneous Graph Embedding with Bends and Circular Arcs -- Embedding Graphs Simultaneously with Fixed Edges -- Drawing Cubic Graphs with at Most Five Slopes -- Planarity Testing and Optimal Edge Insertion with Embedding Constraints -- Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs -- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor -- On the Crossing Number of Almost Planar Graphs -- On the Decay of Crossing Numbers -- How Important Is the ?Mental Map?? ? An Empirical Investigation of a Dynamic Graph Layout Algorithm -- Computing Geometric Minimum-Dilation Graphs Is NP-Hard -- Chordal Graphs as Intersection Graphs of Pseudosegments -- Parameterized st-Orientations of Graphs: Algorithms and Experiments -- Straight-Line Drawing of Quadrangulations -- Visualizing Large and Clustered Networks -- Partitioned Drawings -- Path Simplification for Metro Map Layout -- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps -- Upright-Quad Drawing of st-Planar Learning Spaces -- Choosing Colors for Geometric Graphs Via Color Space Embeddings -- Morphing Planar Graphs in SphericalSpace -- k-Colored Point-Set Embeddability of Outerplanar Graphs -- Thickness of Bar 1-Visibility Graphs -- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model -- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs -- Characterization of Unlabeled Level Planar Trees -- Drawing Bipartite Graphs on Two Curves -- Improved Circular Layouts -- Controllable and Progressive Edge Clustering for Large Networks -- Biclique Edge Cover Graphs and Confluent Drawings -- Schnyder Woods and Orthogonal Surfaces -- Partitions of Graphs into Trees -- Posters -- The Website for Graph Visualization Software References (GVSR) -- Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings -- Corrections -- Fast Node Overlap Removal?Correction -- Graph Drawing Contest -- Graph-Drawing Contest Report. 330 $aThis book constitutes the thoroughly refereed post-proceedings of the 14th International Symposium on Graph Drawing, GD 2006, held in Karlsruhe, Germany in September 2006. The 33 revised full papers and 5 revised short papers presented together with 2 invited talks, 1 system demo, 2 poster papers and a report on the graph drawing contest were carefully selected during two rounds of reviewing and improvement from 91 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4372 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer graphics 606 $aArtificial intelligence$xData processing 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aComputer Graphics 606 $aData Science 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aArtificial intelligence$xData processing. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a006.6 702 $aKaufmann$b Michael$f1959- 702 $aWagner$b Dorothea$f1957- 712 12$aSymposium on Graph Drawing 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767528703321 996 $aGraph Drawing$9773153 997 $aUNINA