Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2004
Autor:innen
Friedrich, Carsten
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
ESTIVILL-CASTRO, Vladimir, ed.. Proceedings of the 27th Australasian conference on Computer science. Australia: Australian Computer Society, 2004, pp. 369-376. Conferences in research and practice in information technology. 26
Zusammenfassung

Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarchies, or database schemas can be modelled by graphs and represented visually using graph drawing algorithms. Most existing graph drawing algorithms do not consider the size of nodes when creating a drawing. In most real world applications, however, nodes contain information which has to be displayed and nodes thus need a specific area to display this information. The required area can vary significantly between different nodes in the same graph. In this paper we present an algorithm for the layering step of hierarchical graph drawing methods that is able to take the sizes of the nodes into account. It further allows the user to choose between compact drawings with many temporary (dummy) nodes and less compact drawings with fewer dummy nodes. A large number of dummy nodes can significantly increase the running time of the subsequent steps of hierarchical graph drawing methods.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
27th Australasian Computer Science Conference, 18. Jan. 2004 - 22. Jan. 2004, Dunedin, New Zealand
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690FRIEDRICH, Carsten, Falk SCHREIBER, 2004. Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size. 27th Australasian Computer Science Conference. Dunedin, New Zealand, 18. Jan. 2004 - 22. Jan. 2004. In: ESTIVILL-CASTRO, Vladimir, ed.. Proceedings of the 27th Australasian conference on Computer science. Australia: Australian Computer Society, 2004, pp. 369-376. Conferences in research and practice in information technology. 26
BibTex
@inproceedings{Friedrich2004Flexi-40692,
  year={2004},
  title={Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size},
  number={26},
  publisher={Australian Computer Society},
  address={Australia},
  series={Conferences in research and practice in information technology},
  booktitle={Proceedings of the 27th Australasian conference on Computer science},
  pages={369--376},
  editor={Estivill-Castro, Vladimir},
  author={Friedrich, Carsten and Schreiber, Falk}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40692">
    <dcterms:title>Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size</dcterms:title>
    <dc:creator>Friedrich, Carsten</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40692"/>
    <dc:contributor>Schreiber, Falk</dc:contributor>
    <dc:contributor>Friedrich, Carsten</dc:contributor>
    <dcterms:issued>2004</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-22T09:28:29Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-22T09:28:29Z</dcterms:available>
    <dc:language>eng</dc:language>
    <dc:creator>Schreiber, Falk</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarchies, or database schemas can be modelled by graphs and represented visually using graph drawing algorithms. Most existing graph drawing algorithms do not consider the size of nodes when creating a drawing. In most real world applications, however, nodes contain information which has to be displayed and nodes thus need a specific area to display this information. The required area can vary significantly between different nodes in the same graph. In this paper we present an algorithm for the layering step of hierarchical graph drawing methods that is able to take the sizes of the nodes into account. It further allows the user to choose between compact drawings with many temporary (dummy) nodes and less compact drawings with fewer dummy nodes. A large number of dummy nodes can significantly increase the running time of the subsequent steps of hierarchical graph drawing methods.</dcterms:abstract>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen