Acyclic orientation of drawings

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

doi:10.1007/11785293_26

Acyclic orientation of drawings

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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

Original language	English
Title of host publication	Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings
Publisher	Springer Verlag
Pages	268-279
Number of pages	12
ISBN (Print)	354035753X, 9783540357537
DOIs	https://doi.org/10.1007/11785293_26
State	Published - 2006
Externally published	Yes
Event	10th Scandinavian Workshop on Algorithm Theory, SWAT 2006 - Riga, Latvia Duration: 6 Jul 2006 → 8 Jul 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4059 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th Scandinavian Workshop on Algorithm Theory, SWAT 2006
Country/Territory	Latvia
City	Riga
Period	6/07/06 → 8/07/06

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11785293_26

Cite this

Ackerman, E., Buchin, K., Knauer, C., & Rote, G. (2006). Acyclic orientation of drawings. In Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings (pp. 268-279). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4059 LNCS). Springer Verlag. https://doi.org/10.1007/11785293_26

@inproceedings{63bf005e52e248efafcad2396afb7811,

title = "Acyclic orientation of drawings",

abstract = "Given a set of curves in the plane or a topological graph, we ask for an orientation of the curves or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a curve 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 = "2006",

doi = "10.1007/11785293_26",

language = "English",

isbn = "354035753X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "268--279",

booktitle = "Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings",

address = "Germany",

note = "10th Scandinavian Workshop on Algorithm Theory, SWAT 2006 ; Conference date: 06-07-2006 Through 08-07-2006",

}

Ackerman, E, Buchin, K, Knauer, C & Rote, G 2006, Acyclic orientation of drawings. in Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4059 LNCS, Springer Verlag, pp. 268-279, 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, Riga, Latvia, 6/07/06. https://doi.org/10.1007/11785293_26

Acyclic orientation of drawings. / Ackerman, Eyal; Buchin, Kevin; Knauer, Christian et al.
Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings. Springer Verlag, 2006. p. 268-279 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4059 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Acyclic orientation of drawings

AU - Ackerman, Eyal

AU - Buchin, Kevin

AU - Knauer, Christian

AU - Rote, Günter

PY - 2006

Y1 - 2006

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

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

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

U2 - 10.1007/11785293_26

DO - 10.1007/11785293_26

M3 - Conference contribution

AN - SCOPUS:33746426711

SN - 354035753X

SN - 9783540357537

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 279

BT - Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings

PB - Springer Verlag

T2 - 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006

Y2 - 6 July 2006 through 8 July 2006

ER -

Acyclic orientation of drawings

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this