Graph drawing : 5th International Symposium, GD'97, Rome, Italy, September 18-20, 1997 : proceedings
著者
書誌事項
Graph drawing : 5th International Symposium, GD'97, Rome, Italy, September 18-20, 1997 : proceedings
(Lecture notes in computer science, 1353)
Springer Verlag, c1997
- タイトル別名
-
GD '97 : graph drawing
大学図書館所蔵 全50件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This book constitutes the strictly refereed post-conference proceedings of the 5th International Symposium on Graph Drawing, GD'97, held in Rome, Italy, in September 1997. The 33 revised full papers and 10 systems demonstrations presented were selected from 80 submissions. The topics covered include planarity, crossing theory, three dimensional representations, orthogonal representations, clustering and labeling problems, packing problems, general methodologies, and systems and applications.
目次
Drawable and forbidden minimum weight triangulations.- A polyhedral approach to the multi-layer crossing minimization problem.- On embedding an outer-planar graph in a point set.- Bipartite crossing numbers of meshes and hypercubes.- Three-dimensional grid drawings of graphs.- Incremental orthogonal graph drawing in three dimensions.- On three-dimensional layout of interconnection networks.- Orthogonal 3-D graph drawing.- Finding the best viewpoints for three-dimensional graph drawings.- A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs.- Interactive orthogonal graph drawing: Algorithms and bounds.- Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard.- Algorithms and area bounds for nonplanar orthogonal drawings.- Drawing clustered graphs on an orthogonal grid.- Graph clustering I: Cycles of cliques.- An algorithm for labeling edges of hierarchical drawings.- Elastic labels: The two-axis case.- Pitfalls of using PQ-trees in automatic graph drawing.- Graph drawing with no k pairwise crossing edges.- Area requirements for drawing hierarchically planar graphs.- A short proof of a Gauss problem.- A bayesian paradigm for dynamic graph layout.- Which aesthetic has the greatest effect on human understanding?.- Implementing a general-purpose edge router.- The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems.- 3DCube: A tool for three dimensional graph drawing.- Graph clustering using multiway ratio cut (Software demonstration).- ArchE: A graph drawing system for archaeology.- InteractiveGiotto: An algorithm for interactive orthogonal graph drawing.- GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends.- Lexical navigation: Using incremental graph drawing for query refinement.- Design gallery browsers based on 2D and 3D graph drawing (Demo).- Online animated graph drawing for web navigation.- Grappa: A graph package in java.- GraVis - System demonstration.- Touching graphs of unit balls.- Discrete realizations of contact and intersection graphs (extended abstract).- Minimum-area h-v drawings of complete binary trees.- Packing trees into planar graphs.- The three-phase method: A unified approach to orthogonal graph drawing.- NicheWorks - Interactive visualization of very large graphs.- Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams.- Graph drawing and manipulation with LINK.- Graph-drawing contest report.
「Nielsen BookData」 より