Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Space-Filling Technique for the Visualization of Planar st-graph
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
2012 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Graphs currently attract an increasing number of computer scientists due to their widely adoptions in different areas. However, when people perform graph drawing, one of the most critical issues they need to concern is atheistics, i.e., to make the graph more suitable for human perceptions. In this work, we will aim at exploring one specific kind of graph ''planar st-graphs'' with space-filling technique in Info Vis area. We would cover edge crossing elimination, layer assignment, graph drawing algorithms, and new development of space-filling technique in planar st-graphs drawing etc. The final aim of this project is to develop a new algorithm to draw planar st-graphs based on a space-filling visualization approach with minimum edge crossings and maximum space usage.

Place, publisher, year, edition, pages
2012. , 42 p.
Keyword [en]
Information Visualization, Planar st-graph, Space-filling
National Category
Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-21033OAI: oai:DiVA.org:lnu-21033DiVA: diva2:543193
Subject / course
Computer Science
Presentation
2012-05-31, 11:35 (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2012-08-07 Created: 2012-08-07 Last updated: 2012-08-07Bibliographically approved

Open Access in DiVA

SpaceFilling(1294 kB)