{"id":{"repo_id":"whiterose","oai_identifier":"oai:etheses.whiterose.ac.uk:5055"},"canonical_url":"https://search.ndltd.org/etd/whiterose/oai:etheses.whiterose.ac.uk:5055","repository":{"repo_id":"whiterose","name":"White Rose University Consortium","base_url":"https://etheses.whiterose.ac.uk/cgi/oai2"},"display":{"title":"Navigating networks using overlays","abstract":"This thesis contributes a novel approach to navigation tasks in large graphs. Graph visualization is the problem of representing the structure of a mathematical graph G = (V,E), V a set of vertices (or nodes) and E ⊆V ×V a set of edges. My work is concerned with the node-link representation of graphs and I use the term network to distinguish this external representation from the underlying mathematical structure. Networks are an intuitive representation of a set of elements and the relationships between them, and are known to be effective for analysis tasks involving following paths between nodes. I define navigation as the task of identifying and following such a path in display space. Unfortunately the utility of a network diminishes as the density of edges increases and edge-crossings make navigation taxing. A well-explored approach to this problem is to find a perspicuous layout of the nodes. While this improves the readability of individual nodes and edges it may also require a compromise: to be easily understood the overall arrangement of the network should also correspond with the user’s internal mental model of the domain, a property referred to as congruence. Other solutions distort the display space or use multiple-scaled-views to promote comprehension of local details while retaining awareness of the global context, but often lack direct support for navigation of the network topology beyond the local context. This thesis contributes a model of visual graph analysis that brings together recent advances in cartographic representation, diagram comprehension, and graph visualization, leading to a greater understanding of network navigation bottlenecks in terms of the degree of correspondence between the external graph representation, and the user’s ‘mental map’. Motivated by this model I present a new approach to graph visualization that separates concerns of navigation from those of depiction with the aim of improving correspondence between the internal and external representations. I describe the design and realization of an interface for network navigation inspired by the new approach within a pipeline-based architecture, and provide a reflective evaluation of the implementation.","abstract_html":"This thesis contributes a novel approach to navigation tasks in large graphs. Graph visualization is the problem of representing the structure of a mathematical graph G = (V,E), V a set of vertices (or nodes) and E ⊆V ×V a set of edges. My work is concerned with the node-link representation of graphs and I use the term network to distinguish this external representation from the underlying mathematical structure. Networks are an intuitive representation of a set of elements and the relationships between them, and are known to be effective for analysis tasks involving following paths between nodes. I define navigation as the task of identifying and following such a path in display space. Unfortunately the utility of a network diminishes as the density of edges increases and edge-crossings make navigation taxing. A well-explored approach to this problem is to find a perspicuous layout of the nodes. While this improves the readability of individual nodes and edges it may also require a compromise: to be easily understood the overall arrangement of the network should also correspond with the user’s internal mental model of the domain, a property referred to as congruence. Other solutions distort the display space or use multiple-scaled-views to promote comprehension of local details while retaining awareness of the global context, but often lack direct support for navigation of the network topology beyond the local context. This thesis contributes a model of visual graph analysis that brings together recent advances in cartographic representation, diagram comprehension, and graph visualization, leading to a greater understanding of network navigation bottlenecks in terms of the degree of correspondence between the external graph representation, and the user’s ‘mental map’. Motivated by this model I present a new approach to graph visualization that separates concerns of navigation from those of depiction with the aim of improving correspondence between the internal and external representations. I describe the design and realization of an interface for network navigation inspired by the new approach within a pipeline-based architecture, and provide a reflective evaluation of the implementation.","abstract_has_math":false,"creators":["Myers, Colin Stephen"],"institution":"University of Leeds","degree_name":"Ph.D","degree_level":"doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Duke, D."],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-02","date_published":"2013-02","updated_at":"2026-11-18T21:24:44Z","subjects":[],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["uk.bl.ethos.589337"],"render_values":[{"text":"uk.bl.ethos.589337","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"https://etheses.whiterose.ac.uk/id/eprint/5055/1/High-Res_Colin_Myers_PhD_Thesis.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.whiterose.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.whiterose.ac.uk%3A5055","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Duke, D."]},{"key":"dc:creator","label":"Author","values":["Myers, Colin Stephen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-02"]},{"key":"dc:date.issued","label":"Date","values":["2013-02"]},{"key":"dc:publisher.commercial","label":"Dc Publisher Commercial","values":["University of Leeds"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["School of Computing (Leeds)"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Leeds"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://etheses.whiterose.ac.uk/id/eprint/5055/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["Ph.D"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["uk.bl.ethos.589337"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://etheses.whiterose.ac.uk/id/eprint/5055/1/High-Res_Colin_Myers_PhD_Thesis.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis contributes a novel approach to navigation tasks in large graphs. Graph visualization is the problem of representing the structure of a mathematical graph G = (V,E), V a set of vertices (or nodes) and E ⊆V ×V a set of edges. My work is concerned with the node-link representation of graphs and I use the term network to distinguish this external representation from the underlying mathematical structure. Networks are an intuitive representation of a set of elements and the relationships between them, and are known to be effective for analysis tasks involving following paths between nodes. I define navigation as the task of identifying and following such a path in display space. Unfortunately the utility of a network diminishes as the density of edges increases and edge-crossings make navigation taxing. A well-explored approach to this problem is to find a perspicuous layout of the nodes. While this improves the readability of individual nodes and edges it may also require a compromise: to be easily understood the overall arrangement of the network should also correspond with the user’s internal mental model of the domain, a property referred to as congruence. Other solutions distort the display space or use multiple-scaled-views to promote comprehension of local details while retaining awareness of the global context, but often lack direct support for navigation of the network topology beyond the local context. This thesis contributes a model of visual graph analysis that brings together recent advances in cartographic representation, diagram comprehension, and graph visualization, leading to a greater understanding of network navigation bottlenecks in terms of the degree of correspondence between the external graph representation, and the user’s ‘mental map’. Motivated by this model I present a new approach to graph visualization that separates concerns of navigation from those of depiction with the aim of improving correspondence between the internal and external representations. I describe the design and realization of an interface for network navigation inspired by the new approach within a pipeline-based architecture, and provide a reflective evaluation of the implementation."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Navigating networks using overlays"]}]}],"canonical_facts":{"dc:contributor.advisor":["Duke, D."],"dc:creator":["Myers, Colin Stephen"],"dc:date":["2013-02"],"dc:date.issued":["2013-02"],"dc:description.abstract":["This thesis contributes a novel approach to navigation tasks in large graphs. Graph visualization is the problem of representing the structure of a mathematical graph G = (V,E), V a set of vertices (or nodes) and E ⊆V ×V a set of edges. My work is concerned with the node-link representation of graphs and I use the term network to distinguish this external representation from the underlying mathematical structure. Networks are an intuitive representation of a set of elements and the relationships between them, and are known to be effective for analysis tasks involving following paths between nodes. I define navigation as the task of identifying and following such a path in display space. Unfortunately the utility of a network diminishes as the density of edges increases and edge-crossings make navigation taxing. A well-explored approach to this problem is to find a perspicuous layout of the nodes. While this improves the readability of individual nodes and edges it may also require a compromise: to be easily understood the overall arrangement of the network should also correspond with the user’s internal mental model of the domain, a property referred to as congruence. Other solutions distort the display space or use multiple-scaled-views to promote comprehension of local details while retaining awareness of the global context, but often lack direct support for navigation of the network topology beyond the local context. This thesis contributes a model of visual graph analysis that brings together recent advances in cartographic representation, diagram comprehension, and graph visualization, leading to a greater understanding of network navigation bottlenecks in terms of the degree of correspondence between the external graph representation, and the user’s ‘mental map’. Motivated by this model I present a new approach to graph visualization that separates concerns of navigation from those of depiction with the aim of improving correspondence between the internal and external representations. I describe the design and realization of an interface for network navigation inspired by the new approach within a pipeline-based architecture, and provide a reflective evaluation of the implementation."],"dc:format":["text"],"dc:identifier":["uk.bl.ethos.589337"],"dc:identifier.uri":["https://etheses.whiterose.ac.uk/id/eprint/5055/1/High-Res_Colin_Myers_PhD_Thesis.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.commercial":["University of Leeds"],"dc:publisher.department":["School of Computing (Leeds)"],"dc:publisher.institution":["University of Leeds"],"dc:relation.isreferencedby":["https://etheses.whiterose.ac.uk/id/eprint/5055/"],"dcterms:accessrights":["public"],"dc:title":["Navigating networks using overlays"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["Ph.D"]},"updated_at":"2026-11-18T21:24:44Z"}