MPI-I-98-1-013

Quasi-orthogonal drawing of planar graphs

Klau, Gunnar W. and Mutzel, Petra

MPI-I-98-1-013. May 1998, 15 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Orthogonal drawings of graphs are highly accepted in practice. For planar
graphs with vertex degree of at most four, Tamassia gives a polynomial time
algorithm which computes a region preserving orthogonal grid embedding with the
minimum number of bends. However, the graphs arising in practical applications
rarely have bounded vertex degree. In order to cope with general planar
graphs, we introduce the quasi--orthogonal drawing model. In this model,
vertices are drawn on grid points, and edges follow the grid paths except around
vertices of high degree. Furthermore we present an extension of Tamassia's
algorithm that constructs quasi--orthogonal drawings. We compare the drawings
to those obtained using related approaches.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	303 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-1-013

BibTeX
@TECHREPORT{KlauMutzel98-1-013, AUTHOR = {Klau, Gunnar W. and Mutzel, Petra}, TITLE = {Quasi-orthogonal drawing of planar graphs}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-98-1-013}, MONTH = {May}, YEAR = {1998}, ISSN = {0946-011X},}