A linear algorithm to find a rectangular dual of a planar triangulated graph - Algorithmica
- ️Sahni, Sartaj
- ️Tue Nov 01 1988
Abstract
We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
Similar content being viewed by others
References
J. Bhasker and S. Sahni, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph,Networks,17 (1987), 307–317.
G. Brebner and D. Buchanan, On compiling structural descriptions to floorplans,Proceedings of the IEEE International Conference on Computer-Aided Design, Santa Clara, 1983, pp. 6–7.
J. Grason, A dual linear graph representation for space filling problem of the floor plan type, inEmerging Methods in Environmental Design and Planning (G. T. Moore, ed.), Proceedings of the design methods group, First International Conference, Cambridge, MA, 1968, pp. 170–178.
W. R. Heller, G. Sorkin, and K. Maling, The planar package planner for system designers,Proceedings of the 19th Design Automation Conference, Las Vegas, 1982, pp. 253–260.
E. Horowitz and S. Sahni,Fundamentals of Data Structures in Pascal, Computer Science Press, Rockville, MD, 1984.
K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits,Proceedings of the 21st Design Automation Conference, Alburquerque, 1984, pp. 655–656.
K. Kozminski and E. Kinnen, Rectangular dual of planar graphs,Networks (submitted).
K. Maling, S. H. Mueller, and W. R. Heller, On finding most optimal rectangular package plans,Proceedings of the 19th Design Automation Conference, Las Vegas, 1982, pp. 663–670.
Author information
Author notes
Jayaram Bhasker
Present address: Corporate Systems Development Division, Honeywell Inc., 1000 Boone Ave North, 55427, Golden Valley, MN, USA
Authors and Affiliations
University of Minnesota, Minneapolis, Minnesota, USA
Jayaram Bhasker & Sartaj Sahni
Authors
- Jayaram Bhasker
You can also search for this author in PubMed Google Scholar
- Sartaj Sahni
You can also search for this author in PubMed Google Scholar
Additional information
Communicated by David S. Johnson.
This research was supported in part by the National Science Foundation under Grant MCS-83-05567.
Rights and permissions
About this article
Cite this article
Bhasker, J., Sahni, S. A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247–278 (1988). https://doi.org/10.1007/BF01762117
Received: 01 August 1986
Revised: 10 November 1986
Issue Date: November 1988
DOI: https://doi.org/10.1007/BF01762117