A Better Heuristic for Orthogonal Graph Drawings
A Better Heuristic for Orthogonal Graph Drawings
复制标题
正交图绘制的更好启发式
DOI：
10.1007/bfb0049394
复制
发表时间：
1994
影响因子：
1.8
通讯作者：
G. Kant
中科院分区：
文献类型：
--
作者：
T. Biedl;G. Kant
图的正交绘制是平面中的嵌入，使得所有边都被绘制为水平和垂直段的序列。本文提出了一个线性时空算法，用于在n×n的网格上画任意连通图，最多可画2n+2个弯。每个边缘最多弯曲两次。
An orthogonal drawing of a graph is an embedding in the plane such that all edges are drawn as sequences of horizontal and vertical segments. We present a linear time and space algorithm to draw any connected graph orthogonally on a grid of size n×n with at most 2n+2 bends. Each edge is bent at most twice.