NodeShuffler/doc/zotero_backup/NodePlacementAnimation/NodePlacementAnimation.rdf

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns:z="http://www.zotero.org/namespaces/export#"
 xmlns:dcterms="http://purl.org/dc/terms/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:bib="http://purl.org/net/biblio#"
 xmlns:foaf="http://xmlns.com/foaf/0.1/"
 xmlns:link="http://purl.org/rss/1.0/modules/link/"
 xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
 xmlns:vcard="http://nwalsh.com/rdf/vCard#">
    <bib:BookSection rdf:about="urn:isbn:978-3-540-43309-5%20978-3-540-45848-7">
        <z:itemType>bookSection</z:itemType>
        <dcterms:isPartOf>
            <bib:Book>
                <dcterms:isPartOf>
                    <bib:Series>
                       <dc:title>Lecture Notes in Computer Science</dc:title>
                    </bib:Series>
                </dcterms:isPartOf>
                <dc:identifier>ISBN 978-3-540-43309-5 978-3-540-45848-7</dc:identifier>
                <dc:title>Graph Drawing</dc:title>
            </bib:Book>
        </dcterms:isPartOf>
        <dc:publisher>
            <foaf:Organization>
               <foaf:name>Springer, Berlin, Heidelberg</foaf:name>
            </foaf:Organization>
        </dc:publisher>
        <bib:authors>
            <rdf:Seq>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Brandes</foaf:surname>
                        <foaf:givenname>Ulrik</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Köpf</foaf:surname>
                        <foaf:givenname>Boris</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
            </rdf:Seq>
        </bib:authors>
        <link:link rdf:resource="#item_1052"/>
        <bib:pages>31-44</bib:pages>
        <dc:date>2001/9/23</dc:date>
        <dc:description>DOI: 10.1007/3-540-45848-4_3</dc:description>
        <dcterms:dateSubmitted>2018-06-09 01:12:32</dcterms:dateSubmitted>
        <z:language>english</z:language>
        <dcterms:abstract>We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to implement and compares well with existing approaches in terms of assignment quality.</dcterms:abstract>
        <dc:title>Fast and Simple Horizontal Coordinate Assignment</dc:title>
    </bib:BookSection>
    <z:Attachment rdf:about="#item_1052">
        <z:itemType>attachment</z:itemType>
        <rdf:resource rdf:resource="files/1052/Brandes and Köpf - 2001 - Fast and Simple Horizontal Coordinate Assignment.pdf"/>
        <dc:identifier>
            <dcterms:URI>
                <rdf:value>https://link.springer.com/content/pdf/10.1007%2F3-540-45848-4_3.pdf</rdf:value>
            </dcterms:URI>
        </dc:identifier>
        <dcterms:dateSubmitted>2018-06-09 01:12:33</dcterms:dateSubmitted>
        <dc:title>Full Text PDF</dc:title>
        <z:linkMode>1</z:linkMode>
        <link:type>application/pdf</link:type>
    </z:Attachment>
    <bib:Data rdf:about="https://github.com/stleary/JSON-java">
        <z:itemType>computerProgram</z:itemType>
        <z:programmers>
            <rdf:Seq>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Leary</foaf:surname>
                        <foaf:givenname>Sean</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Crockford</foaf:surname>
                        <foaf:givenname>Douglas</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
            </rdf:Seq>
        </z:programmers>
        <dc:identifier>
            <dcterms:URI>
               <rdf:value>https://github.com/stleary/JSON-java</rdf:value>
            </dcterms:URI>
        </dc:identifier>
        <dc:rights>MIT</dc:rights>
        <dc:date>2018-06-08T16:01:34Z</dc:date>
        <z:libraryCatalog>GitHub</z:libraryCatalog>
        <z:programmingLanguage>Java</z:programmingLanguage>
        <dc:title>JSON-java: A reference implementation of a JSON package in Java</dc:title>
        <z:shortTitle>JSON-java</z:shortTitle>
    </bib:Data>
    <bib:Article rdf:about="#item_1059">
        <z:itemType>journalArticle</z:itemType>
        <dcterms:isPartOf rdf:resource="urn:issn:0018-9472"/>
        <bib:authors>
            <rdf:Seq>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Sugiyama</foaf:surname>
                        <foaf:givenname>K.</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Tagawa</foaf:surname>
                        <foaf:givenname>S.</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Toda</foaf:surname>
                        <foaf:givenname>M.</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
            </rdf:Seq>
        </bib:authors>
        <dc:subject>
           <z:AutomaticTag><rdf:value>Testing</rdf:value></z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Computer displays</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Constraint theory</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Engineering drawings</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
           <z:AutomaticTag><rdf:value>Flowcharts</rdf:value></z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Hierarchical systems</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Image recognition</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Information science</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
            <z:AutomaticTag>
               <rdf:value>Processor scheduling</rdf:value>
            </z:AutomaticTag>
        </dc:subject>
        <dc:subject>
           <z:AutomaticTag><rdf:value>Programming</rdf:value></z:AutomaticTag>
        </dc:subject>
        <bib:pages>109-125</bib:pages>
        <dc:date>February 1981</dc:date>
        <z:libraryCatalog>IEEE Xplore</z:libraryCatalog>
        <dcterms:abstract>Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods. The methods determine the positions of vertices in two steps. First the order of the vertices in each level is determined to reduce the number of crossings of edges. Then horizontal positions of the vertices are determined to improve further the readability of drawings. The theoretical methods are useful in recognizing the nature of the problem, and the heuristic methods make it possible to enlarge the size of hierarchies with which we can deal. Performance tests of the heuristic methods and several applications are presented.</dcterms:abstract>
        <dc:title>Methods for Visual Understanding of Hierarchical System Structures</dc:title>
    </bib:Article>
    <bib:Journal rdf:about="urn:issn:0018-9472">
        <prism:volume>11</prism:volume>
        <prism:number>2</prism:number>
        <dc:title>IEEE Transactions on Systems, Man, and Cybernetics</dc:title>
        <dc:identifier>ISSN 0018-9472</dc:identifier>
        <dc:identifier>DOI 10.1109/TSMC.1981.4308636</dc:identifier>
    </bib:Journal>
    <bib:Data rdf:about="https://github.com/eclipse/elk">
        <z:itemType>computerProgram</z:itemType>
        <dc:publisher>
            <foaf:Organization>
               <foaf:name>Eclipse Foundation</foaf:name>
            </foaf:Organization>
        </dc:publisher>
        <dc:identifier>
            <dcterms:URI>
               <rdf:value>https://github.com/eclipse/elk</rdf:value>
            </dcterms:URI>
        </dc:identifier>
        <dc:rights>EPL-1.0</dc:rights>
        <dc:date>2018-06-09T11:09:35Z</dc:date>
        <z:libraryCatalog>GitHub</z:libraryCatalog>
        <z:programmingLanguage>Java</z:programmingLanguage>
        <dc:title>ELK: Eclipse Layout Kernel - Automatic layout for Java applications</dc:title>
        <z:shortTitle>ELK</z:shortTitle>
    </bib:Data>
    <bib:Thesis rdf:about="#item_1066">
        <z:itemType>thesis</z:itemType>
        <dc:publisher>
            <foaf:Organization>
                <vcard:adr>
                    <vcard:Address>
                       <vcard:locality>Kiel</vcard:locality>
                    </vcard:Address>
                </vcard:adr>
                <foaf:name>Christian-Albrechts-Universität zu Kiel</foaf:name>
            </foaf:Organization>
        </dc:publisher>
        <bib:authors>
            <rdf:Seq>
                <rdf:li>
                    <foaf:Person>
                        <foaf:surname>Carstens</foaf:surname>
                        <foaf:givenname>John Julian</foaf:givenname>
                    </foaf:Person>
                </rdf:li>
            </rdf:Seq>
        </bib:authors>
        <link:link rdf:resource="#item_1065"/>
        <dc:date>September 2012</dc:date>
        <z:type>master</z:type>
        <z:language>english</z:language>
        <dcterms:abstract>In graphical modelling, the arrangement of diagram elements can be a tiresome and mechanic work. To free users from this, layout algorithms arrange the diagram elements automatically. Different modelling domains require different layouts. A layout approach suitable for data flow diagrams is the layered layout approach. This approach is structured in several phases, of which one is called node placement. Present implementations are known to produce many edge bends. One task of this thesis is to employ a node placement algorithm which yields significantly less edge bends. Another well known problem in layout algorithms is label placement. Present approaches rely on a post-processing by placing labels after the diagram has been laid out. The approaches presented in this thesis integrate label placement into the layout, resulting in more freedom and clean placements of labels. Evaluation shows that both tasks can be fulfilled, but have to accept a trade-off which is a generally larger drawing of the respective  diagrams.</dcterms:abstract>
        <dc:title>Node and Label Placement in a Layered Layout Algorithm</dc:title>
    </bib:Thesis>
    <z:Attachment rdf:about="#item_1065">
        <z:itemType>attachment</z:itemType>
        <rdf:resource rdf:resource="files/1065/Carstens - Node and Label Placement in a Layered Layout Algor.pdf"/>
        <dc:title>Carstens - Node and Label Placement in a Layered Layout Algor.pdf</dc:title>
        <link:type>application/pdf</link:type>
    </z:Attachment>
</rdf:RDF>