A study of convex grid drawing algorithms of plane graphs with contours of k-gon
| Project/Area Number |
23700008
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Fukushima University |
|---|
Principal Investigator |
MIURA Kazuyuki 福島大学, 共生システム理工学類, 准教授 (80333871)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Keywords | アルゴリズム / 平面グラフ / 格子凸描画 |
|---|
| Research Abstract |
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points.
In this study, we first show that an internally triconnected plane graph G has a convex grid drawing on a 2n x 2n grid if the triconnected component decomposition tree T(G) has exactly four leaves. We also present an algorithm to find such a drawing in linear time. We then show that an internally triconnected plane graph G has a convex grid drawing on a 6n x n2 grid if T(G) has exactly five leaves. We also present an algorithm to find such a drawing in linear time. Furthermore, We show that an internally triconnected plane graph G has a convex grid drawing on a 6n x n2 grid if T(G) has exactly six leaves. We also present an algorithm to find such a drawing in linear time.
|
Report
(4 results)
Research Products
(23 results)
