The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dado um gráfico plano G, queremos encontrar um desenho de G no plano tal que os vértices de G são representados como pontos de grade e as arestas são representadas como segmentos de linha reta entre seus pontos finais sem qualquer interseção de arestas. Esses desenhos são chamados desenhos planos em linha reta of G. Um objetivo adicional é minimizar a área da grade retangular na qual G é desenhado. Neste artigo, primeiro revisamos dois métodos conhecidos para encontrar tais desenhos, depois explicamos uma relação oculta entre eles e, finalmente, pesquisamos os resultados relacionados.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -