Convex Grid Drawings of 3-Connected Planar Graphs

Convex Grid Drawings of 3-Connected Planar Graphs (1994)

by M. Chrobak , G. Kant

Citations:

34 - 7 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Convex Grid Drawings of 3-Connected Planar Graphs	user correction - Legacy Corrections
AUTHOR NAME	M. Chrobak	user correction - Legacy Corrections
AUTHOR NAME	G. Kant	user correction - Legacy Corrections
ABSTRACT	We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, non-intersecting line segments and faces are convex polygons. We present a linear-time algorithm which, given an n-vertex 3connected plane graph G (with n 3), finds such a straight-line convex embedding of G into a (n \Gamma 2) \Theta (n \Gamma 2) grid. 1 Introduction In this paper we consider the problem of aesthetic drawing of plane graphs, that is, planar graphs that are already embedded in the plane. What is exactly an aesthetic drawing is not precisely defined and, depending on the application, different criteria have been used. In this paper we concentrate on the two following criteria: (a) edges should be represented by straight-line segments, and (b) faces should be drawn as convex polygons. F'ary [6], Stein [14] and Wagner [18] showed, independently, that each planar graph can be drawn in the plane in such a way that ...	user correction - Legacy Corrections
YEAR	1994	user correction - Legacy Corrections
CITATIONS	17 found	ParsCit 1.0