Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

Cornelsen, Sabine; Diatzko, Gregor

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

Dateien

Cornelsen_2-l12mzkz1gcx21.pdfGröße: 597.47 KBDownloads: 5

Datum

2023

Angaben zur Forschungsförderung

Deutsche Forschungsgemeinschaft (DFG): 50974019

Open Access-Veröffentlichung

Open Access Gold

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Zusammenfassung

In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may overlap in their first or last segment, but must not intersect otherwise. PCODs can be seen as a directed variant of Kandinsky drawings or as planar L-drawings of subdivisions of digraphs. The maximum number of subdivision vertices in any edge is then the split complexity. A PCOD is upward if each edge is drawn with monotonically increasing y-coordinates and quasi-upward if no edge starts with decreasing y-coordinates. We study the split complexity of PCODs and (quasi-)upward PCODs for various classes of graphs.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Computational Theory and Mathematics, Geometry and Topology, Computer Science Applications, General Computer Science, Theoretical Computer Science

Zitieren

ISO 690

CORNELSEN, Sabine, Gregor DIATZKO, 2023. Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. In: Journal of Graph Algorithms and Applications. Brown University. 2023, 27(7), pp. 523-540. eISSN 1526-1719. Available under: doi: 10.7155/jgaa.00632

BibTex

@article{Cornelsen2023-08Plana-68534,
  year={2023},
  doi={10.7155/jgaa.00632},
  title={Planar Confluent Orthogonal Drawings of 4-Modal Digraphs},
  number={7},
  volume={27},
  journal={Journal of Graph Algorithms and Applications},
  pages={523--540},
  author={Cornelsen, Sabine and Diatzko, Gregor}
}

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/68534">
    <dc:creator>Diatzko, Gregor</dc:creator>
    <dc:contributor>Diatzko, Gregor</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/68534/1/Cornelsen_2-l12mzkz1gcx21.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2023-08</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/68534"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-11-30T11:28:39Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dcterms:title>Planar Confluent Orthogonal Drawings of 4-Modal Digraphs</dcterms:title>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dcterms:abstract>In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may overlap in their first or last segment, but must not intersect otherwise. PCODs can be seen as a directed variant of Kandinsky drawings or as planar L-drawings of subdivisions of digraphs. The maximum number of subdivision vertices in any edge is then the split complexity. A PCOD is upward if each edge is drawn with monotonically increasing y-coordinates and quasi-upward if no edge starts with decreasing y-coordinates. We study the split complexity of PCODs and (quasi-)upward PCODs for various classes of graphs.</dcterms:abstract>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/68534/1/Cornelsen_2-l12mzkz1gcx21.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-11-30T11:28:39Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja

Begutachtet

Ja