网站大量收购独家精品文档,联系QQ:2885784924

[计算机]网络和通讯_GD97 Graph-Drawing ContestGD97-图的绘画比赛.pdf

[计算机]网络和通讯_GD97 Graph-Drawing ContestGD97-图的绘画比赛.pdf

  1. 1、本文档共4页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
[计算机]网络和通讯_GD97 Graph-Drawing ContestGD97-图的绘画比赛

GD97 Graph-Drawing Contest(GD97- 图的绘画比赛) 数据摘要: The fourth annual graph-drawing contest will be held in conjunction with Graph Drawing 97. This year the contest will feature one artificial graph designed specifically to challenge orthogonal graph-drawing algorithms. The other two contest graphs contain real-world data. One of these graphs can be drawn using any graph-drawing technique, but the other is to be explored and visualized interactively. Winning entries for each graph will be chosen by a panel of experts. Drawings of the first two graphs may be submitted electronically or by mail. Videos illustrating the interactive investigation of the third graph may be submitted in VHS NTSC or PAL formats. All submissions must be received before midnight, September 10, 1997. (Note: This is a hard deadline.) A prize fund of $750 (U.S.) is anticipated. As usual, the winning entries will be described in the GD symposium proceedings. 中文关键词: GD97, 图的绘画比赛,现实世界的数据,人工图, 英文关键词: GD97,Graph-Drawing Competition,Real-world data,Artificial graph, 数据格式: TEXT 数据用途: The data can be used for Networks Communications. 数据详细介绍: GD97 Graph-Drawing Contest  Abstract The fourth annual graph-drawing contest will be held in conjunction with Graph Drawing 97. This year the contest will feature one artificial graph designed specifically to challenge orthogonal graph-drawing algorithms. The other two contest graphs contain real-world data. One of these graphs can be drawn using any graph-drawing technique, but the other is to be explored and visualized interactively. Winning entries for each graph will be chosen by a panel of experts. Drawings of the first two graphs may be submitted electronically or by mail. Videos illustrating the interactive investigation of the third graph may be submitted in VHS NTSC

文档评论(0)

ipbohn97 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档