Rectangular drawings of plane graphs without designated corners
暂无分享,去创建一个
[1] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.
[2] Krzysztof Kozminski,et al. An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits , 1984, 21st Design Automation Conference Proceedings.
[3] Shin-Ichi Nakano,et al. Box-Rectangular Drawings of Plane Graphs , 1999, J. Algorithms.
[4] Shin-Ichi Nakano,et al. Rectangular grid drawings of plane graphs , 1998, Comput. Geom..
[5] Goos Kant,et al. Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..
[6] Xin He,et al. On Finding the Rectangular Duals of Planar Triangular Graphs , 1993, SIAM J. Comput..
[7] Shoji Shinoda,et al. On area-efficient drawings of rectangular duals for VLSI floor-plan , 1991, Math. Program..