Extended Rectangular Drawings of Plane Graphs with Designated Corners

1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing, Prentice Hall, NJ (1999).

   Google Scholar 

2. J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3, pp.247–278, 1988.

   MATH  MathSciNet  Google Scholar 

3. A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing’96, Lect. Notes in Computer Science, 1190, pp. 201–206, 1997.

   Google Scholar 

4. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 22, 6, pp. 1218–1226, 1993.

   Article  MATH  MathSciNet  Google Scholar 

5. X. He, On floor-plan of plane graphs, SIAM J. Comput., 28, 6, pp. 2150–2167, 1999.

   Article  MATH  MathSciNet  Google Scholar 

6. G. Kant and X. He, Regular edge-labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci., 172, pp.175–193, 1997.

   Article  MATH  MathSciNet  Google Scholar 

7. K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSIinte grated circuits, Proc. of 21st DAC, Albuquerque, pp. 655–656, 1984.

   Google Scholar 

8. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990.

   Google Scholar 

9. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Computational Geometry, 21, pp. 121–138, 2002.

   Article  MATH  MathSciNet  Google Scholar 

10. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Comp. Geom. Theo. Appl., 10(3), pp. 203–220, 1998.

    MATH  MathSciNet  Google Scholar 

11. C. Thomassen, Plane representations of graphs, J. A. Bondy, U. S. R. Murty (Eds.), Progress in Graph Theory, Academic Press Canada, Don Mills, Ontario, Canada, pp. 43–69, 1984.

    Google Scholar 

Download references