首页> 外文会议>Graph Drawing; Lecture Notes in Computer Science; 4372 >Three-Dimensional Drawings of Bounded Degree Trees
【24h】

Three-Dimensional Drawings of Bounded Degree Trees

机译:有界度树的三维图

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

摘要

We show an algorithm for constructing 3D straight-line drawings of balanced constant degree trees. The drawings have linear volume and optimal aspect ratio. As a side effect, we also give an algorithm for constructing 2D drawings of balanced constant degree trees in linear area, with optimal aspect ratio and with better angular resolution with respect to the one of [8]. Further, we present an algorithm for constructing 3D poly-line drawings of trees whose degree is bounded by n~(1/3) in linear volume and with optimal aspect ratio.
机译:我们展示了一种构建平衡的恒定度树的3D直线图形的算法。这些图具有线性体积和最佳纵横比。作为副作用,我们还给出了一种算法,该算法可在线性区域中构建平衡的恒定度树的2D图,相对于[8]中的一种,该图具有最佳的长宽比和更好的角度分辨率。此外,我们提出了一种构建树木的3D折线图的算法,该树木的度数以线性体积的n〜(1/3)为界,并且具有最佳的长宽比。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号