Open rectangle-of-influence drawings of inner triangulated plane graphs

Authors:
Kazuyuki Miura;Tetsuya Matsuno;Takao Nishizeki
Affiliations:
Faculty of Symbiotic Systems Science, Fukushima University, Fukushima, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 5
Cited 0

Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Proximity Drawability: a Survey

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Rectangle-of-influence drawings of four-connected plane graphs: extended abstract

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45

Quantified Score

Hi-index	0.00

Visualization

Abstract

A straight-line drawing of a plane graph is called an open rectangle-of-influence drawing if there is no vertex in the proper inside of the axis-parallel rectangle defined by the two ends of every edge. In an inner triangulated plane graph, every inner face is a triangle although the outer face is not always a triangle. In this paper, we first obtain a sufficient condition for an inner triangulated plane graph G to have an open rectangle-of-influence drawing; the condition is expressed in terms of a labeling of angles of a subgraph of G. We then present an O(n1.5/log n)-time algorithm to examine whether G satisfies the condition and, if so, construct an open rectangle-of-influence drawing of G on an (n-1)×(n-1) integer grid, where n is the number of vertices in G.