Two algorithms for finding rectangular duals of planar graphs

  • Goos Kant
  • Xin He
Conference paper

DOI: 10.1007/3-540-57899-4_69

Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)
Cite this paper as:
Kant G., He X. (1994) Two algorithms for finding rectangular duals of planar graphs. In: van Leeuwen J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Goos Kant
    • 1
  • Xin He
    • 2
  1. 1.Department of Computer ScienceUtrecht UniversityCH Utrechtthe Netherlands
  2. 2.Department of Computer ScienceState University of New York at BuffaloBuffaloUSA

Personalised recommendations