, Volume 3, Issue 1-4, pp 247-278

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

Purchase on Springer.com

$39.95 / €34.95 / £29.95*

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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

This research was supported in part by the National Science Foundation under Grant MCS-83-05567.
Communicated by David S. Johnson.