Article

Free access

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

Authors:

Jayaram Bhasker,

Sartaj SahniAuthors Info & Claims

DAC '86: Proceedings of the 23rd ACM/IEEE Design Automation Conference

Pages 108 - 114

Published: 02 July 1986 Publication History

PDF eReader

Abstract

We develop an Ο(n) algorithm to construct a rectangular dual of an n-vertex planar triangulated graph.

References

[1]

Bhusker 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.

Google Scholar

[2]

Bhasker J. and S. Sahni, A linear algorithm to find a rectangular dual of a planar grapg, Technic:~l Report TR 85-26, Computer Science Dept., University of Minnesota, Minneapolis, 1985.

Google Scholar

[3]

Brebner G. and D.Buchanan, On Compiling Structural Descriptions to Floorplans, Proc. IEEE CCAD, Santa Clara, Sept 1983, pp 6-7.

Google Scholar

[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.

Digital Library

Google Scholar

[5]

Horowil;z E. ~nd S.S~hni, Fundamentals of Data Structures in Pascal, Computer Science Press,Inc., Rockville, MD, 1984.

Digital Library

Google Scholar

[6]

Kozminski K. and E.Kinnen, An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Pl(mning for VLSI Integrated Circuits, Proc. 21st DAC, Albuquerque, June 1984, pp 655-656.

Digital Library

Google Scholar

[7]

Kozminski K. and E.Kinnen, Rectangular Dual of Planar Graphs, Networks (submitted for publication).

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

Wang RYoung ECheng C(2010)Complexity of 3-D floorplans by analysis of graph cuboidal dual hardnessACM Transactions on Design Automation of Electronic Systems10.1145/1835420.183542615:4(1-22)Online publication date: 7-Oct-2010
https://dl.acm.org/doi/10.1145/1835420.1835426
Wang RCheng CLombardi FBhanja SMassoud YBahar R(2009)On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit designProceedings of the 19th ACM Great Lakes symposium on VLSI10.1145/1531542.1531604(257-262)Online publication date: 10-May-2009
https://dl.acm.org/doi/10.1145/1531542.1531604
Wang JZhou HTang T(2005)Interconnect estimation without packing via ACG floorplansProceedings of the 2005 Asia and South Pacific Design Automation Conference10.1145/1120725.1120928(1152-1155)Online publication date: 18-Jan-2005
https://dl.acm.org/doi/10.1145/1120725.1120928
Show More Cited By

Index Terms

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

Recommendations

A linear algorithm to find a rectangular dual of a planar triangulated graph
Abstract
We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph.
Rectangular drawings of planar graphs

A plane graph is a planar graph with a fixed embedding in the plane. In a rectangular drawing of a plane graph, each vertex is drawn as a point, each edge is drawn as a horizontal or vertical line segment, and each face is drawn as a rectangle. A planar ...
On Floor-Plan of Plane Graphs

A floor-plan is a rectangle partitioned into a set of disjoint rectilinear polygonal regions (called modules). A floor-plan F represents a plane graph G as follows: Each vertex of G corresponds to a module of F and two vertices are adjacent in G iff ...

Comments

Information & Contributors

Information

Published In

DAC '86: Proceedings of the 23rd ACM/IEEE Design Automation Conference

July 1986

835 pages

ISBN:0818607025

Chairman:
Don Thomas
IBM, Thomas J. Watson Research Center, Yorktown Heights, NY

Publisher

IEEE Press

Publication History

Published: 02 July 1986

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

DAC '86 Paper Acceptance Rate 124 of 300 submissions, 41%;

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
436
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)8

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang RYoung ECheng C(2010)Complexity of 3-D floorplans by analysis of graph cuboidal dual hardnessACM Transactions on Design Automation of Electronic Systems10.1145/1835420.183542615:4(1-22)Online publication date: 7-Oct-2010
https://dl.acm.org/doi/10.1145/1835420.1835426
Wang RCheng CLombardi FBhanja SMassoud YBahar R(2009)On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit designProceedings of the 19th ACM Great Lakes symposium on VLSI10.1145/1531542.1531604(257-262)Online publication date: 10-May-2009
https://dl.acm.org/doi/10.1145/1531542.1531604
Wang JZhou HTang T(2005)Interconnect estimation without packing via ACG floorplansProceedings of the 2005 Asia and South Pacific Design Automation Conference10.1145/1120725.1120928(1152-1155)Online publication date: 18-Jan-2005
https://dl.acm.org/doi/10.1145/1120725.1120928
Otten RWiesel MHill D(2000)What is a floorplan?Proceedings of the 2000 international symposium on Physical design10.1145/332357.332400(201-206)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/332357.332400
Dasgupta PSur-Kolay SKahng ASarrafzadeh M(1997)Slicibility of rectangular graphs and floorplan optimizationProceedings of the 1997 international symposium on Physical design10.1145/267665.267706(150-155)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.1145/267665.267706
Sur-Kolay SBhattacharya BSchweikert D(1992)Canonical embedding of rectangular duals with applications to VLSI floorplanningProceedings of the 29th ACM/IEEE Design Automation Conference10.5555/113938.110428(69-74)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.5555/113938.110428
Sutanthavibul SShragowitz ERosen JSmith R(1991)An analytical approach to floorplan design and optimizationProceedings of the 27th ACM/IEEE Design Automation Conference10.1145/123186.123255(187-192)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/123186.123255
Jabri MShaklee DNewton A(1988)Automatic building of graphs for rectangular dualisationProceedings of the 25th ACM/IEEE Design Automation Conference10.5555/285730.285837(638-641)Online publication date: 1-Jun-1988
https://dl.acm.org/doi/10.5555/285730.285837

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations