A linear algorithm to find a rectangular dual of a planar triangulated graph

Proceedings - Design Automation Conference

Volumn , Issue , 1986, Pages 108-114

  Bhasker, Jayaram ^a,b   Sahni, Sartaj ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b HONEYWELL   (United States)

Author keywords

Algorithm; Complexity; Floor planning; Planar triangulated graph; Rectangular dual

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN;

COMPLEXITY; FLOOR-PLANNING; LINEAR ALGORITHMS; PLANAR TRIANGULATED GRAPH; RECTANGULAR DUAL;

COMPUTATIONAL COMPLEXITY;

EID: 85051252368     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DAC.1986.1586076     Document Type: Conference Paper

References (8)

1. Bhasker J. and S. Sahni, A Linear Algorithm to Check for the Existence of a Rectangular Dual of a Planar Triangulated Graph, Technical report, Computer Science Dept., University of Minnesota, Minneapolis, 1985.
2. Bhasker J. and S. Sahni, A linear algorithm to find a rectangular dual of a planar grapg, Technical Report TR 85-26, Computer Science Dept., University of Minnesota, Minneapolis, 1985.
3. Brebner G. and D. Buchanan, On Compiling Structural Descriptions to Floorplans, Proc. IEEE ICCAD, Santa Clara, Sept 1983, pp 6-7.
4. Heller W.R., G. Sorkin and K. Maling, The Planar Package Planner for System Designers, Proc. 19th DAC, Las Vegas, June 1982, pp 253-260.
5. Horowitz E. and S. Sahni, Fundamentals of Data Structures in Pascal, Computer Science Press.Inc, Rockville, MD, 1984.
6. Kozminski K. and E. Kinnen, An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits, Proc. 21st DAC, Albuquerque, June 1984, pp 655-656.
7. Kozminski K. and E. Kinnen, Rectangular Dual of Planar Graphs, Networks (submitted for publication).
8. Maling K., S.H. Mueller and W.R. Heller, On Finding Most Optimal Rectangular Package Plans, Proc. 19th DAC, Las Vegas, June 1982, pp 663-670.