Acyclic orientation of drawings

Eyal Ackerman; Kevin Buchin; Christian Knauer; Günter Rote

doi:10.7155/jgaa.00211

Acyclic orientation of drawings

Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote

Faculty of Natural Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

Given a set of pseudosegments in the plane or a topological graph, we ask for an orientation of the pseudosegments or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a pseudosegment or an edge, we provide algorithms and hardness proofs for this problem.

Original language	English
Pages (from-to)	367-384
Number of pages	18
Journal	Journal of Graph Algorithms and Applications
Volume	14
Issue number	2
DOIs	https://doi.org/10.7155/jgaa.00211
State	Published - 2010

Bibliographical note

Publisher Copyright:
© 2010, Brown University. All rights reserved.

ASJC Scopus subject areas

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

Access to Document

10.7155/jgaa.00211

Cite this

@article{552232ca720a44818ea73deac0dfb313,

title = "Acyclic orientation of drawings",

abstract = "Given a set of pseudosegments in the plane or a topological graph, we ask for an orientation of the pseudosegments or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a pseudosegment or an edge, we provide algorithms and hardness proofs for this problem.",

author = "Eyal Ackerman and Kevin Buchin and Christian Knauer and G{\"u}nter Rote",

year = "2010",

doi = "10.7155/jgaa.00211",

language = "English",

volume = "14",

pages = "367--384",

journal = "Journal of Graph Algorithms and Applications",

issn = "1526-1719",

publisher = "Brown University",

number = "2",

}

TY - JOUR

T1 - Acyclic orientation of drawings

AU - Ackerman, Eyal

AU - Buchin, Kevin

AU - Knauer, Christian

AU - Rote, Günter

PY - 2010

Y1 - 2010

N2 - Given a set of pseudosegments in the plane or a topological graph, we ask for an orientation of the pseudosegments or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a pseudosegment or an edge, we provide algorithms and hardness proofs for this problem.

AB - Given a set of pseudosegments in the plane or a topological graph, we ask for an orientation of the pseudosegments or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a pseudosegment or an edge, we provide algorithms and hardness proofs for this problem.

UR - http://www.scopus.com/inward/record.url?scp=85021645503&partnerID=8YFLogxK

U2 - 10.7155/jgaa.00211

DO - 10.7155/jgaa.00211

M3 - Article

AN - SCOPUS:85021645503

SN - 1526-1719

VL - 14

SP - 367

EP - 384

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

IS - 2

ER -

Acyclic orientation of drawings

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this