Presentation 1999/10/25
Grid Drawings of Four-Connected Plane Graphs
Kazuyuki Miura, Shin-ichi Nakano, Takao Nishizeki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on plane grid points and all edges are drawn as straight line segments between their endpoints without any edge-intersection. In this paper we give a very simple algorithm to find a grid drawing of any given 4-connected plane graph G with four or more vertices on the outer face. The algorithm takes time O(n) and needs a rectangular grid of width [n/2]-1 and height [n/2] if G has n vertices. The algorithm is best possible in the sense that there are an infinite number of 4-connected plane graphs any grid drawings of which need rectangular grids of width [n/2]-1 and height [n/2].
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Graph / Drawing / Algorithm
Paper # COMP99-42
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/10/25(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) Grid Drawings of Four-Connected Plane Graphs
Sub Title (in English)
Keyword(1) Graph
Keyword(2) Drawing
Keyword(3) Algorithm
1st Author's Name Kazuyuki Miura
1st Author's Affiliation Guraduate School of Information Sciences, Tohoku University()
2nd Author's Name Shin-ichi Nakano
2nd Author's Affiliation Department of Computer Science, Faculty of Engineering Gunma University
3rd Author's Name Takao Nishizeki
3rd Author's Affiliation Guraduate School of Information Sciences, Tohoku University
Date 1999/10/25
Paper # COMP99-42
Volume (vol) vol.99
Number (no) 388
Page pp.pp.-
#Pages 8
Date of Issue