论文信息 - A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph - 字舞流文

A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph

On developpe un algorithme en temps lineaire pour determiner si un graphe planaire triangule donne possede un dual rectangulaire

Sartaj Sahni | Jayaram Bhasker | S. Sahni | J. Bhasker

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[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] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[4] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, 19th Design Automation Conference.

[5] William R. Heller,et al. The Planar Package Planner for System Designers , 1982, 19th Design Automation Conference.

[6] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .

[7] Ellis Horowitz,et al. Fundamentals of Data Structures in Pascal , 1984 .