Algorithmica

, Volume 3, Issue 1, pp 247–278

A linear algorithm to find a rectangular dual of a planar triangulated graph

  • Jayaram Bhasker
  • Sartaj Sahni
Article

DOI: 10.1007/BF01762117

Cite this article as:
Bhasker, J. & Sahni, S. Algorithmica (1988) 3: 247. doi:10.1007/BF01762117

Abstract

We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph.

Key words

Rectangular dualPlanar triangulated graphAlgorithmComplexityFloor planning

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Jayaram Bhasker
    • 1
  • Sartaj Sahni
    • 1
  1. 1.University of MinnesotaMinneapolisUSA
  2. 2.Corporate Systems Development DivisionHoneywell Inc.Golden ValleyUSA