A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- 1 January 1987
- Vol. 17 (3) , 307-317
- https://doi.org/10.1002/net.3230170306
Abstract
We develop a linear time algorithm to determine if a given planar triangulated graph has a rectangular dual.Keywords
This publication has 4 references indexed in Scilit:
- A Linear Algorithm to Find a Rectangular Dual of a Planar TriangulatedPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated CircuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- On finding Most Optimal Rectangular Package PlansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- The Planar Package Planner for System DesignersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982