Planar Drawings of Plane Graphs
Summary :
Given a plane graph G, we wish to find a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.384-391
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
- Graph Algorithms
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shin-ichi NAKANO, "Planar Drawings of Plane Graphs" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 384-391, March 2000, doi: .
Abstract: Given a plane graph G, we wish to find a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_384/_p
Copy
@ARTICLE{e83-d_3_384,
author={Shin-ichi NAKANO, },
journal={IEICE TRANSACTIONS on Information},
title={Planar Drawings of Plane Graphs},
year={2000},
volume={E83-D},
number={3},
pages={384-391},
abstract={Given a plane graph G, we wish to find a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Planar Drawings of Plane Graphs
T2 - IEICE TRANSACTIONS on Information
SP - 384
EP - 391
AU - Shin-ichi NAKANO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - Given a plane graph G, we wish to find a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.
ER -
English
