Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints

Authors:
Seok-Hee Hong;Hiroshi Nagamochi
Affiliations:
School of Information Technologies, University of Sydney,;Department of Applied Mathematics and Physics, Kyoto University,
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 3
Cited 2

On-Line Planarity Testing

SIAM Journal on Computing
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Convex drawings of graphs with non-convex boundary

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

Non-convex Representations of Graphs

Graph Drawing
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints

Theoretical Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

A star-shapeddrawing of a graph is a straight-line drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. In this paper, given a biconnected planar graph Gwith fixed plane embedding and a subset Aof corners of G, we consider the problem of finding a star-shaped drawing Dof Gsuch that only corners in Aare allowed to become concave corners in D. We first characterize a necessary and sufficient condition for a subset Aof corners to admit such a star-shaped drawing D. Then we present a linear time algorithm for finding such a star-shaped drawing D. Our characterization includes Thomassen's classical characterization of biconnected plane graphs with a prescribed boundary that have convex drawings.