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

  • Authors:
  • Jayaram Bhasker;Sartaj Sahni

  • Affiliations:
  • University of Minnesota;University of Minnesota

  • Venue:
  • DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop an &Ogr;(n) algorithm to construct a rectangular dual of an n-vertex planar triangulated graph.