Paper Info
Title
Box-Rectangular Drawings of Plane Graphs
Abstract
In this paper we introduce a new drawing style of a plane graph G, called a "box-rectangular drawing." It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a simple linear-time algorithm to find a box-rectangular drawing of G if it exists.
Year
DOI
Venue
2000
10.1006/jagm.2000.1105
Journal of Algorithms
Keywords
DocType
Volume
sufficient condition,integer grid,Box-Rectangular Drawings,horizontal line segment,plane graph G,new drawing style,Plane Graphs,vertical line segment,box-rectangular drawing,simple linear-time algorithm
Journal
37
Issue
ISSN
ISBN
2
0196-6774
3-540-66731-8
Citations 
PageRank 
References 
11
0.79
16
Authors
2
Name
Order
Citations
PageRank
Shin-ichi Nakano124624.40
Takao Nishizeki21771267.08