Presentation 2005-10-18
Convex Drawings of Plane Graphs of Minimum Outer Apices
Kazuyuki MIURA, Machiko AZUMA, 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 G, every facial cycle of G is drawn as a convex polygon. A polygon for the outer facial cycle is called an outer convex polygon. A necessary and sufficient condition for a plane graph G to have a convex drawing is known. However, it has not been known how many apices of an outer convex polygon are necessary for G to have a convex drawing. In this paper, we show that the minimum number of apices of an outer convex polygon necessary for G to have a convex drawing is, in effect, equal to the number of leaves in a triconnected component decomposition tree of a new graph constructed from G, and that a convex drawing of G having the minimum number of apices can be found in linear time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Graph Drawing / Convex Drawing / Minimum Outer Apices
Paper # COMP2005-42
Date of Issue

Conference Information
Committee COMP
Conference Date 2005/10/11(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 Drawings of Plane Graphs of Minimum Outer Apices
Sub Title (in English)
Keyword(1) Graph Drawing
Keyword(2) Convex Drawing
Keyword(3) Minimum Outer Apices
1st Author's Name Kazuyuki MIURA
1st Author's Affiliation Faculty of Symbiotic Systems Science, Fukushima University()
2nd Author's Name Machiko AZUMA
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Takao NISHIZEKI
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2005-10-18
Paper # COMP2005-42
Volume (vol) vol.105
Number (no) 343
Page pp.pp.-
#Pages 7
Date of Issue