A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4099324
Language Label Description Also known as
default for all languages
No label defined
    English
    A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
    scientific article; zbMATH DE number 4099324

      Statements

      A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (English)
      0 references
      0 references
      1987
      0 references
      planar graph
      0 references
      triangulated graphs
      0 references
      components
      0 references
      rectangular dual
      0 references
      algorithm
      0 references
      0 references
      0 references
      0 references
      Let G be a graph representing a rectangular chip; the vertices of G represent circuit clusters or functional modules that are to be assigned a rectangular space on the chip and an edge (i,j) represents the requirement that modules i and j are adjacent. A rectangular dual of G is an assignment of modules to non-overlapping rectangular areas on the chip such that module adjacencies specified by the edges are satisfied. Necessary and sufficient conditions for the existence of a rectangular dual when G is planar are: 1. Every face (except the exterior) is a triangle, 2. All internal vertices have degree \(\geq 4,\) 3. All cycles that are not faces have length \(\geq 4.\) The authors develop on O(n) algorithm to determine if a planar graph G satisfies conditions 1 and 3 above. They prove that if conditions 1 and 3 are satisfied, then so is condition 2. Their algorithm restricts attention to biconnected components of G.
      0 references

      Identifiers