@inproceedings{Argyriou2018-12-18Ortho-44789,
  year={2018},
  doi={10.1007/978-3-030-04414-5_36},
  title={Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity},
  number={11282},
  isbn={978-3-030-04413-8},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing and Network Visualization : 26th International Symposium, GD 2018, Proceedings},
  pages={509--523},
  editor={Biedl, Therese and Kerren, Andreas},
  author={Argyriou, Evmorfia and Cornelsen, Sabine and Förster, Henry and Kaufmann, Michael and Nöllenburg, Martin and Okamoto, Yoshio and Raftopoulou, Chrysanthi and Wolff, Alexander}
}

<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/44789">
    <dcterms:abstract xml:lang="eng">While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of research effort in graph drawing has been directed towards the study of beyond-planar graphs such as 1-planar graphs, which admit a drawing where each edge is crossed at most once. In this paper, we consider graphs with a fixed embedding. For 1-planar graphs, we present algorithms that yield orthogonal drawings with optimal curve complexity and smooth orthogonal drawings with small curve complexity. For the subclass of outer-1-planar graphs, which can be drawn such that all vertices lie on the outer face, we achieve optimal curve complexity for both, orthogonal and smooth orthogonal drawings.</dcterms:abstract>
    <dc:contributor>Nöllenburg, Martin</dc:contributor>
    <dc:creator>Okamoto, Yoshio</dc:creator>
    <dc:contributor>Wolff, Alexander</dc:contributor>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:22:45Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Nöllenburg, Martin</dc:creator>
    <dc:contributor>Raftopoulou, Chrysanthi</dc:contributor>
    <dc:creator>Argyriou, Evmorfia</dc:creator>
    <dcterms:issued>2018-12-18</dcterms:issued>
    <dc:language>eng</dc:language>
    <dc:creator>Kaufmann, Michael</dc:creator>
    <dc:creator>Raftopoulou, Chrysanthi</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Okamoto, Yoshio</dc:contributor>
    <dc:creator>Wolff, Alexander</dc:creator>
    <dc:contributor>Argyriou, Evmorfia</dc:contributor>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dc:contributor>Förster, Henry</dc:contributor>
    <dc:creator>Förster, Henry</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:22:45Z</dc:date>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Kaufmann, Michael</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44789"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity</dcterms:title>
  </rdf:Description>
</rdf:RDF>