An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits

Krzysztof Kozminski, Edwin Kinnen. An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits. In Patricia H. Lambert, Hillel Ofek, Lawrence A. O'Neill, Pat O. Pistilli, Paul Losleben, J. D. Nash, Dennis W. Shaklee, Bryan T. Preas, Harvey N. Lerman, editors, Proceedings of the 21st Design Automation Conference, DAC '84, Albuquerque, New Mexico, June 25-27, 1984. pages 655-656, ACM/IEEE, 1984. [doi]

Abstract

Abstract is missing.