Strictly convex drawings of planar graphs

Details Strictly convex drawings of planar graphs Strictly convex drawings of planar graphs

2005-07-11

arxiv.org/abs/cs/0507030v2

DOCUMENTA MATHEMATICA, Vol. 11 (2006), 369-391

Computer Science

Computational Geometry

20 pages, 13 figures. to be published in Documenta Mathematica. The revision includes numerous small additions, corrections, a

Scientific paper

Every three-connected planar graph with n vertices has a drawing on an O(n^2) x O(n^2) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. More generally, a strictly convex drawing exists on a grid of size O(W) x O(n^4/W), for any choice of a parameter W in the range n

Affiliated with

Also associated with

No associations

Rating

Strictly convex drawings of planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strictly convex drawings of planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strictly convex drawings of planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371956