A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated

A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated

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

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bhasker, J., Sahni, S.
Format: Tagungsbericht
Sprache:eng ; jpn
Schlagworte:
algorithm
Circuits
complexity
Design automation
floor planning
Floors
planar triangulated graph
Rectangular dual
Sufficient conditions
Terminology
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We develop an O(n) algorithm to construct a rectangular dual of an n-vertex planar triangulated graph.
ISSN:0738-100X
DOI:10.1109/DAC.1986.1586076