首页> 外文会议>Fun with Algorithms; Lecture Notes in Computer Science; 4475 >On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
【24h】

On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features

机译:将具有最大弯曲数和其他不良特征的图形嵌入到网格中

获取原文
获取原文并翻译 | 示例

摘要

Graph Drawing is (usually) concerned with the production of readable representations of graphs. In this paper, instead of investigating how to produce "good" drawings, we tackle the opposite problem of producing "bad" drawings. In particular, we study how to construct orthogonal drawings with many bends along the edges and with large area. Our results show surprising contact points, in Graph Drawing, between the computational cost of niceness and the one of ugliness.
机译:(通常)“图形绘图”与图形的可读表示的产生有关。在本文中,我们没有研究如何产生“好”图纸,而是解决了产生“坏”图纸的相反问题。尤其是,我们研究如何构建沿边有很多弯曲且面积较大的正交图形。我们的结果表明,在Graph Drawing中,令人惊讶的接触点是精美度和丑陋度之间的计算成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号