KOPS - The Institutional Repository of the University of Konstanz

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

ARGYRIOU, Evmorfia, Sabine CORNELSEN, Henry FÖRSTER, Michael KAUFMANN, Martin NÖLLENBURG, Yoshio OKAMOTO, Chrysanthi RAFTOPOULOU, Alexander WOLFF, 2018. Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. Graph Drawing and Network Visualization : 26th International Symposium, GD 2018. Barcelona, Spain, Sep 26, 2018 - Sep 28, 2018. In: BIEDL, Therese, ed., Andreas KERREN, ed.. Graph Drawing and Network Visualization : 26th International Symposium, GD 2018, Proceedings. Cham:Springer, pp. 509-523. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-04413-8. Available under: doi: 10.1007/978-3-030-04414-5_36

@inproceedings{Argyriou2018-12-18Ortho-44789, title={Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity}, year={2018}, doi={10.1007/978-3-030-04414-5_36}, number={11282}, isbn={978-3-030-04413-8}, issn={0302-9743}, address={Cham}, publisher={Springer}, 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/rdf/resource/123456789/44789"> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:language>eng</dc:language> <dc:contributor>Wolff, Alexander</dc:contributor> <dc:creator>Kaufmann, Michael</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:22:45Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Wolff, Alexander</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:22:45Z</dc:date> <dc:contributor>Kaufmann, Michael</dc:contributor> <dc:contributor>Nöllenburg, Martin</dc:contributor> <dc:contributor>Okamoto, Yoshio</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Cornelsen, Sabine</dc:contributor> <dcterms:issued>2018-12-18</dcterms:issued> <dc:creator>Cornelsen, Sabine</dc:creator> <dc:contributor>Förster, Henry</dc:contributor> <dc:creator>Nöllenburg, Martin</dc:creator> <dc:creator>Argyriou, Evmorfia</dc:creator> <dc:creator>Okamoto, Yoshio</dc:creator> <dcterms:title>Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity</dcterms:title> <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:creator>Förster, Henry</dc:creator> <dc:contributor>Raftopoulou, Chrysanthi</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Raftopoulou, Chrysanthi</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44789"/> <dc:contributor>Argyriou, Evmorfia</dc:contributor> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account