Ontologies are representations of specific domains. They help with understanding the concepts within these domains by providing definitions of their components and how they relate to each other. Ontologies are often huge and may contain thousands to hundreds of thousands of concepts. In order to easily understand them, they can be visualized as graphs. To effectively visualize these graphs, an application can use a type of graph drawing algorithm that follows pre-established criteria. This thesis studies articles about the problem of graph visualization to establish specific criteria for algorithms to satisfy. Existing algorithms are then compared with these criteria, to determine which algorithm is most suitable for implementation. Based on the comparison evaluation, the FM3 Algorithm is then implemented in Prefux. Extensions to Prefux’s input handler and touch functionality are also added to read files in the OWL format and enable interaction with the visualized graph on a state-of-the-art multi-touch table respectively.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-133167 |
| Date | January 2016 |
| Creators | Sund, Daniel |
| Publisher | Linköpings universitet, Databas och informationsteknik |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.044 seconds