Abstract

We provide O(n)-time algorithms for constructing the following types of drawings of n-vertex 3-connected planar graphs: ffl 2D convex grid drawings with (3n) × (3n/2) area under the edge L 1 -resolution rule; ffl 2D strictly convex grid drawings with O(n³) × O(n³) area under the edge resolution rule; ffl 2D strictly convex drawings with O(1) × O(n) area under the vertex-resolution rule, and with vertex coordinates represented by O(n log n)-bit rational numbers; ffl 3D convex drawings with O(1) × O(1) × O(n) volume under the vertex-resolution rule, and with vertex coordinates represented by O(n log n)-bit rational numbers. We also

Citations