咨询与建议

限定检索结果

文献类型

  • 35 篇 会议
  • 1 册 图书
  • 1 篇 期刊文献

馆藏范围

  • 37 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 32 篇 工学
    • 20 篇 建筑学
    • 20 篇 土木工程
    • 20 篇 测绘科学与技术
    • 13 篇 计算机科学与技术...
    • 8 篇 软件工程
    • 1 篇 信息与通信工程
    • 1 篇 农业工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 20 篇 理学
    • 19 篇 数学
    • 1 篇 生物学
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 14 篇 drawing (graphic...
  • 8 篇 visualization
  • 6 篇 graph theory
  • 1 篇 program debuggin...
  • 1 篇 graph embeddings
  • 1 篇 software enginee...
  • 1 篇 large dataset
  • 1 篇 computer appl. i...
  • 1 篇 computer graphic...
  • 1 篇 binary trees
  • 1 篇 discrete mathema...
  • 1 篇 directed graphs
  • 1 篇 clustering algor...
  • 1 篇 data structures
  • 1 篇 algorithm analys...
  • 1 篇 heuristic algori...

机构

  • 3 篇 wilhelm-schickha...
  • 3 篇 università degli...
  • 2 篇 lg theoretische ...
  • 2 篇 university of pe...
  • 2 篇 lehrstuhl für in...
  • 2 篇 roma tre univers...
  • 2 篇 department of ma...
  • 2 篇 department of co...
  • 2 篇 univ wurzburg wu...
  • 1 篇 tu eindhoven ein...
  • 1 篇 national institu...
  • 1 篇 univ waterloo wa...
  • 1 篇 st petersburg st...
  • 1 篇 universität tübi...
  • 1 篇 institut für inf...
  • 1 篇 univ politecn ca...
  • 1 篇 agenzia entrate ...
  • 1 篇 department of co...
  • 1 篇 university of li...
  • 1 篇 university of ca...

作者

  • 5 篇 kaufmann michael
  • 4 篇 liotta giuseppe
  • 4 篇 montecchiani fab...
  • 3 篇 kobourov stephen
  • 3 篇 biedl therese
  • 3 篇 mchedlidze tamar...
  • 3 篇 hong seok-hee
  • 3 篇 rutter ignaz
  • 3 篇 didimo walter
  • 3 篇 tappini alessand...
  • 3 篇 wolff alexander
  • 3 篇 kindermann phili...
  • 2 篇 angelini patrizi...
  • 2 篇 frati fabrizio
  • 2 篇 eades peter
  • 2 篇 chaplick steven
  • 2 篇 radermacher marc...
  • 2 篇 heinsohn niklas
  • 2 篇 di giacomo emili...
  • 2 篇 lipp fabian

语言

  • 37 篇 英文
检索条件"任意字段=25th International Symposium on Graph Drawing and Network Visualization, GD 2017"
37 条 记 录,以下是1-10 订阅
排序:
25th international symposium on graph drawing and network visualization, gd 2017
收藏 引用
25th international symposium on graph drawing and network visualization, gd 2017
the proceedings contain 44 papers. the special focus in this conference is on graph drawing and network visualization. the topics include: Arrangements of pseudocircles: Triangles and drawings;drawing bobbin lace grap...
来源: 评论
Monotone Arc Diagrams with Few Biarcs  32
Monotone Arc Diagrams with Few Biarcs
收藏 引用
32nd international symposium on graph drawing and network visualization, gd 2024
作者: Chaplick, Steven Förster, Henry Hoffmann, Michael Kaufmann, Michael Maastricht University Netherlands Universität Tübingen Germany Department of Computer Science ETH Zürich Switzerland
We show that every planar graph has a monotone topological 2-page book embedding where at most (4n - 10)/5 (of potentially 3n - 6) edges cross the spine, and every edge crosses the spine at most once;such an edge is c... 详细信息
来源: 评论
Limitations on Realistic Hyperbolic graph drawing  29th
Limitations on Realistic Hyperbolic Graph Drawing
收藏 引用
29th international symposium on graph drawing and network visualization, gd 2021
作者: Eppstein, David Computer Science Department University of California Irvine IrvineCA92697 United States
We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximate... 详细信息
来源: 评论
Planar Rectilinear drawings of Outerplanar graphs in Linear Time  28th
Planar Rectilinear Drawings of Outerplanar Graphs in Linear ...
收藏 引用
28th international symposium on graph drawing and network visualization, gd 2020
作者: Frati, Fabrizio Roma Tre University Rome Italy
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding and if it does not. Our algorithm returns a planar rectilinear dr... 详细信息
来源: 评论
Storyline visualizations with Ubiquitous Actors  28th
Storyline Visualizations with Ubiquitous Actors
收藏 引用
28th international symposium on graph drawing and network visualization, gd 2020
作者: Di Giacomo, Emilio Didimo, Walter Liotta, Giuseppe Montecchiani, Fabrizio Tappini, Alessandra Engineering Department University of Perugia Perugia Italy
Storyline visualizations depict the temporal dynamics of social interactions, as they describe how groups of actors (individuals or organizations) change over time. A common constraint in storyline visualizations is t... 详细信息
来源: 评论
Maximizing Ink in Partial Edge drawings of k-plane graphs  27th
Maximizing Ink in Partial Edge Drawings of k-plane Graphs
收藏 引用
27th international symposium on graph drawing and network visualization (gd)
作者: Hummel, Matthias Klute, Fabian Nickel, Soeren Noellenburg, Martin TU Wien Algorithms & Complex Grp Vienna Austria
Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, ... 详细信息
来源: 评论
CHORDLINK: A New Hybrid visualization Model  27th
CHORDLINK: A New Hybrid Visualization Model
收藏 引用
27th international symposium on graph drawing and network visualization (gd)
作者: Angori, Lorenzo Didimo, Walter Montecchiani, Fabrizio Pagliuca, Daniele Tappini, Alessandra Univ Perugia Dipartimento Ingn Perugia Italy Agenzia Entrate Arezzo Italy
Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. this double structural nature makes it difficult to adopt a homogene... 详细信息
来源: 评论
Line and Plane Cover Numbers Revisited  27th
Line and Plane Cover Numbers Revisited
收藏 引用
27th international symposium on graph drawing and network visualization (gd)
作者: Biedl, therese Felsner, Stefan Meijer, Henk Wolff, Alexander Univ Waterloo Waterloo ON Canada TU Berlin Berlin Germany Univ Coll Roosevelt Middelburg Netherlands Univ Wurzburg Wurzburg Germany
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph G, the minimum such number (over all drawings in d... 详细信息
来源: 评论
graph drawing Contest Report  25th
收藏 引用
26th international symposium on graph drawing and network visualization (gd)
作者: Devanny, William Kindermann, Philipp Loffler, Maarten Rutter, Ignaz Univ Calif Irvine Irvine CA USA Univ Wurzburg Wurzburg Germany Univ Utrecht Utrecht Netherlands Univ Passau Passau Germany
this report describes the 25th Annual graph drawing Contest, held in conjunction with the 26th international symposium on graph drawing and network visualization (gd'18) in Barcelona, Spain. the mission of the Gra... 详细信息
来源: 评论
drawing big graphs using spectral sparsification  25th
收藏 引用
25th international symposium on graph drawing and network visualization, gd 2017
作者: Eades, Peter Nguyen, Quan Hong, Seok-Hee The School of Information Technologies University of Sydney Sydney Australia
Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the use of spectral sparsification to prod... 详细信息
来源: 评论