A simple linear time algorithm for proper box rectangular drawings of plane graphs

被引:10
|
作者
He, X [1 ]
机构
[1] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA
基金
美国国家科学基金会;
关键词
D O I
10.1006/jagm.2001.1161
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we introduce a new style of drawing a plane graph G, called proper box rectangular (PBR) drawing. It is defined to be: a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a Vertical line segment, and each face is drawn as a rectangle. We establish necessary and sufficient conditions for G to have a PER drawing. We also give a simple Linear time algorithm for finding such drawings. The PER drawing is closely related to the box rectangular (BR) drawing defined by M. S. Rahman, S. Nakano and T. Nishizeki (2000, J. Algorithms 37, 363-398). Our method can he adapted to provide a new algorithm for solving the BR drawing problem. (C) 2001 Academic Press.
引用
收藏
页码:82 / 101
页数:20
相关论文
共 50 条