Planar Drawings of Plane Graphs(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Nakano Shin-ichi

  The Department Of Computer Science Faculty Of Engineering Gunma University

関連論文

• A Linear-Time algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs
• Planar Drawings of Plane Graphs(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク