论文信息 - Two Algorithms for Finding Rectangular Duals of Planar Graphs

Two Algorithms for Finding Rectangular Duals of Planar Graphs

We present two linear-time algorithms for computing a regular edge labeling of 4-connected planar triangular graphs. This labeling is used to compute in linear time a rectangular dual of this class of planar graphs. The two algorithms are based on totally different frameworks, and both are conceptually simpler than the previous known algorithm and are of independent interests. The first algorithm is based on edge contraction. The second algorithm is based on the canonical ordering. This ordering can also be used to compute more compact visibility representations for this class of planar graphs.

Goos Kant | Xin He

[1] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[2] Xin He,et al. On Finding the Rectangular Duals of Planar Triangular Graphs , 1993, SIAM J. Comput..

[3] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.

[4] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..

[5] Ioannis G. Tollis,et al. Algorithms for automatic graph drawing: an annotated bibliography , 1994 .

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

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

[8] Goos Kant,et al. Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9] Xin He. Efficient Parallel Algorithms for Two Graph Layout Problems , 1991 .

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

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