论文信息 - On Finding the Rectangular Duals of Planar Triangular Graphs

On Finding the Rectangular Duals of Planar Triangular Graphs

This paper presents a new linear-time algorithm for finding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previously known algorithm. The coordinates of the rectangular dual constructed by the new algorithm are integers and carry clear combinatorial meaning.

Xin He | Xin He

[1] William R. Heller,et al. The Planar Package Planner for System Designers , 1982, DAC 1982.

[2] Edwin Kinnen,et al. Rectangular duals of planar graphs , 1985, Networks.

[3] Carsten Thomassen,et al. Interval representations of planar graphs , 1986, J. Comb. Theory, Ser. B.

[4] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .

[5] Sartaj Sahni,et al. A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph , 1987, Networks.

[6] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[8] Jeffrey Scott Vitter,et al. Optimal parallel algorithms for transitive closure and point location in planar structures , 1989, SPAA '89.

[9] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, 19th Design Automation Conference.

[10] Roberto Tamassia,et al. Fully dynamic techniques for point location and transitive closure in planar structures , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..