On Finding the Rectangular Duals of Planar Triangular Graphs
On Finding the Rectangular Duals of Planar Triangular Graphs
复制标题
关于寻找平面三角形图的矩形对偶
DOI：
10.1137/0222072
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
Xin He
中科院分区：
文献类型：
--
作者：
Xin He
本文提出了一种新的求平面三角图矩形的线性时间算法。该算法在概念上比以前已知的算法简单。新算法构造的矩形对偶的坐标是整数，具有明确的组合意义。
This paper presents a new linear-time algorithm for finding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previously known algorithm. The coordinates of the rectangular dual constructed by the new algorithm are integers and carry clear combinatorial meaning.