Orthogonal Drawings of Plane Graphs Without Bends
暂无分享,去创建一个
Md. Saidur Rahman | Takao Nishizeki | Mahmuda Naznin | Takao Nishizeki | Mahmuda Naznin | M. S. Rahman
[1] Md. Saidur Rahman,et al. Bend-Minimum Orthogonal Drawings of Plane 3-Graphs , 2002, WG.
[2] Shin-Ichi Nakano,et al. Box-Rectangular Drawings of Plane Graphs , 1999, J. Algorithms.
[3] Roberto Tamassia,et al. On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..
[4] Roberto Tamassia,et al. A New Minimum Cost Flow Algorithm with Applications to Graph Drawing , 1996, GD.
[5] Shin-Ichi Nakano,et al. Rectangular grid drawings of plane graphs , 1996, Comput. Geom..
[6] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[7] Roberto Tamassia,et al. On the Compuational Complexity of Upward and Rectilinear Planarity Testing , 1994, Graph Drawing.
[8] Roberto Tamassia,et al. On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..
[9] Shin-Ichi Nakano,et al. Rectangular drawings of plane graphs without designated corners , 2000, Comput. Geom..