, Volume 3, Issue 1, pp 247-278

First online:

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

  • Jayaram BhaskerAffiliated withUniversity of Minnesota
  • , Sartaj SahniAffiliated withUniversity of Minnesota

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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

Key words

Rectangular dual Planar triangulated graph Algorithm Complexity Floor planning