| Presentation | 2006-10-17 Convex Grid Drawings of Plane Graphs with Rectangular Contours Akira KAMADA, Kazuyuki MIURA, Takao NISHIZEKI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-in-tersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points. A plane graph G has a convex drawing if and only if G is internally triconnected, and an internally triconnected plane graph G has a convex grid drawing on an n×n grid if G is triconnected or the triconnected component decomposition tree T(G) of G has two or three leaves, where n is the number of vertices in G. In this paper, we show that an internally triconnected plane graph G has a convex grid drawing on a 2n×n^2 grid if T(G) has exactly four leaves. We also present an algorithm to find such a drawing in linear time. Our convex grid drawing has a rectangular contour, while most of the known algorithms produce grid drawings having triangular contours. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | algorithm / convex grid drawing / graph drawing / plane graph / triconnected |
| Paper # | COMP2006-31 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2006/10/10(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Convex Grid Drawings of Plane Graphs with Rectangular Contours |
| Sub Title (in English) | |
| Keyword(1) | algorithm |
| Keyword(2) | convex grid drawing |
| Keyword(3) | graph drawing |
| Keyword(4) | plane graph |
| Keyword(5) | triconnected |
| 1st Author's Name | Akira KAMADA |
| 1st Author's Affiliation | Graduate School of Information Sciences, Tohoku University() |
| 2nd Author's Name | Kazuyuki MIURA |
| 2nd Author's Affiliation | Faculty of Symbiotic Systems Science, Fukushima University |
| 3rd Author's Name | Takao NISHIZEKI |
| 3rd Author's Affiliation | Graduate School of Information Sciences, Tohoku University |
| Date | 2006-10-17 |
| Paper # | COMP2006-31 |
| Volume (vol) | vol.106 |
| Number (no) | 289 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |