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
Comparison and implementation of graph visualization algorithms using JavaFX
Linköping University, Department of Computer and Information Science, Database and information techniques.
2016 (English)Independent thesis Basic level (university diploma), 10,5 credits / 16 HE creditsStudent thesis
Abstract [en]

Graph drawing is an important area in computer science and it has many different application areas. For example, graphs can be used to visualize structures like networks and databases. When the graphs are really big, however, it becomes difficult to draw them so that the user can get a good overview of the whole graph and all of its data. There exist a number of different algorithms that can be used to draw graphs, but they have a lot of differences. The goal of this report was to find an algorithm that produces graphs of satisfying quality in little time for the purpose of ontology engineering, and implement it using a platform that visualizes the graph using JavaFX. It is supposed to work on a visualization table with a touch display. A list of criteria for both the algorithm and the application was made to ensure that the final result would be satisfactory. A comparison between four well-known graph visualization algorithms was made and “GEM” was found to be the best suited algorithm for visualizing big graphs. The two platforms Gephi and Prefux were introduced and compared to each other, and the decision was made to implement the algorithm in Prefux since it has support for JavaFX. The algorithm was implemented and evaluated, it was found to produce visually pleasing graphs within a reasonable time frame. A modified version of the algorithm called GEM-2 was also introduced, implemented and evaluated. With GEM-2, the user can pick a specific number of levels to be expanded at first, additional levels can then be expanded by hand. This greatly improves the performance when there is no need to expand the whole graph at once, however, it also increases the amount of edge crossings which makes the graph less visually pleasing.

Place, publisher, year, edition, pages
2016. , p. 54
National Category
Computer Engineering Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-133071ISRN: LIU-IDA/LITH-EX-G--16/080--SEOAI: oai:DiVA.org:liu-133071DiVA, id: diva2:1054973
Subject / course
Computer science
Presentation
2016-11-30, Linköping, 10:00 (English)
Supervisors
Examiners
Available from: 2016-12-16 Created: 2016-12-08 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(3415 kB)236 downloads
File information
File name FULLTEXT01.pdfFile size 3415 kBChecksum SHA-512
0363ba2bb7e315fdf624461a71744445986340ed56bec7bc7629b1b0a985c2bf2df638c718280a62307fdaac3c4ad6fdd88748c01a254e03a6f92e5d350796f3
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Örnberg, Dennis
By organisation
Database and information techniques
Computer EngineeringComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 236 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 197 hits
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