Graph drawing and network visualizat...
GD (Symposium) (2020 :)

FindBook      Google Book      Amazon      博客來     
  • Graph drawing and network visualization = 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020 : revised selected papers /
  • 紀錄類型: 書目-電子資源 : Monograph/item
    正題名/作者: Graph drawing and network visualization/ edited by David Auber, Pavel Valtr.
    其他題名: 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020 : revised selected papers /
    其他題名: GD 2020
    其他作者: Auber, David.
    團體作者: GD (Symposium)
    出版者: Cham :Springer International Publishing : : 2020.,
    面頁冊數: xvii, 546 p. :ill., digital ;24 cm.
    內容註: Gradient descent and queue layouts -- Graph drawing via gradient descent (GD)2 -- Stochastic Gradient Descent Works Really Well for Stress Minimization -- The Local Queue Number of Graphs with Bounded Treewidth -- Parameterized Algorithms for Queue Layouts -- Lazy Queue Layouts of Posets -- Drawing tree-like graphs, visualisation, and special drawings of elementary graphs Improved Upper and Lower Bounds for LR Drawings of Binary Trees -- On the Edge-Length Ratio of 2-Trees -- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs -- VAIM: Visual Analytics for Influence Maximization -- Odd wheels are not odd-distance graphs -- Polygons with Prescribed Angles in 2D and 3D -- Restricted drawings of special graph classes On Mixed Linear Layouts of Series-Parallel Graphs -- Schematic Representation of Large Biconnected Graphs -- Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings -- A Tipping Point for the Planarity of Small and Medium Sized Graphs -- Orthogonality -- Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs -- Planar L-Drawings of Bimodal Graphs -- Layered Drawing of Undirected Graphs with Generalized Port Constraints -- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings -- On Turn-Regular Orthogonal Representations -- Extending Partial Orthogonal Drawings -- Topological constraints -- Topological Drawings meet Classical Theorems from Convex Geometry -- Towards a characterization of stretchable aligned graphs -- Exploring the Design Space of Aesthetics with the Repertory Grid Technique -- Storyline Visualizations with Ubiquitous Actors -- Drawing Shortest Paths in Geodetic Graphs -- Limiting Crossing Numbers for Geodesic Drawings on the Sphere -- Crossings, k-planar graphs -- Crossings between non-homotopic edges -- Improvement on the crossing number of crossing-critical graphs -- On the Maximum Number of Crossings in Star-Simple Drawings of K n with No Empty Lens -- Simple Topological Drawings of k-Planar Graphs -- 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth -- Planarity -- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time -- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time -- New Quality Metrics for Dynamic Graph Drawing -- The Turing Test for Graph Drawing Algorithms -- Plane Spanning Trees in Edge-Colored Simple Drawings of Kn -- Augmenting Geometric Graphs with Matchings -- Graph Drawing Contest -- Graph Drawing Contest Report.
    Contained By: Springer Nature eBook
    標題: Computer graphics - Congresses. -
    電子資源: https://doi.org/10.1007/978-3-030-68766-3
    ISBN: 9783030687663
館藏地:  出版年:  卷號: 
館藏
  • 1 筆 • 頁數 1 •
 
W9413530 電子資源 11.線上閱覽_V 電子書 EB QA76.9.A43 G3 2020 一般使用(Normal) 在架 0
  • 1 筆 • 頁數 1 •
多媒體
評論
Export
取書館
 
 
變更密碼
登入