Graduate Thesis Or Dissertation
 

Drawing graphs nicely

Pubblico Deposited

Contenuto scaricabile

Scarica il pdf
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/41687m723

Descriptions

Attribute NameValues
Creator
Abstract
  • A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We discuss the history of this field, and look at several algorithms for drawing graphs. For planar graphs this problem has been algorithmically solved: that is, there is an algorithm which takes a n vertex planar graph and places the vertices at some of the nodes of an n-2 by 2n-4 array so that each edge of the planar graph can be drawn with a straight line. We describe in detail one particular implementation of this algorithm, give some examples in which this embedding is pleasing, and give a number of examples in which this grid embedding is not as visually pleasing another drawing of the same graph. For the more difficult problem of drawing a nonplanar graph, we investigate a spring based algorithm. We give a number of examples in which this heuristic produces more pleasing drawings than those produced by the planar embedding and a few cases where it fails to do so.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Dichiarazione dei diritti
Publisher
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 8-bit Grayscale) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces

Le relazioni

Parents:

This work has no parents.

In Collection:

Elementi

Thumbnail Titolo Data caricata Visibilità Azioni
file details PalmerPaulA1997.pdf 2017-08-19 Pubblico Scaricare