A linear algorithm to find a rectangular dual of a planar triangulated graph
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4) , 247-278
- https://doi.org/10.1007/bf01762117
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graphNetworks, 1987
- 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