Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken

Klau, G. W. (1997). Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-397C-B Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A7E3-6
Genre: Hochschulschrift

Dateien

einblenden: Dateien
ausblenden: Dateien
:
diplom.ps.gz (beliebiger Volltext), 475KB
 
Datei-Permalink:
-
Name:
diplom.ps.gz
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/gzip
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Klau, Gunnar W.1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Drawing a graph nicely in the plane is a challenging task and mostly the appropriate problems of maximizing several aesthetic criteria are NP--complete. This thesis addresses the problem of finding an embedding for a given planar graph such that the nodes are drawn on integer grid points and the edges are following the horizontal and vertical grid lines without crossing each other. These drawings are known as {\em orthogonal grid drawings} and are highly accepted in practical applications such as automatic drawing of diagrams and VLSI--design if the number of bends in the drawing is low. We present an algorithm that extends an approach known as Tamassia's bend minimization algorithm which produces a bend--optimal drawing for a planar graph with a fixed planar representation and maximal degree of four. Therefore we introduce the concept of {\em quasi--orthogonal grid embeddings} which allow the edges to run locally between grid points in order to cope with graphs that have an arbitrarily high degree. Furthermore a new method for compacting the size of the drawing is proposed. The appendix of the thesis contains the full {\tt cweb}--documented implementation, demos can be found in {\tt /KM/usr/gdraw/DEMO/ortho}.

Details

einblenden:
ausblenden:
Sprache(n): deu - German
 Datum: 2010-03-0219971997
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 517742
Anderer: Local-ID: C1256428004B93B8-4B54EBD9F73645DEC12565B7005E795F-Klau97a
 Art des Abschluß: Master

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: