an algorithm for finding a rectangular dual of a planar graph for use in area planning for vlsi integrated circuits.
An O( n 2 ) algorithm for finding a rectangular dual of a planar triangulated graph is presented. In practice, almost linear running times have been observed. The algorithm is useful for solving area planning problems in VLSI IC design.
algorithm plan planar graph graph use integrated circuit practical design