High-quality ultra-compact grid layout of grouped networks


Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

YOGHOURDJIAN, Vahan, Tim DWYER, Graeme GANGE, Steve KIEFFER, Karsten KLEIN, Kim MARRIOTT, 2016. High-quality ultra-compact grid layout of grouped networks. In: IEEE transactions on visualization and computer graphics. 22(1), pp. 339-348. ISSN 1077-2626. eISSN 1941-0506

@article{Yoghourdjian2016High--36861, title={High-quality ultra-compact grid layout of grouped networks}, year={2016}, doi={10.1109/TVCG.2015.2467251}, number={1}, volume={22}, issn={1077-2626}, journal={IEEE transactions on visualization and computer graphics}, pages={339--348}, author={Yoghourdjian, Vahan and Dwyer, Tim and Gange, Graeme and Kieffer, Steve and Klein, Karsten and Marriott, Kim} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/36861"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-01-20T10:13:37Z</dc:date> <dc:creator>Yoghourdjian, Vahan</dc:creator> <dc:creator>Marriott, Kim</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Gange, Graeme</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-01-20T10:13:37Z</dcterms:available> <dc:creator>Dwyer, Tim</dc:creator> <dc:contributor>Klein, Karsten</dc:contributor> <dc:creator>Kieffer, Steve</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/36861"/> <dc:creator>Klein, Karsten</dc:creator> <dc:contributor>Kieffer, Steve</dc:contributor> <dc:contributor>Yoghourdjian, Vahan</dc:contributor> <dc:contributor>Marriott, Kim</dc:contributor> <dc:contributor>Dwyer, Tim</dc:contributor> <dcterms:issued>2016</dcterms:issued> <dcterms:title>High-quality ultra-compact grid layout of grouped networks</dcterms:title> <dcterms:abstract xml:lang="eng">Prior research into network layout has focused on fast heuristic techniques for layout of large networks, or complex multi-stage pipelines for higher quality layout of small graphs. Improvements to these pipeline techniques, especially for orthogonal-style layout, are difficult and practical results have been slight in recent years. Yet, as discussed in this paper, there remain significant issues in the quality of the layouts produced by these techniques, even for quite small networks. This is especially true when layout with additional grouping constraints is required. The first contribution of this paper is to investigate an ultra-compact, grid-like network layout aesthetic that is motivated by the grid arrangements that are used almost universally by designers in typographical layout. Since the time when these heuristic and pipeline-based graph-layout methods were conceived, generic technologies (MIP, CP and SAT) for solving combinatorial and mixed-integer optimization problems have improved massively. The second contribution of this paper is to reassess whether these techniques can be used for high-quality layout of small graphs. While they are fast enough for graphs of up to 50 nodes we found these methods do not scale up. Our third contribution is a large-neighborhood search meta-heuristic approach that is scalable to larger networks.</dcterms:abstract> <dc:creator>Gange, Graeme</dc:creator> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto